freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-443-gcd-sequence.spanish.md

id	localeTitle	challengeType	title
5	5900f5271000cf542c51003a	5	Problem 443: GCD sequence

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.

Los primeros valores son:

n4567891011121314151617181920 ... g (n) 1314161718272829303132333451545560 ...

Se le da que g (1 000) = 2524 yg (1 000 000) = 2624152.

Buscar 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