Maths Olympiad Prep

Library / /451 of 520

Number theory Difficulty 7.2 National olympiad, round 2 Prove it

Prove that for any pair of positive integers kk and nn there exist kk positive integers m1,m2,,mkm_{1}, m_{2}, \ldots, m_{k} such that
1+2k1n=(1+1m1)(1+1m2)(1+1mk). 1+\frac{2^{k}-1}{n}=\left(1+\frac{1}{m_{1}}\right)\left(1+\frac{1}{m_{2}}\right) \cdots\left(1+\frac{1}{m_{k}}\right) .
(Japan)

Solution

We proceed by induction on kk. For k=1k=1 the statement is trivial. Assuming we have proved it for k=j1k=j-1, we now prove it for k=jk=j. Case 1. n=2t1n=2 t-1 for some positive integer tt. Observe that 1+2j12t1=2(t+2j11)2t2t2t1=(1+2j11t)(1+12t1). 1+\frac{2^{j}-1}{2 t-1}=\frac{2\left(t+2^{j-1}-1\right)}{2 t} \cdot \frac{2 t}{2 t-1}=\left(1+\frac{2^{j-1}-1}{t}\right)\left(1+\frac{1}{2 t-1}\right) . By the induction hypothesis we can find m1,,mj1m_{1}, \ldots, m_{j-1} such that 1+2j11t=(1+1m1)(1+1m2)(1+1mj1) 1+\frac{2^{j-1}-1}{t}=\left(1+\frac{1}{m_{1}}\right)\left(1+\frac{1}{m_{2}}\right) \cdots\left(1+\frac{1}{m_{j-1}}\right) so setting mj=2t1m_{j}=2 t-1 gives the desired expression. Case 2. n=2tn=2 t for some positive integer tt. Now we have 1+2j12t=2t+2j12t+2j22t+2j22t=(1+12t+2j2)(1+2j11t) 1+\frac{2^{j}-1}{2 t}=\frac{2 t+2^{j}-1}{2 t+2^{j}-2} \cdot \frac{2 t+2^{j}-2}{2 t}=\left(1+\frac{1}{2 t+2^{j}-2}\right)\left(1+\frac{2^{j-1}-1}{t}\right) noting that 2t+2j2>02 t+2^{j}-2>0. Again, we use that 1+2j11t=(1+1m1)(1+1m2)(1+1mj1). 1+\frac{2^{j-1}-1}{t}=\left(1+\frac{1}{m_{1}}\right)\left(1+\frac{1}{m_{2}}\right) \cdots\left(1+\frac{1}{m_{j-1}}\right) . Setting mj=2t+2j2m_{j}=2 t+2^{j}-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.