Maths Olympiad Prep

Library / /2 of 16

, 2013

Number theory Difficulty 4.6 AIME Prove it Czech-Polish-Slovak Mathematical Match

Let aa, bb be integers with bb not a perfect square. Show that x2+ax+bx^2 + a x + b can be a perfect square only for finitely many integers xx.

Solution

Let us examine the diophantine equation x2+ax+b=y2x^2 + a x + b = y^2 with unknown integers xx and yy. It can be transformed into the form (2x+2y+a)(2x2y+a)=a24b(2x + 2y + a)(2x - 2y + a) = a^2 - 4b. Since we assume bb is not a perfect square, a24b0a^2 - 4b \neq 0. There are only finitely many ways to write a24ba^2 - 4b as a product of two integers. Each such factorization gives two linear equations for x,yx, y which have at most one integer solution. Thus there are only finitely many such xx.

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.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.