1.4 KiB
1.4 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f45f1000cf542c50ff71 | 5 | Problem 242: Odd Triplets | Problema 242: trillizos impares |
Description
Cuando los tres valores n, k y f (n, k) son impares, decimos que hacen un triplete impar [n, k, f (n, k)].
Hay exactamente cinco tripletes impares con n ≤ 10, a saber: [1,1, f (1,1) = 1], [5,1, f (5,1) = 3], [5,5, f (5,5) = 1], [9,1, f (9,1) = 5] y [9,9, f (9,9) = 1].
¿Cuántos tripletes impares hay con n ≤ 1012?
Instructions
Tests
tests:
- text: <code>euler242()</code> debe devolver 997104142249036700.
testString: 'assert.strictEqual(euler242(), 997104142249036700, "<code>euler242()</code> should return 997104142249036700.");'
Challenge Seed
function euler242() {
// Good luck!
return true;
}
euler242();
Solution
// solution required