Two players play a game as follows. The first player chooses two non-zero integers and . The second player forms a quadratic with , and as coefficients (in any order). The first player wins iff the equation has two distinct rational roots. Show that the first player can always win.
Solution
Choose and such that . Then is a root of the quadratic equation no matter how the second player arranges the coefficients.
The other root is also rational, because the product of the roots, the quotient of two of the rational coefficients , , , is rational.
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.