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

fix(curriculum): clean-up Project Euler 101-120 (#42597)

Browse Source 
Co-authored-by: Sem Bauke <46919888+Sembauke@users.noreply.github.com>
This commit is contained in:
gikf
2021-06-30 14:25:46 +02:00
committed by GitHub
parent 25fcf835ed
commit dc168cd96d
19 changed files with 237 additions and 141 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -8,20 +8,20 @@ dashedName: problem-119-digit-power-sum
# --description--
The number 512 is interesting because it is equal to the sum of its digits raised to some power: 5 + 1 + 2 = 8, and 83 = 512. Another example of a number with this property is 614656 = 284.
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 nth term of this sequence and insist that a number must contain at least two digits to have a sum.
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.
You are given that a2 = 512 and a10 = 614656.
You are given that $a_2 = 512$ and $a_{10} = 614656$.
Find a30.
Find $a_{30}$.
# --hints--
`euler119()` should return 248155780267521.
`digitPowerSum()` should return `248155780267521`.
```js
assert.strictEqual(euler119(), 248155780267521);
assert.strictEqual(digitPowerSum(), 248155780267521);
```
# --seed--
@ -29,12 +29,12 @@ assert.strictEqual(euler119(), 248155780267521);
## --seed-contents--
```js
function euler119() {
function digitPowerSum() {
return true;
}
euler119();
digitPowerSum();
```
# --solutions--