Problem #WSP-000344

Problems Number theory

Problem

Let σ(n) be the sum of the divisors of n. For example, σ(12)=1+2+3+4+6+12=28. We use γ to denote the Euler-Mascheroni constant - one way to define this is as γ:=limn(k=1n1nlogn).

Prove that σ(n)<eγnloglogn for all integers n>5040.