Displaying 181 – 200 of 266

Showing per page

Piatetski-Shapiro sequences via Beatty sequences

Lukas Spiegelhofer (2014)

Acta Arithmetica

Integer sequences of the form n c , where 1 < c < 2, can be locally approximated by sequences of the form ⌊nα+β⌋ in a very good way. Following this approach, we are led to an estimate of the difference n x φ ( n c ) - 1 / c n x c φ ( n ) n 1 / c - 1 , which measures the deviation of the mean value of φ on the subsequence n c from the expected value, by an expression involving exponential sums. As an application we prove that for 1 < c ≤ 1.42 the subsequence of the Thue-Morse sequence indexed by n c attains both of its values with asymptotic...

Prime numbers along Rudin–Shapiro sequences

Christian Mauduit, Joël Rivat (2015)

Journal of the European Mathematical Society

For a large class of digital functions f , we estimate the sums n x Λ ( n ) f ( n ) (and n x μ ( n ) f ( n ) , where Λ denotes the von Mangoldt function (and μ the Möbius function). We deduce from these estimates a Prime Number Theorem (and a Möbius randomness principle) for sequences of integers with digit properties including the Rudin-Shapiro sequence and some of its generalizations.

Propriétés topologiques et combinatoires des échelles de numération

Guy Barat, Tomasz Downarowicz, Anzelm Iwanik, Pierre Liardet (2000)

Colloquium Mathematicae

Topological and combinatorial properties of dynamical systems called odometers and arising from number systems are investigated. First, a topological classification is obtained. Then a rooted tree describing the carries in the addition of 1 is introduced and extensively studied. It yields a description of points of discontinuity and a notion of low scale, which is helpful in producing examples of what the dynamics of an odometer can look like. Density of the orbits is also discussed.

Relations among arithmetical functions, automatic sequences, and sum of digits functions induced by certain Gray codes

Yuichi Kamiya, Leo Murata (2012)

Journal de Théorie des Nombres de Bordeaux

In the study of the 2 -adic sum of digits function S 2 ( n ) , the arithmetical function u ( 0 ) = 0 and u ( n ) = ( - 1 ) n - 1 for n 1 plays a very important role. In this paper, we firstly generalize the relation between S 2 ( n ) and u ( n ) to a bijective relation between arithmetical functions. And as an application, we investigate some aspects of the sum of digits functions S 𝒢 ( n ) induced by binary infinite Gray codes 𝒢 . We can show that the difference of the sum of digits function, S 𝒢 ( n ) - S 𝒢 ( n - 1 ) , is realized by an automaton. And the summation formula of the sum...

Currently displaying 181 – 200 of 266