Maths Olympiad Prep

Library / /174 of 348

Algebra Difficulty 4.9 AIME Find the answer

For the specific example M=5M=5, find a value of kk, not necessarily the smallest, such that n=1k1n>M\sum_{n=1}^{k} \frac{1}{n}>M. Justify your answer.

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

Note that 1n+1+1n+2++12n>12n++12n=12\frac{1}{n+1}+\frac{1}{n+2}+\ldots+\frac{1}{2n}>\frac{1}{2n}+\ldots+\frac{1}{2n}=\frac{1}{2}. Therefore, if we apply this to n=1,2,4,8,16,32,64,128n=1,2,4,8,16,32,64,128, we get (12)+(13+14)+(15+16+17+18)++(1129++1256)>12++12=4\left(\frac{1}{2}\right)+\left(\frac{1}{3}+\frac{1}{4}\right)+\left(\frac{1}{5}+\frac{1}{6}+\frac{1}{7}+\frac{1}{8}\right)+\ldots+\left(\frac{1}{129}+\ldots+\frac{1}{256}\right)>\frac{1}{2}+\ldots+\frac{1}{2}=4 so, adding in 11\frac{1}{1}, we get n=12561n>5\sum_{n=1}^{256} \frac{1}{n}>5 so k=256k=256 will suffice.

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: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.