id	title	challengeType	forumTopicId	dashedName
5900f51e1000cf542c510030	Problem 432: Totient sum	5	302103	problem-432-totient-sum

--description--

mirror of https://github.com/freeCodeCamp/freeCodeCamp.git

Let S(n,m) = ∑φ(n × i) for 1 ≤ i ≤ m. (φ is Euler's totient function)

You are given that S(510510,106 )= 45480596821125120.

Find S(510510,1011). Give the last 9 digits of your answer.

--hints--

euler432() should return 754862080.

assert.strictEqual(euler432(), 754862080);

function euler432() {

  return true;
}

euler432();

// solution required