Problem

Source: 2006 MOP Homework Blue NT 3

Tags: inequalities, number theory, odd, divisor, greatest



For positive integer $k$, let $p(k)$ denote the greatest odd divisor of $k$. Prove that for every positive integer $n$, $$\frac{2n}{3} < \frac{p(1)}{1}+ \frac{p(2)}{2}+... +\frac{ p(n)}{n}<\frac{2(n + 1)}{3}$$