Let s(n) be the sum of the positive divisors of n. For example, s(6) = 1 + 2 + 3 + 6 = 12. Show that there are infinitely many n such that s(n)/n > s(m)/m for all m < n.
Solution
Solution by Demetres Christofides
The sequence s(n)/n is unbounded. For example take n = product of first m primes p1p2 ... pm. Then s(n)/n = (1 + 1/p1) ... (1 + 1/pm) > 1 + 1/p1 + ... + 1/pm, which diverges. So take the sequence n1, n2, ... where n1 = 1 and ni is the first i such that s(ni)/ni exceeds s(ni-1)/ni-1. Then each ni has the desired property.
© John Scholes
jscholes@kalva.demon.co.uk
11 Sep 2002