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>
45 lines
637 B
Markdown
45 lines
637 B
Markdown
---
|
|
id: 5900f4d01000cf542c50ffe3
|
|
title: 'Problem 356: Largest roots of cubic polynomials'
|
|
challengeType: 5
|
|
forumTopicId: 302016
|
|
dashedName: problem-356-largest-roots-of-cubic-polynomials
|
|
---
|
|
|
|
# --description--
|
|
|
|
Let an be the largest real root of a polynomial g(x) = x3 - 2n·x2 + n.
|
|
|
|
For example, a2 = 3.86619826...
|
|
|
|
Find the last eight digits of.
|
|
|
|
Note: represents the floor function.
|
|
|
|
# --hints--
|
|
|
|
`euler356()` should return 28010159.
|
|
|
|
```js
|
|
assert.strictEqual(euler356(), 28010159);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function euler356() {
|
|
|
|
return true;
|
|
}
|
|
|
|
euler356();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|