1.0 KiB
1.0 KiB
id | challengeType | title | forumTopicId |
---|---|---|---|
5900f5471000cf542c510059 | 5 | Problem 474: Last digits of divisors | 302151 |
Description
We can also verify that F(12!, 12) = 11 and F(50!, 123) = 17888.
Find F(106!, 65432) modulo (1016 + 61).
Instructions
Tests
tests:
- text: <code>euler474()</code> should return 9690646731515010.
testString: assert.strictEqual(euler474(), 9690646731515010);
Challenge Seed
function euler474() {
// Good luck!
return true;
}
euler474();
Solution
// solution required