The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
We consider the -ary digital expansion of the first terms of an exponential sequence . 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 digits is asymptotically equal to the expected value. Under stronger assumptions we get a similar result for the first digits, where is a positive constant. In both methods, we use estimations of exponential sums and the concept of discrepancy of real sequences modulo ...
We give a necessary and sufficient condition such that, for almost all s ∈ ℝ,
||nθ - s|| < ψ(n) for infinitely many n ∈ ℕ,
where θ is fixed and ψ(n) is a positive, non-increasing sequence. This can be seen as a dual result to classical theorems of Khintchine and Szüsz which dealt with the situation where s is fixed and θ is random. Moreover, our result contains several earlier ones as special cases: two old theorems of Kurzweil, a theorem of Tseng and a recent...
Download Results (CSV)