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) = \sum φ(n × i) for 1 ≤ i ≤ m. (φ is Euler's totient function)

You are given that S(510\\,510, {10}^6) = 45\\,480\\,596\\,821\\,125\\,120.

Find S(510\\,510, {10}^{11}). Give the last 9 digits of your answer.

--hints--

totientSum() should return 754862080.

assert.strictEqual(totientSum(), 754862080);

function totientSum() {

  return true;
}

totientSum();

// solution required