Problem:
Let be a prime number. Show that there exists a prime number and a positive integer such that divides .
Problem:
Let be a prime number. Show that there exists a prime number and a positive integer such that divides .
Solution:
Note that the condition just means that is a quadratic residue modulo , or that the Legendre symbol is . We use these standard facts about the Legendre symbol:
- If , then .
- For an odd prime ,
- Quadratic reciprocity: for distinct odd primes and ,
If is a Fermat prime or Mersenne prime, then is congruent to or modulo respectively, since . In that case works. Otherwise assume is not a Fermat prime or Mersenne prime, so that and are not powers of .
If , then let be an odd prime divisor of , so that . Then by quadratic reciprocity .
If , then let be an odd prime divisor of , so that . Either so that or so that .
Solution:
(Ankan Bhattacharya) We assume the same standard facts about quadratic residues as the previous solution.
If , then since , there exists an odd prime divisor of , which gives
If , then we can take .
If , then by Legendre's three square theorem there exist odd satisfying . Since , these are not all equal and we may assume without loss of generality that . Then has a prime divisor , which gives