If p=q, then we have lhs > rhs. Accordingly, it follows that p ≠ q.
If p>3, then p| q^2+3, and hence -3 is a quadratic residue in (mod p) and consequently:
p ≡ 1(mod 3).
Then, looking at modulo 3, we get:
p(p^4+p^2+10q) ≡ q+2(mod 3)
while, q(q^2+3) ≡ q(mod 3)
By Fermat's Little Theorem, or by direct check, this leads to a contradiction.
Checking the values p=2,3, we find that:
the only solution is (p,q) = (2,5).
|