Skip to main content
MathOverflow

Return to Answer

deleted 104 characters in body
Source Link
GH from MO
GH from MO
  • 105.2k
  • 8
  • 292
  • 398

I think the best approximation is due to Heath-Brown (Quart. J. Math. Oxford Ser. 37, 27-38.)Heath-Brown: for infinitely many primes p$p$, one of 2$2$,3 $3$,5 $5$ is a primitive root mod p$p$.

  Actually Heath-Brown's theorem, this result works forwith any three primes in place of 2,3$2$,5. You can find his paper online here$3$, (praise Google)$5$.

I think the best approximation is due to Heath-Brown (Quart. J. Math. Oxford Ser. 37, 27-38.): for infinitely many primes p, one of 2,3,5 is a primitive root mod p.

  Actually Heath-Brown's theorem works for any three primes in place of 2,3,5. You can find his paper online here (praise Google).

I think the best approximation is due to Heath-Brown: for infinitely many primes $p$, one of $2$, $3$, $5$ is a primitive root mod $p$. Actually, this result works with any three primes in place of $2$, $3$, $5$.

added 4 characters in body
Source Link
GH from MO
GH from MO
  • 105.2k
  • 8
  • 292
  • 398

I think the best approximation is due to Heath-Brown (Quart. J. Math. Oxford Ser. 37, 27-38.): for infinitely many primes p, one of 32,53,75 is a primitive root mod p.

Actually Heath-Brown's theorem works for any 3three primes in place of 32,53,75. You can find his paper online here (praise Google).

I think the best approximation is due to Heath-Brown (Quart. J. Math. Oxford Ser. 37, 27-38.): for infinitely many primes p, one of 3,5,7 is a primitive root mod p.

Actually Heath-Brown's theorem works for any 3 primes in place of 3,5,7. You can find his paper online here (praise Google).

I think the best approximation is due to Heath-Brown (Quart. J. Math. Oxford Ser. 37, 27-38.): for infinitely many primes p, one of 2,3,5 is a primitive root mod p.

Actually Heath-Brown's theorem works for any three primes in place of 2,3,5. You can find his paper online here (praise Google).

Source Link
GH from MO
GH from MO
  • 105.2k
  • 8
  • 292
  • 398

I think the best approximation is due to Heath-Brown (Quart. J. Math. Oxford Ser. 37, 27-38.): for infinitely many primes p, one of 3,5,7 is a primitive root mod p.

Actually Heath-Brown's theorem works for any 3 primes in place of 3,5,7. You can find his paper online here (praise Google).