1.2 KiB
1.2 KiB
id | challengeType | title | forumTopicId |
---|---|---|---|
5900f4d91000cf542c50ffea | 5 | Problem 364: Comfortable distance | 302025 |
Description
Let T(N) be the number of possibilities that N seats are occupied by N people with the given rules. The following figure shows T(4)=8.
We can verify that T(10) = 61632 and T(1 000) mod 100 000 007 = 47255094. Find T(1 000 000) mod 100 000 007.
Instructions
Tests
tests:
- text: <code>euler364()</code> should return 44855254.
testString: assert.strictEqual(euler364(), 44855254);
Challenge Seed
function euler364() {
// Good luck!
return true;
}
euler364();
Solution
// solution required