Let , be integers with not a perfect square. Show that can be a perfect square only for finitely many integers .
, 2013
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 .
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.