how to prove $m^{\phi(n)}+n^{\phi(m)}\equiv 1 \pmod{mn}$ where m and n are relatively prime?

7.3k Views Asked by At

I do not know how to prove this question: $m^{\phi(n)}+n^{\phi(m)}\equiv 1 \pmod {mn}$ where $m$ and $n$ are relatively prime.

Can anyone help?

3

There are 3 best solutions below

1
On BEST ANSWER

Hint: Can you prove:

$$m^{\phi(n)}+n^{\phi(m)}\equiv 1 \pmod {m}$$ and $$m^{\phi(n)}+n^{\phi(m)}\equiv 1 \pmod {n}?$$

2
On

By the Chinese Remainder Theorem, it suffices to prove that $$ m^{\phi(n)}+n^{\phi(m)}\equiv 1\mod{m},\qquad m^{\phi(n)}+n^{\phi(m)}\equiv 1\mod{n}. $$ But now this follows trivially, since $m^{\phi(n)}\equiv 1\mod{n}$ by Euler's Theorem (and likewise for $n$).

1
On

Hint $\ $ It is simply $\,\overbrace{(0,1)}^{\large m^{\large \phi(n)}}+ \overbrace{(1,0)}^{\large n^{\large \phi(m)}}\, =\, \overbrace{(1,1)}^{\large1}\ $ in $\ \Bbb Z/m \times \Bbb Z/n\overset{\rm CRT}\cong \Bbb Z/mn\ $ using Euler's Theorem.