加载中…
2015-12-28
The Least Prime Number in a Beatty Sequence
Jörn SteudingMarc Technau
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本