freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-356-largest-roots-o...

---
id: 5900f4d01000cf542c50ffe3
title: 'Problem 356: Largest roots of cubic polynomials'
challengeType: 5
forumTopicId: 302016
---

# --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
```
feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00			`---`
			`id: 5900f4d01000cf542c50ffe3`
			`title: 'Problem 356: Largest roots of cubic polynomials'`
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 18:02:05 +00:00			`challengeType: 5`
fix(curriculum): Added forumTopicId to remaining 1200 challeng… (#36558) 2019-08-05 16:17:33 +00:00			`forumTopicId: 302016`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00			`---`

Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 18:02:05 +00:00			`# --description--`

feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00			`Let an be the largest real root of a polynomial g(x) = x3 - 2n·x2 + n.`

Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 18:02:05 +00:00			`For example, a2 = 3.86619826...`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00
			`Find the last eight digits of.`

Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 18:02:05 +00:00			`Note: represents the floor function.`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 18:02:05 +00:00			`# --hints--`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 18:02:05 +00:00			`euler356()` should return 28010159.
feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 18:02:05 +00:00			```js
			`assert.strictEqual(euler356(), 28010159);`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00			```

Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 18:02:05 +00:00			`# --seed--`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 18:02:05 +00:00			`## --seed-contents--`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00
			```js
			`function euler356() {`
fix: remove Good luck! comment from challenge seed code (#39575) 2020-09-15 16:57:40 +00:00
feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00			`return true;`
			`}`

			`euler356();`
			```

Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 18:02:05 +00:00			`# --solutions--`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00
			```js
			`// solution required`
			```