1.1 KiB
1.1 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f5271000cf542c51003a | 5 | Problem 443: GCD sequence | Problema 443: secuencia GCD |
Description
Los primeros valores son:
n4567891011121314151617181920... g(n)1314161718272829303132333451545560...
Se le da que g (1 000) = 2524 y g (1 000 000) = 2624152.
Encontrar g (1015).
Instructions
Tests
tests:
- text: <code>euler443()</code> debe devolver 2744233049300770.
testString: 'assert.strictEqual(euler443(), 2744233049300770, "<code>euler443()</code> should return 2744233049300770.");'
Challenge Seed
function euler443() {
// Good luck!
return true;
}
euler443();
Solution
// solution required