This website is a semi-functional mirror of the original Project Euler. More information is available on GitHub.

Maximum number of divisors
Problem 485
Published on 18 October 2014 at 04:00 pm [Server Time]
Let d(n) be the number of divisors of n.
Let M(n,k) be the maximum value of d(j) for n ≤ j ≤ n+k-1.
Let S(u,k) be the sum of M(n,k) for 1 ≤ n ≤ u-k+1.
You are given that S(1000,10)=17176.
Find S(100 000 000,100 000).
Go to back to Problems