Abstract
For any prime $r \in \mathbb N$ and almost all $k \in \mathbb N$ smaller than $x^r$, we show that the polynomial $f(n) = n^r + k$ takes the expected number of prime values, as $n$ ranges from 1 to $x$. As a consequence, we deduce statements concerning var
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have