The Least Prime Number in a Beatty Sequence
classification
🧮 math.NT
keywords
leastprimebeattysequencearithmeticboundcomparedirrational
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.