1.1 KiB
1.1 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f4ed1000cf542c50ffff | 5 | Problem 383: Divisibility comparison between factorials | Problema 383: comparación de divisibilidad entre factoriales |
Description
Sea T5 (n) el número de enteros i que satisfacen f5 ((2 · i-1)!) <2 · f5 (i!) Y 1 ≤ i ≤ n. Se puede verificar que T5 (103) = 68 y T5 (109) = 2408210.
Encuentra T5 (1018).
Instructions
Tests
tests:
- text: <code>euler383()</code> debe devolver 22173624649806.
testString: 'assert.strictEqual(euler383(), 22173624649806, "<code>euler383()</code> should return 22173624649806.");'
Challenge Seed
function euler383() {
// Good luck!
return true;
}
euler383();
Solution
// solution required