Given a prime $p$, let $a_n=pn+n-1$.
I have noticed that $\forall{p}\exists{n}\in[2,p]:a_n\in\mathbb{P}$.
For example: $p=7,a_3=23,a_4=31,a_6=47$.
What is this conjecture called, and has it been proved?
$\begingroup$
$\endgroup$
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
2
This is related to Linnik's theorem: http://en.wikipedia.org/wiki/Linnik%27s_theorem . See in particular the conjecture on this wikipedia page:
It is also conjectured that: $p(a,d) < d^2$,
where $p(a,d)$ is the least prime in the arithmetic progression $a + nd$.
Note that the fact that $p$ itself is prime is irrelevant.
answered Oct 9, 2014 at 9:29
-
$\begingroup$ Thank you. This link states that $a\geq1$, whereas in my question, $a=-1$. How do you workaround this "conflict"? $\endgroup$ Commented Oct 9, 2014 at 9:58
-
$\begingroup$ You could just take $a=d-1$. $\endgroup$ Commented Oct 9, 2014 at 10:26