1.2 KiB
1.2 KiB
id | challengeType | title |
---|---|---|
5900f4a51000cf542c50ffb7 | 5 | Problem 312: Cyclic paths on Sierpiński graphs |
Description
Let C(n) be the number of cycles that pass exactly once through all the vertices of Sn. For example, C(3) = 8 because eight such cycles can be drawn on S3, as shown below:
It can also be verified that : C(1) = C(2) = 1 C(5) = 71328803586048 C(10 000) mod 108 = 37652224 C(10 000) mod 138 = 617720485
Find C(C(C(10 000))) mod 138.
Instructions
Tests
tests:
- text: <code>euler312()</code> should return 324681947.
testString: assert.strictEqual(euler312(), 324681947, '<code>euler312()</code> should return 324681947.');
Challenge Seed
function euler312() {
// Good luck!
return true;
}
euler312();
Solution
// solution required