1.1 KiB
1.1 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f4791000cf542c50ff8b | 5 | Problem 268: Counting numbers with at least four distinct prime factors less than 100 | Problema 268: contar números con al menos cuatro factores primos distintos menos de 100 |
Description
Calcule cuántos enteros positivos menores de 1016 son divisibles por al menos cuatro primos distintos menores de 100.
Instructions
Tests
tests:
- text: <code>euler268()</code> debe devolver 785478606870985.
testString: 'assert.strictEqual(euler268(), 785478606870985, "<code>euler268()</code> should return 785478606870985.");'
Challenge Seed
function euler268() {
// Good luck!
return true;
}
euler268();
Solution
// solution required