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

5-smooth totients

Problem 516

Published on 17 May 2015 at 10:00 am [Server Time]

5-smooth numbers are numbers whose largest prime factor doesn't exceed 5.
5-smooth numbers are also called Hamming numbers.
Let S(L) be the sum of the numbers n not exceeding L such that Euler's totient function φ(n) is a Hamming number.
S(100)=3728.

Find S(1012). Give your answer modulo 232.


Answer not yet available
Go to back to Problems