1.0 KiB
1.0 KiB
id | challengeType | title |
---|---|---|
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
Find the least value of n for which p(n) is divisible by one million.
Instructions
Tests
tests:
- text: <code>euler78()</code> should return 55374.
testString: assert.strictEqual(euler78(), 55374, '<code>euler78()</code> should return 55374.');
Challenge Seed
function euler78() {
// Good luck!
return true;
}
euler78();
Solution
// solution required