freeCodeCamp/problem-432-totient-sum.english.md at ef79ddd0de35a4e10b8b4588e67938f86d2bae10

Files

mrugesh 22afc2a0ca feat(learn): python certification projects (#38216 )

Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com>
Co-authored-by: Beau Carnes <beaucarnes@gmail.com>

2020-05-27 13:19:08 +05:30

862 B

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f51e1000cf542c510030	5	false	Problem 432: Totient sum	302103

Description

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.

Instructions

Tests

tests:
  - text: <code>euler432()</code> should return 754862080.
    testString: assert.strictEqual(euler432(), 754862080);

Challenge Seed

function euler432() {
  // Good luck!
  return true;
}

euler432();

Solution

// solution required

862 B Raw Blame History Unescape Escape