Fermat's/Euler Problem: Proving Equivalence Modulo pq and ab

  • Thread starter Thread starter pacdude9
  • Start date Start date
pacdude9
Messages
4
Reaction score
0
I've got a pair of (related) problems that are keeping me stumped. The two problems they are asking me to prove are:

p^{(q-1)} + q^{(p - 1)} \equiv 1 \; (\!\!\!\!\!\! \mod \, pq)

a^{\phi(b)} + b^{\phi(a)} \equiv 1<br /> \; (\!\!\!\!\!\! \mod \, ab)

Where \phi(n) is Euler's Totient Function.

I know that these are similar, as the second problem is using Euler's Theorem, a generalization of Fermat's Little Theorem, I just can't seem to figure them out.
 
Physics news on Phys.org
for the first one, see if this helps...

By Fermat's Theorem (assuming that p and p are relatively prime...) we have
q^p=qmod p. We can cancel q from both sides since gcd(q,p) = 1, so q^{(p-1)} = 1 (mod p). Also p^{(q-1)} = 0 (mod p) we get

p^{(q-1)} + q^{(p-1)} = 1 (mod p)

can you go from there?
 
Last edited:
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top