freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-432-totient-sum.spanish.md

id	challengeType	title	videoUrl	localeTitle
5900f51e1000cf542c510030	5	Problem 432: Totient sum		Problema 432 a totient

Description

Sea S (n, m) = ∑φ (n × i) para 1 ≤ i ≤ m. (φ es la función total de Euler) Se le da que S (510510,106) = 45480596821125120.

Encontrar S (510510,1011). Da los últimos 9 dígitos de tu respuesta.

Instructions

Tests

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

Challenge Seed

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

euler432();

Solution

// solution required