The Least Prime Number in a Beatty Sequence
Number Theory
2016-07-26 v2
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.
Keywords
Cite
@article{arxiv.1512.08382,
title = {The Least Prime Number in a Beatty Sequence},
author = {Jörn Steuding and Marc Technau},
journal= {arXiv preprint arXiv:1512.08382},
year = {2016}
}
Comments
17 pages