ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
43 lines
691 B
Markdown
43 lines
691 B
Markdown
---
|
|
id: 5900f47b1000cf542c50ff8d
|
|
title: 'Problem 271: Modular Cubes, part 1'
|
|
challengeType: 5
|
|
forumTopicId: 301921
|
|
dashedName: problem-271-modular-cubes-part-1
|
|
---
|
|
|
|
# --description--
|
|
|
|
For a positive number n, define S(n) as the sum of the integers x, for which 1
|
|
|
|
When n=91, there are 8 possible values for x, namely : 9, 16, 22, 29, 53, 74, 79, 81. Thus, S(91)=9+16+22+29+53+74+79+81=363.
|
|
|
|
Find S(13082761331670030).
|
|
|
|
# --hints--
|
|
|
|
`euler271()` should return 4617456485273130000.
|
|
|
|
```js
|
|
assert.strictEqual(euler271(), 4617456485273130000);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function euler271() {
|
|
|
|
return true;
|
|
}
|
|
|
|
euler271();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|