1.2 KiB
1.2 KiB
id | challengeType | title |
---|---|---|
5900f5481000cf542c51005a | 5 | Problem 475: Music festival |
Description
Let f(12n) be the number of ways to organize the trios amongst the 12n musicians. You are given f(12) = 576 and f(24) mod 1 000 000 007 = 509089824.
Find f(600) mod 1 000 000 007.
Instructions
Tests
tests:
- text: <code>euler475()</code> should return 75780067.
testString: assert.strictEqual(euler475(), 75780067, '<code>euler475()</code> should return 75780067.');
Challenge Seed
function euler475() {
// Good luck!
return true;
}
euler475();
Solution
// solution required