For all primes p, show that is solvable.

From a theorem, the question is equivalent to showing that

And then I am stuck.(Worried)

Printable View

- November 14th 2009, 11:08 AMcomssaprove that a congruence is solvable
For all primes p, show that is solvable.

From a theorem, the question is equivalent to showing that

And then I am stuck.(Worried) - November 14th 2009, 02:45 PMchiph588@
There are four options for since is the exhaustive list of factors of .

If , it's pretty easy to see .

If .

If .

If .

In this case, and hence is a square modulo , i.e. . Therefore we can choose such that . So .

Therefore is always solvable.