1.2 KiB
1.2 KiB
id | challengeType | title | forumTopicId |
---|---|---|---|
5900f50e1000cf542c510020 | 5 | Problem 416: A frog's trip | 302085 |
Description
Let F(m, n) be the number of the ways the frog can travel so that at most one square remains unvisited. For example, F(1, 3) = 4, F(1, 4) = 15, F(1, 5) = 46, F(2, 3) = 16 and F(2, 100) mod 109 = 429619151.
Find the last 9 digits of F(10, 1012).
Instructions
Tests
tests:
- text: <code>euler416()</code> should return 898082747.
testString: assert.strictEqual(euler416(), 898082747);
Challenge Seed
function euler416() {
// Good luck!
return true;
}
euler416();
Solution
// solution required