Question 173
We say that a pair of integers $(a, b)$ is Cypriot if $a \geqslant b \geqslant 2$, if $a$ and $b$ are coprime, and if $a+b$ divides $a^{b}+b^{a}$.
Prove that there exist infinitely many distinct Cypriot pairs.
Prove that there exist infinitely many distinct Cypriot pairs.