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

fix(curriculum): Fix a typo (#43554)

Browse Source
This commit is contained in:
Alan Luo
2021-09-23 23:48:31 -07:00
committed by GitHub
parent 8fac91292d
commit 42e88ac281
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md
View File

@ -10,7 +10,7 @@ dashedName: problem-119-digit-power-sum
The number 512 is interesting because it is equal to the sum of its digits raised to some power: $5 + 1 + 2 = 8$, and $8^3 = 512$. Another example of a number with this property is $614656 = 28^4$.
We shall define an to be the $n-th$ term of this sequence and insist that a number must contain at least two digits to have a sum.
We shall define $a_n$ to be the $n-th$ term of this sequence and insist that a number must contain at least two digits to have a sum.
You are given that $a_2 = 512$ and $a_{10} = 614656$.