Written on a blackboard is the polynomial x2+x+2014. Calvin and Hobbes take turns alternatively (starting with Calvin) in the following game. During his turn, Calvin should either increase or decrease the coefficient of x by 1. And during his turn, Hobbes should either increase or decrease the constant coefficient by 1. Calvin wins if at any point of time the polynomial on the blackboard at that instant has integer roots. Prove that Calvin has a winning strategy.
Solution
Solution:
For i≥0, let fi(x) denote the polynomial on the blackboard after Hobbes' i-th turn. We let Calvin decrease the coefficient of x by 1. Therefore fi+1(2)=fi(2)−1 or fi+1(2)=fi(2)−3 (depending on whether Hobbes increases or decreases the constant term). So for some i, we have 0≤fi(2)≤2. If fi(2)=0 then Calvin has won the game. If fi(2)=2 then Calvin wins the game by reducing the coefficient of x by 1. If fi(2)=1 then fi+1(2)=0 or fi+1(2)=−2. In the former case, Calvin has won the game and in the latter case Calvin wins the game by increasing the coefficient of x by 1.
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 reproduced verbatim; metadata (topic, difficulty) added by this project.