Find all couples of integers which satisfy
The Idea
We notice that work and we claim that other solutions don’t exist, so we want to get an upper and lower bound for .
Proof
Now let be the greatest exponent of prime in the scomposition of , we notice that and .
Hence,
Now we see that while for the right hand side, we see that all the factors divisible by 3 are the ones which (once all factor 2 are removed) can be written in the form . So (by the Lifting The Exponent Lemma) . Now similarly as before . So , hence or .
In the end, we get or
from which .
Now we just have to try out the cases with to find our two unique solutions.