1.0 KiB
1.0 KiB
id | localeTitle | challengeType | title |
---|---|---|---|
5 | 5900f3ba1000cf542c50fecd | 5 | Problem 78: Coin partitions |
Description
OOOOO OOOO O OOO OO OOO O O OO OO O OO O O O O O O O O
Encontrar el menor valor de n para el que p (n) es divisible por un millón.
Instructions
Tests
tests:
- text: <code>euler78()</code> debe devolver 55374.
testString: 'assert.strictEqual(euler78(), 55374, "<code>euler78()</code> should return 55374.");'
Challenge Seed
function euler78() {
// Good luck!
return true;
}
euler78();
Solution
// solution required