Small solutions of cubic equations with prime variables in arithmetic progressions
In an earlier paper [9], the authors discussed some solved and unsolved problems in combinatorial number theory. First we will give an update of some of these problems. In the remaining part of this paper we will discuss some further problems of the two authors.
A new method for counting primes in a Beatty sequence is proposed, and it is shown that an asymptotic formula can be obtained for the number of such primes in a short interval.