1.1 KiB
1.1 KiB
id | challengeType | title |
---|---|---|
5900f5021000cf542c510014 | 5 | Problem 405: A rectangular tiling |
Description
The following animation demonstrates the tilings T(n) for n from 0 to 5:
Let f(n) be the number of points where four tiles meet in T(n). For example, f(1) = 0, f(4) = 82 and f(109) mod 177 = 126897180.
Find f(10k) for k = 1018, give your answer modulo 177.
Instructions
Tests
tests:
- text: <code>euler405()</code> should return 237696125.
testString: assert.strictEqual(euler405(), 237696125, '<code>euler405()</code> should return 237696125.');
Challenge Seed
function euler405() {
// Good luck!
return true;
}
euler405();
Solution
// solution required