freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.spanish.md

id	challengeType	title	videoUrl	localeTitle
5900f4ae1000cf542c50ffbf	5	Problem 320: Factorials divisible by a huge integer		Problema 320: Factoriales divisibles por un entero enorme

Description

Sea N (i) el entero más pequeño n tal que n! es divisible por (i!) 1234567890

Sea S (u) = ∑N (i) para 10 ≤ i ≤ u.

S (1000) = 614538266565663.

Encontrar S (1 000 000) mod 1018.

Instructions

Tests

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

Challenge Seed

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

euler320();

Solution

// solution required