I can prove $p^{q-1}+q^{p-1}$ is congruent to 1 mod $pq$ very easily, but with the $p+q$ it doesn't fit a theorem I can find. The only ones I find say if they are congruent to $b$. I get one is congruent to $p$ and the other is $q$, these are obviously different numbers.
Asked
Active
Viewed 1,701 times
2
-
@anon Ah, that changes it quite a bit. Didn't think of the validity about it, just put the dollar signs. – Hayden Apr 09 '14 at 00:57
5 Answers
3
If you want to use your theorem, note that
$$p+q\equiv(p+q)(p^{q-1}+q^{p-1})=p^q+q^p+pq^{p-1}+qp^{q-1}\equiv p^q+q^p\ \ (\text{mod pq)}$$
user2345215
- 16,803
2
Take $\pmod p$. Then (by F(little)T), $p^q+q^p \equiv q \pmod p$. Similarly, $p^q+q^p \equiv p \pmod q$. Now let $n$ be the expression. Then $n = pr_1+q = qr_2+p$. Take this equation $\pmod p$ to arrive at $q \equiv qr_2 \pmod p \implies r_2 \equiv 1 \pmod p$. Therefore, $r_2 = r_3p+1$.
Then $n = qr_2+p = q(r_3q+1)+p = pqr_3+p+q$ as desired.
Sandeep Silwal
- 8,363
1
Hint $\ ap\mid a^p-a\ $ if prime $\,p\nmid a.\,$ Let $\,a=q\,$ prime, and symmetrize.
Bill Dubuque
- 282,220
-
Or as here, use $,{p^q,q^p} \equiv {p,q}, \pmod {p\ &\ q},$ by little Fermat. Generalizations are there. $\ \ $ – Bill Dubuque Sep 22 '24 at 15:32
0
I think you need to assume that $p$ and $q$ are different primes.
Hint: modulo $q$, $$p^q\equiv p^{q-1}p\equiv p\quad\hbox{and}\quad q^p\equiv0^p\equiv0\equiv q\ .$$
David
- 84,708
- 9
- 96
- 166