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

chore(i18n,learn): processed translations (#45583)

Browse Source
This commit is contained in:
camperbot
2022-03-31 22:31:59 +05:30
committed by GitHub
parent 01f5769190
commit a3a8b8cb5e
137 changed files with 557 additions and 310 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -10,11 +10,13 @@ dashedName: problem-443-gcd-sequence
Sia $g(n)$ una sequenza definita come segue:
$$\begin{align} & g(4) = 13, \\\\ & g(n) = g(n-1) + gcd(n, g(n - 1)) \text{ for } n > 4. \end{align}$$
$$\begin{align} & g(4) = 13, \\\\
& g(n) = g(n-1) + gcd(n, g(n - 1)) \text{ for } n > 4. \end{align}$$
I primi valori sono:
$$\begin{array}{l} n & 4 & 5 & 6 & 7 & 8 & 9 & 10 & 11 & 12 & 13 & 14 & 15 & 16 & 17 & 18 & 19 & 20 & \ldots \\\\ g(n) & 13 & 14 & 16 & 17 & 18 & 27 & 28 & 29 & 30 & 31 & 32 & 33 & 34 & 51 & 54 & 55 & 60 & \ldots \end{array}$$
$$\begin{array}{l} n & 4 & 5 & 6 & 7 & 8 & 9 & 10 & 11 & 12 & 13 & 14 & 15 & 16 & 17 & 18 & 19 & 20 & \ldots \\\\
g(n) & 13 & 14 & 16 & 17 & 18 & 27 & 28 & 29 & 30 & 31 & 32 & 33 & 34 & 51 & 54 & 55 & 60 & \ldots \end{array}$$
Ti viene dato che $g(1\\,000) = 2\\,524$ and $g(1\\,000\\,000) = 2\\,624\\,152$.