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

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

Browse Source
This commit is contained in:
camperbot
2022-04-02 14:16:30 +05:30
committed by GitHub
parent f7afac00a6
commit 40a6abe1b0
104 changed files with 4316 additions and 108 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-358-cyclic-numbers.md
View File

@ -14,11 +14,16 @@ $n$ 桁の巡回数は非常に興味深い性質を持っています:
最小の巡回数は、6 桁の数 142857 です。
$$\begin{align} & 142857 × 1 = 142857 \\\\ & 142857 × 2 = 285714 \\\\ & 142857 × 3 = 428571 \\\\ & 142857 × 4 = 571428 \\\\ & 142857 × 5 = 714285 \\\\ & 142857 × 6 = 857142 \end{align}$$
$$\begin{align} & 142857 × 1 = 142857 \\\\
& 142857 × 2 = 285714 \\\\ & 142857 × 3 = 428571 \\\\
& 142857 × 4 = 571428 \\\\ & 142857 × 5 = 714285 \\\\
& 142857 × 6 = 857142 \end{align}$$
次の巡回数は、16 桁の 0588235294117647 です。
$$\begin{align} & 0588235294117647 × 1 = 0588235294117647 \\\\ & 0588235294117647 × 2 = 1176470588235294 \\\\ & 0588235294117647 × 3 = 1764705882352941 \\\\ & \ldots \\\\ & 0588235294117647 × 16 = 9411764705882352 \end{align}$$
$$\begin{align} & 0588235294117647 × 1 = 0588235294117647 \\\\
& 0588235294117647 × 2 = 1176470588235294 \\\\ & 0588235294117647 × 3 = 1764705882352941 \\\\
& \ldots \\\\ & 0588235294117647 × 16 = 9411764705882352 \end{align}$$
なお、巡回数では先行ゼロが重要です。