Skip to main content
OlympiadHQ

Browse · MathNet

Print

The 14th Thailand Mathematical Olympiad

Thailand number theory

Problem

Prove that there are no integer pairs satisfying
Solution
Suppose for the sake of contradiction that an integer pair satisfies . Thus, , and so . Let be an integer such that . We now have Dividing the above equation by yields Taking the above equation modulo , we obtain . This makes , and so . This is a contradiction since is not a square modulo .

Techniques

Techniques: modulo, size analysis, order analysis, inequalitiesFermat / Euler / Wilson theorems