7 citations · 27 across the 14 of their papers we have counts for
1 paper · 1 filter
Jörn Steuding, Marc 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.