Let $n>1$ be an non square positive integer (you can have it prime, if you wish), does there exist a prime $p>2$ such that $n$ generates the multiplicative group of $\mathbb F_p$? It sounds true, but I could not find an immediate proof for that... maybe using some reciprocity law? Not sure.

  • $\begingroup$ Have you tried a few examples? Does it work when p=3? $\endgroup$ – User0112358 Dec 15 '15 at 21:58
  • $\begingroup$ If n is odd let p=2. Not sure about even n. $\endgroup$ – DanielWainfleet Dec 15 '15 at 21:59
  • $\begingroup$ p=3, n=7 fails since 7 is congruent to 1 modulo 3 so it does not generate. But anyway the question is the other way round: you should fix n and find p $\endgroup$ – Reyx_0 Dec 15 '15 at 22:03
  • $\begingroup$ edited with p>2, sorry. $\endgroup$ – Reyx_0 Dec 15 '15 at 22:04
  • 1
    $\begingroup$ You may find this useful as a start. Every prime $\gt 2$ does have a prime primitive root. There is a lot more known, including size estimates. $\endgroup$ – André Nicolas Dec 15 '15 at 22:23

The general question in a strong form is the contents of Artin's Conjecture:

Every integer which is neither a perfect square nor equal to $−1$ is a primitive root modulo infinitely many primes.

This remains unproved.

| cite | improve this answer | |

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.