Abstract

In English-language literature, Beatty sequence means a sequence of the form [αn] and, more generally, [αn + β], where α is a positive irrational number, β is a real number (if β = 0, then the sequence is called homogeneous, otherwise it is called non-homogeneous). In Russian literature, such sequences are usually referred to as greatest-integer sequences of a special form, or as generalized arithmetic progressions. The properties of these sequences have been under extensive study ever since late 19th century and up to nowadays. This paper contains a review of main directions in Beatty sequences research, and points out some key results. The investigation of the distribution of prime numbers in Beatty sequences, once started in 1970s, was continued in 2000s, when due to application of new methods it became possible to improve estimates of remainder terms in asymptotic formulas. A wide range of tasks deal with sums of the values of arithmetical functions over Beatty sequences. Various authors obtained asymptotic formulas for sums of the values of divisor function τ(n) and multidimensional divisor function τk(n), of divisor-summing function σ(n), of Euler function ϕ(n), of Dirichlet characters, of prime divisor counting function ω(n). Besides that, there appeared various results concerning quadratic residues and nonresidues in Beatty sequences. Since 1990s additive tasks associated with Beatty sequences became a topical direction of study. Someanaloguesof classical Goldbachtype problems, where primes belong to Beatty sequences, are under research, along with tasks of representation of integers as a sum, a part of summands of which are members of such a sequence.

Highlights

  • The investigation of the distribution of prime numbers in Beatty sequences, once started in 1970s, was continued in 2000s, when due to application of new methods it became possible to improve estimates of remainder terms in asymptotic formulas

  • A wide range of tasks deal with sums of the values of arithmetical functions over Beatty sequences

  • Since 1990s additive tasks associated with Beatty sequences became a topical direction of study

Read more

Summary

Introduction

The investigation of the distribution of prime numbers in Beatty sequences, once started in 1970s, was continued in 2000s, when due to application of new methods it became possible to improve estimates of remainder terms in asymptotic formulas. Вольке [5] рассмотрели задачу о распределении простых чисел в последовательности Битти. Что если π(N ) — количество всех простых чисел, не превосходящих N , а π(N, α) — количество тех из них, которые принадлежат последовательности [αn], то для почти всех значений α > 0 при N → ∞ справедлива асимптотическая формула π(N, α) = ∑︁ 1 = π(N ) + O(N 7/8+ε), α pN p=[αn],n∈N

Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call