Number theoryDifficulty 5.4AIME, harderProve itThailand
Prove that there are no integer pairs (x,y) satisfying 2560x2+5x+6=y5.
Solution
Suppose for the sake of contradiction that an integer pair (x,y) satisfies 2560x2+5x+6=y5. Thus, 6≡y5≡y(mod5), and so y≡1(mod5). Let k be an integer such that y=5k+1. We now have 2560x2+5x+6=(5k+1)5=1+j=1∑5(j5)(5k)j. Dividing the above equation by 5 yields 512x2+x+1=54k5+54k4+10⋅52k3+10⋅5k2+5k. Taking the above equation modulo 5, we obtain 2x2+x+1≡0(mod5). This makes 1≡2x2−4x+2≡2(x−1)2(mod5), and so 3≡(x−1)2(mod5). This is a contradiction since 3 is not a square modulo 5.
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.