MathDB
A very good estimate in the sum of (number of divisors of n)

Source: Problem 5, Brazil MO 1992

March 18, 2006
number theory proposednumber theory

Problem Statement

Let d(n)=0<dn1d(n)=\sum_{0<d|n}{1}. Show that, for any natural n>1n>1, 2in1id(i)n1in1i \sum_{2 \leq i \leq n}{\frac{1}{i}} \leq \sum{\frac{d(i)}{n}} \leq \sum_{1 \leq i \leq n}{\frac{1}{i}}