I was going to break up $p$ into $8k+1$ and $8k+7$. Using this, I can plug that in for p and then solve using this.
Asked
Active
Viewed 1,452 times
4
-
Hint: You can use Euler's criterion. Page 18 of: http://www.math.brown.edu/~jhs/MA0042/FRINTNewCh2324.pdf provides more details. I've got to go to class. – Rustyn Oct 16 '13 at 14:45
-
This thread on MO might help: http://mathoverflow.net/questions/83060/prime-factors-of-x2-2. – Kieren MacMillan Oct 16 '13 at 14:49
1 Answers
2
Here is a proof that $\left( \frac{2}{p} \right) = (-1)^{(p^2-1)/8}$, which is basically what you are looking for:
Legendre symbol, second supplementary law
This says that $2$ is a quadratic residue $\bmod{p}$ if and only if $(p^2-1)/8$ is even. (Saying that $2$ is a quadratic residue is the same as saying that there is a solution to $x^2 \equiv 2 \pmod{p}$.) It is not difficult to check that: $(p^2-1)/8 = (p-1)(p+1)/8$ is even iff one of the factors $p-1,p+1$ is divisible by $8$.
Jakub Konieczny
- 12,824