If , prove is congruent to -1 (mod .
I think I should use Euler's Theorem for this but I'm not sure. Thanks for any help!
If , prove is congruent to -1 (mod .
I think I should use Euler's Theorem for this but I'm not sure. Thanks for any help!
This implication isn't correct. It's true that if a prime divides a product of two numbers, then it must divide at least one of them. The same isn't true, however, for prime powers. For example, , but 9 doesn't divide either factor.which implies that either or .
This point is the crux of the problem. Please think about it. Write out some examples for small values of x. Try to figure out, using the hints already given, why must divide .