freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-447-retractions-c.spanish.md

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f52c1000cf542c51003e	5	Problem 447: Retractions C		Problema 447: Retracciones C

Description

Para cada entero n> 1, la familia de funciones fn, a, b está definida por fn, a, b (x) ≡ax + b mod n para a, b, x entero y 0

F (N) = ∑R (n) para 2≤n≤N. F (107) ≡638042271 (mod 1 000 000 007).

Encuentre F (1014) (mod 1 000 000 007).

Instructions

Tests

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

Challenge Seed

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

euler447();

Solution

// solution required