1.2 KiB
1.2 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f5411000cf542c510054 | 5 | Problem 468: Smooth divisors of binomial coefficients | Problema 468: divisores suaves de coeficientes binomiales |
Description
Sea SB (n) el divisor B-smooth más grande de n. Ejemplos: S1 (10) = 1 S4 (2100) = 12 S17 (2496144) = 5712
Defina F (n) = ∑1≤B≤n ∑0≤r≤n SB (C (n, r)). Aquí, C (n, r) denota el coeficiente binomial. Ejemplos: F (11) = 3132 F (1 111) mod 1 000 000 993 = 706036312 F (111 111) mod 1 000 000 993 = 22156169
Encontrar F (11 111 111) mod 1 000 000 993.
Instructions
Tests
tests:
- text: <code>euler468()</code> debe devolver 852950321.
testString: 'assert.strictEqual(euler468(), 852950321, "<code>euler468()</code> should return 852950321.");'
Challenge Seed
function euler468() {
// Good luck!
return true;
}
euler468();
Solution
// solution required