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

3
curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-426-box-ball-system.md
View File

@ -24,7 +24,8 @@ Può essere mostrato che il sistema dopo un numero sufficiente di turni evolve a
Definiamo la sequenza $\\{t_i\\}$:
$$\begin{align} & s_0 = 290\\,797 \\\\ & s_{k + 1} = {s_k}^2\bmod 50\\,515\\,093 \\\\ & t_k = (s_k\bmod 64) + 1 \end{align}$$
$$\begin{align} & s_0 = 290\\,797 \\\\
& s_{k + 1} = {s_k}^2\bmod 50\\,515\\,093 \\\\ & t_k = (s_k\bmod 64) + 1 \end{align}$$
Iniziando dalla configurazione iniziale $(t_0, t_1, \ldots, t_{10})$, lo stato finale diventa [1, 3, 10, 24, 51, 75].