Abstract: We prove an upper bound for the least prime in an irrational Beatty sequence. This result may be compared with Linnik's theorem on the least prime in an arithmetic progression.
Recommendations
Cites work
- An introduction to the theory of numbers. Transl. from the English by François Sauvageot, introduction by Catherine Goldstein
- Approximate formulas for some functions of prime numbers
- scientific article; zbMATH DE number 3950629 (Why is no real title available?)
- scientific article; zbMATH DE number 2137052 (Why is no real title available?)
- scientific article; zbMATH DE number 2121181 (Why is no real title available?)
- scientific article; zbMATH DE number 3028177 (Why is no real title available?)
- scientific article; zbMATH DE number 3074952 (Why is no real title available?)
- scientific article; zbMATH DE number 3105562 (Why is no real title available?)
- scientific article; zbMATH DE number 3105563 (Why is no real title available?)
- On the distribution of αp modulo 1
- Prime-detecting sieves
- The Bracket Function and Complementary Sets of Integers
- The zeros of Dirichlet \(L\)-functions and the least prime in arithmetic progression
Cited in
(3)
This page was built for publication: The least prime number in a Beatty sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q739283)
