Number theoryDifficulty 7.2National olympiad, round 2Prove it
Prove that for any pair of positive integers k and n there exist k positive integers m1,m2,…,mk such that 1+n2k−1=(1+m11)(1+m21)⋯(1+mk1). (Japan)
Solution
We proceed by induction on k. For k=1 the statement is trivial. Assuming we have proved it for k=j−1, we now prove it for k=j. Case 1. n=2t−1 for some positive integer t. Observe that 1+2t−12j−1=2t2(t+2j−1−1)⋅2t−12t=(1+t2j−1−1)(1+2t−11). By the induction hypothesis we can find m1,…,mj−1 such that 1+t2j−1−1=(1+m11)(1+m21)⋯(1+mj−11) so setting mj=2t−1 gives the desired expression. Case 2. n=2t for some positive integer t. Now we have 1+2t2j−1=2t+2j−22t+2j−1⋅2t2t+2j−2=(1+2t+2j−21)(1+t2j−1−1) noting that 2t+2j−2>0. Again, we use that 1+t2j−1−1=(1+m11)(1+m21)⋯(1+mj−11). Setting mj=2t+2j−2 then gives the desired expression.
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: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.