Question 3
Let $m>3$ be an integer, and let $p_1,\ldots,p_k$ be all primes not exceeding $m$. Prove that
$$\sum_{i=1}^k\left(\frac1{p_i}+\frac1{p_i^2}\right)>\ln(\ln m).$$
The supplied source has no question point values. Each problem uses 1 editorial point for import compatibility; this is not an official scoring scale.
$$\sum_{i=1}^k\left(\frac1{p_i}+\frac1{p_i^2}\right)>\ln(\ln m).$$
The supplied source has no question point values. Each problem uses 1 editorial point for import compatibility; this is not an official scoring scale.