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

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

Browse Source
This commit is contained in:
camperbot
2022-04-05 23:36:59 +05:30
committed by GitHub
parent 3a01deef48
commit d886ea11ef
80 changed files with 325 additions and 101 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-318-2011-nines.md
View File

@ -12,7 +12,11 @@ Considere o número real $\sqrt{2} + \sqrt{3}$.
Quando calculamos as potências pares de $\sqrt{2} + \sqrt{3}$ obtemos:
$$\begin{align} & {(\sqrt{2} + \sqrt{3})}^2 = 9.898979485566356\ldots \\\\ & {(\sqrt{2} + \sqrt{3})}^4 = 97.98979485566356\ldots \\\\ & {(\sqrt{2} + \sqrt{3})}^6 = 969.998969071069263\ldots \\\\ & {(\sqrt{2} + \sqrt{3})}^8 = 9601.99989585502907\ldots \\\\ & {(\sqrt{2} + \sqrt{3})}^{10} = 95049.999989479221\ldots \\\\ & {(\sqrt{2} + \sqrt{3})}^{12} = 940897.9999989371855\ldots \\\\ & {(\sqrt{2} + \sqrt{3})}^{14} = 9313929.99999989263\ldots \\\\ & {(\sqrt{2} + \sqrt{3})}^{16} = 92198401.99999998915\ldots \\\\ \end{align}$$
$$\begin{align} & {(\sqrt{2} + \sqrt{3})}^2 = 9.898979485566356\ldots \\\\
& {(\sqrt{2} + \sqrt{3})}^4 = 97.98979485566356\ldots \\\\ & {(\sqrt{2} + \sqrt{3})}^6 = 969.998969071069263\ldots \\\\
& {(\sqrt{2} + \sqrt{3})}^8 = 9601.99989585502907\ldots \\\\ & {(\sqrt{2} + \sqrt{3})}^{10} = 95049.999989479221\ldots \\\\
& {(\sqrt{2} + \sqrt{3})}^{12} = 940897.9999989371855\ldots \\\\ & {(\sqrt{2} + \sqrt{3})}^{14} = 9313929.99999989263\ldots \\\\
& {(\sqrt{2} + \sqrt{3})}^{16} = 92198401.99999998915\ldots \\\\ \end{align}$$
Parece que o número de noves consecutivos no início da parte fracionária dessas potências não diminui. Na verdade, pode ser provado que a parte fracionária de ${(\sqrt{2} + \sqrt{3})}^{2n}$ aproxima-se de 1 para $n$ grandes.