arXiv · 1512.08382
The Least Prime Number in a Beatty Sequence
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Jörn Steuding, Marc Technau. 2016-05-30. The Least Prime Number in a Beatty Sequence. https://doi.org/10.1016/j.jnt.2016.05.022
Cite the original work for its findings. Save a collection to share your selection of sources.