For all primes p, show that is solvable.
From a theorem, the question is equivalent to showing that
And then I am stuck.
Follow Math Help Forum on Facebook and Google+
There are four options for since is the exhaustive list of factors of .
If , it's pretty easy to see .
In this case, and hence is a square modulo , i.e. . Therefore we can choose such that . So .
Therefore is always solvable.
View Tag Cloud