Skip to main content
OlympiadHQ

Browse · MathNet

Print

Cesko-Slovacko-Poljsko 2013

2013 number theory

Problem

Let , be integers with not a perfect square. Show that can be a perfect square only for finitely many integers .
Solution
Let us examine the diophantine equation with unknown integers and . It can be transformed into the form . Since we assume is not a perfect square, . There are only finitely many ways to write as a product of two integers. Each such factorization gives two linear equations for which have at most one integer solution. Thus there are only finitely many such .

Techniques

Factorization techniquesTechniques: modulo, size analysis, order analysis, inequalitiesQuadratic functions