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.
We discuss the metric theory of simultaneous diophantine approximations in the non-archimedean case. First, we show a Gallagher type 0-1 law. Then by using this theorem, we prove a Duffin-Schaeffer type theorem.
We give qualitative and quantitative improvements on all the best previously known irrationality results for dilogarithms of positive rational numbers. We obtain such improvements by applying our permutation group method to the diophantine study of double integrals of rational functions related to the dilogarithm.
We study the function , where θ is a positive real number, ⌊·⌋ and · are the floor and fractional part functions, respectively. Nathanson proved, among other properties of , that if log θ is rational, then for all but finitely many positive integers n, . We extend this by showing that, without any condition on θ, all but a zero-density set of integers n satisfy . Using a metric result of Schmidt, we show that almost all θ have asymptotically (log θ log x)/12 exceptional n ≤ x. Using continued...