Displaying similar documents to “On the distribution of p α modulo one”

Digital expansion of exponential sequences

Michael Fuchs (2002)

Journal de théorie des nombres de Bordeaux

Similarity:

We consider the q -ary digital expansion of the first N terms of an exponential sequence a n . Using a result due to Kiss and Tichy [8], we prove that the average number of occurrences of an arbitrary digital block in the last c log N digits is asymptotically equal to the expected value. Under stronger assumptions we get a similar result for the first ( log N ) 3 2 - ϵ digits, where ϵ is a positive constant. In both methods, we use estimations of exponential sums and the concept of discrepancy of real sequences...

On the almost Goldbach problem of Linnik

Jianya Liu, Ming-Chit Liu, Tianze Wang (1999)

Journal de théorie des nombres de Bordeaux

Similarity:

Under the Generalized Riemann Hypothesis, it is proved that for any k 200 there is N k > 0 depending on k only such that every even integer N k is a sum of two odd primes and k powers of 2 .

On the fractional parts of x / n and related sequences. II

Bahman Saffari, R. C. Vaughan (1977)

Annales de l'institut Fourier

Similarity:

As promised in the first paper of this series (Ann. Inst. Fourier, 26-4 (1976), 115-131), these two articles deal with the asymptotic distribution of the fractional parts of x h ( x ) where h is an arithmetical function (namely h ( n ) = 1 / n , h ( n ) = log n , h ( n ) = 1 / log n ) and n is an integer (or a prime order) running over the interval [ y ( x ) , x ) ] . The results obtained are rather sharp, although one can improve on some of them at the cost of increased technicality. Number-theoretic applications will be given later on.

Linear forms in the logarithms of three positive rational numbers

Curtis D. Bennett, Josef Blass, A. M. W. Glass, David B. Meronk, Ray P. Steiner (1997)

Journal de théorie des nombres de Bordeaux

Similarity:

In this paper we prove a lower bound for the linear dependence of three positive rational numbers under certain weak linear independence conditions on the coefficients of the linear forms. Let Λ = b 2 log α 2 - b 1 log α 1 - b 3 log α 3 0 with b 1 , b 2 , b 3 positive integers and α 1 , α 2 , α 3 positive multiplicatively independent rational numbers greater than 1 . Let α j 1 = α j 1 / α j 2 with α j 1 , α j 2 coprime positive integers ( j = 1 , 2 , 3 ) . Let α j max { α j 1 , e } and assume that gcd ( b 1 , b 2 , b 3 ) = 1 . Let b ' = b 2 log α 1 + b 1 log α 2 b 2 log α 3 + b 3 log α 2 and assume that B max { 10 , log b ' } . We prove that either { b 1 , b 2 , b 3 } is c 4 , B -linearly dependent over (with respect to a 1 , a 2 , a 3 )...

On the L 1 norm of exponential sums

S. K. Pichorides (1980)

Annales de l'institut Fourier

Similarity:

The L 1 norm of a trigonometric polynomial with N non zero coefficients of absolute value not less than 1 exceeds a fixed positive multiple of C ( log N ) / ( log log N ) 2 .

On an estimate of Walfisz and Saltykov for an error term related to the Euler function

Y.-F. S. Pétermann (1998)

Journal de théorie des nombres de Bordeaux

Similarity:

The technique developed by A. Walfisz in order to prove (in 1962) the estimate H ( x ) ( log x ) 2 / 3 ( log log x ) 4 / 3 for the error term H ( x ) = n x φ ( n ) n - 6 π 2 x related to the Euler function is extended. Moreover, the argument is simplified by exploiting works of A.I. Saltykov and of A.A. Karatsuba. It is noted in passing that the proof proposed by Saltykov in 1960 of H ( x ) ( log x ) 2 / 3 ( log log x ) 1 + ϵ is erroneous and once corrected “only” yields Walfisz’ result. The generalizations obtained can be applied to error terms related to various classical - and less classical -...

Besicovitch subsets of self-similar sets

Ji-Hua Ma, Zhi-Ying Wen, Jun Wu (2002)

Annales de l’institut Fourier

Similarity:

Let E be a self-similar set with similarities ratio r j ( 0 j m - 1 ) and Hausdorff dimension s , let p ( p 0 , p 1 ) ... p m - 1 be a probability vector. The Besicovitch-type subset of E is defined as E ( p ) = x E : lim n 1 n k = 1 n χ j ( x k ) = p j , 0 j m - 1 , where χ j is the indicator function of the set { j } . Let α = dim H ( E ( p ) ) = dim P ( E ( p ) ) = j = 0 m - 1 p j log p j j = 0 m - 1 p i log r j and g be a gauge function, then we prove in this paper:(i) If p = ( r 0 s , r 1 s , , r m - 1 s ) , then s ( E ( p ) ) = s ( E ) , 𝒫 s ( E ( p ) ) = 𝒫 s ( E ) , moreover both of s ( E ) and 𝒫 s ( E ) are finite positive;(ii) If p is a positive probability vector other than ( r 0 s , r 1 s , , r m - 1 s ) , then the gauge functions can be partitioned as follows ...

The complex sum of digits function and primes

Jörg M. Thuswaldner (2000)

Journal de théorie des nombres de Bordeaux

Similarity:

Canonical number systems in the ring of gaussian integers [ i ] are the natural generalization of ordinary q -adic number systems to [ i ] . It turns out, that each gaussian integer has a unique representation with respect to the powers of a certain base number b . In this paper we investigate the sum of digits function ν b of such number systems. First we prove a theorem on the sum of digits of numbers, that are not divisible by the f -th power of a prime. Furthermore, we establish an Erdös-Kac type...