It is easy to see that n = 2 satifies the given congruence. If n is odd, every prime p dividing n should satisfy .
The answer given in the book is: where = 0 or 1, the primes p in the product are all , and .
How do they get the in the product?
It is easy to see that n = 2 satifies the given congruence. If n is odd, every prime p dividing n should satisfy .
The answer given in the book is: where = 0 or 1, the primes p in the product are all , and .
How do they get the in the product?