freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md

---
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
```