1.0 KiB
1.0 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f4da1000cf542c50ffec | 5 | Problem 365: A huge binomial coefficient | Problema 365: Um enorme coeficiente binomial |
Description
Seja M (n, k, m) o coeficiente binomial C (n, k) módulo m.
Calcule ∑M (1018,109, p q r) para 1000 <p <q <r <5000 e p, q, r primo.
Instructions
Tests
tests:
- text: <code>euler365()</code> deve retornar 162619462356610300.
testString: 'assert.strictEqual(euler365(), 162619462356610300, "<code>euler365()</code> should return 162619462356610300.");'
Challenge Seed
function euler365() {
// Good luck!
return true;
}
euler365();
Solution
// solution required