1.2 KiB
1.2 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f5471000cf542c510059 | 5 | Problem 474: Last digits of divisors | Problema 474: Últimos Dígitos dos Divisores |
Description
Podemos também verificar que F (12 !, 12) = 11 e F (50 !, 123) = 17888.
Encontre o módulo F (106 !, 65432) (1016 + 61).
Instructions
Tests
tests:
- text: <code>euler474()</code> deve retornar 9690646731515010.
testString: 'assert.strictEqual(euler474(), 9690646731515010, "<code>euler474()</code> should return 9690646731515010.");'
Challenge Seed
function euler474() {
// Good luck!
return true;
}
euler474();
Solution
// solution required