Let us denote by s(n)=∑d∣nd the sum of divisors of a positive integer n (1 and n included). If n has at most 5 distinct prime divisors, prove that s(n)<1677n. Also prove that there exists a natural number n for which s(n)<1676n holds. inequalitiesrationumber theory proposednumber theory