| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4593192 | Journal of Number Theory | 2016 | 16 Pages |
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
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Jörn Steuding, Marc Technau,