The least prime number in a Beatty sequence

JOURNAL OF NUMBER THEORY

卷:169

Article

Steuding, Joern¹  Technau, Marc¹ 

[1] Univ Wurzburg, Dept Math, Campus Hubland Nord,Emil Fischer Str 40, D-97074 Wurzburg, Germany

关键词: Prime number;    Beatty sequence;    Linnik's theorem;   

DOI  :  10.1016/j.jnt.2016.05.022

来源: Elsevier

【 摘 要 】

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. (C) 2016 Elsevier Inc. All rights reserved.

【 授权许可】

Free