56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
---
|
|
id: 5900f5271000cf542c51003a
|
|
challengeType: 5
|
|
title: 'Problem 443: GCD sequence'
|
|
videoUrl: ''
|
|
localeTitle: 'Problema 443: secuencia GCD'
|
|
---
|
|
|
|
## Description
|
|
<section id="description"> Sea g (n) una secuencia definida de la siguiente manera: g (4) = 13, g (n) = g (n-1) + gcd (n, g (n-1)) para n> 4. <p> Los primeros valores son: </p><pre> <code>n4567891011121314151617181920... g(n)1314161718272829303132333451545560...</code> </pre><p> Se le da que g (1 000) = 2524 y g (1 000 000) = 2624152. </p><p> Encontrar g (1015). </p></section>
|
|
|
|
## Instructions
|
|
<section id="instructions">
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler443()</code> debe devolver 2744233049300770.
|
|
testString: 'assert.strictEqual(euler443(), 2744233049300770, "<code>euler443()</code> should return 2744233049300770.");'
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler443() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
euler443();
|
|
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
</section>
|