gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

chore(i8n,learn): processed translations

Browse Source
This commit is contained in:
Crowdin Bot
2021-02-06 04:42:36 +00:00
committed by Mrugesh Mohapatra
parent 15047f2d90
commit e5c44a3ae5
3274 changed files with 172122 additions and 14164 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md
View File

@ -1,28 +1,28 @@
---
id: 5900f5271000cf542c51003a
title: 问题443：GCD序列
title: 'Problem 443: GCD sequence'
challengeType: 5
videoUrl: ''
forumTopicId: 302115
dashedName: problem-443-gcd-sequence
---
# --description--
设g（n）为如下定义的序列：g（4）= 13，g（n）= g（n-1）+ gcd（n，g（n-1）），n> 4。
Let g(n) be a sequence defined as follows: g(4) = 13, g(n) = g(n-1) + gcd(n, g(n-1)) for n > 4.
前几个值是：
The first few values are:
```
n4567891011121314151617181920... g(n)1314161718272829303132333451545560...
```
n 4567891011121314151617181920... g(n) 1314161718272829303132333451545560...
给出g（1 000）= 2524和g（1 000 000）= 2624152。
<!-- TODO Use MathJax -->
找到g（1015）。
You are given that g(1 000) = 2524 and g(1 000 000) = 2624152.
Find g(1015).
# --hints--
`euler443()`应该返回2744233049300770。
`euler443()` should return 2744233049300770.
```js
assert.strictEqual(euler443(), 2744233049300770);