arXiv Analytics

Sign in

arXiv:1512.08382 [math.NT]AbstractReferencesReviewsResources

The Least Prime Number in a Beatty Sequence

Jörn Steuding, Marc Technau

Published 2015-12-28Version 1

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.

Comments: 17 pages
Categories: math.NT
Related articles: Most relevant | Search more
arXiv:1104.2542 [math.NT] (Published 2011-04-13)
The influence of the first term of an arithmetic progression
arXiv:1301.5029 [math.NT] (Published 2013-01-21)
Markoff-Rosenberger triples in arithmetic progression
arXiv:2005.10396 [math.NT] (Published 2020-05-20)
Zeckendorf's Theorem Using Indices in an Arithmetic Progression

Links

Toolbox