Displaying 241 – 260 of 266

Showing per page

The summatory function of q -additive functions on pseudo-polynomial sequences

Manfred G. Madritsch (2012)

Journal de Théorie des Nombres de Bordeaux

The present paper deals with the summatory function of functions acting on the digits of an q -ary expansion. In particular let n be a positive integer, then we call n = r = 0 d r ( n ) q r with d r ( n ) { 0 , ... , q - 1 } its q -ary expansion. We call a function f strictly q -additive, if for a given value, it acts only on the digits of its representation, i.e., f ( n ) = r = 0 f d r ( n ) . Let p ( x ) = α 0 x β 0 + + α d x β d with α 0 , α 1 , ... , α d , , α 0 > 0 , β 0 > > β d 1 and at least one β i . Then we call p a pseudo-polynomial.The goal is to prove that for a q -additive function f there exists an ε > 0 such that n N f p ( n ) = μ f N log q ( p ( N ) ) + N F f , β 0 log q ( p ( N ) ) + 𝒪 N 1 - ε , where μ f is the mean of the values of f ...

Théorème des nombres premiers pour les fonctions digitales

Bruno Martin, Christian Mauduit, Joël Rivat (2014)

Acta Arithmetica

The aim of this work is to estimate exponential sums of the form n x Λ ( n ) e x p ( 2 i π ( f ( n ) + β n ) ) , where Λ denotes von Mangoldt’s function, f a digital function, and β ∈ ℝ a parameter. This result can be interpreted as a Prime Number Theorem for rotations (i.e. a Vinogradov type theorem) twisted by digital functions.

Topological properties of two-dimensional number systems

Shigeki Akiyama, Jörg M. Thuswaldner (2000)

Journal de théorie des nombres de Bordeaux

In the two dimensional real vector space 2 one can define analogs of the well-known q -adic number systems. In these number systems a matrix M plays the role of the base number q . In the present paper we study the so-called fundamental domain of such number systems. This is the set of all elements of 2 having zero integer part in their “ M -adic” representation. It was proved by Kátai and Környei, that is a compact set and certain translates of it form a tiling of the 2 . We construct points, where...

Triangular repunit-there is but 1

John H. Jaroma (2010)

Czechoslovak Mathematical Journal

In this paper, we demonstrate that 1 is the only integer that is both triangular and a repunit.

Truncatable primes and unavoidable sets of divisors

Artūras Dubickas (2006)

Acta Mathematica Universitatis Ostraviensis

We are interested whether there is a nonnegative integer u 0 and an infinite sequence of digits u 1 , u 2 , u 3 , in base b such that the numbers u 0 b n + u 1 b n - 1 + + u n - 1 b + u n , where n = 0 , 1 , 2 , , are all prime or at least do not have prime divisors in a finite set of prime numbers S . If any such sequence contains infinitely many elements divisible by at least one prime number p S , then we call the set S unavoidable with respect to b . It was proved earlier that unavoidable sets in base b exist if b { 2 , 3 , 4 , 6 } , and that no unavoidable set exists in base b = 5 . Now, we prove...

Currently displaying 241 – 260 of 266