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

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

## Description
<section id='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.
</section>

## Instructions
<section id='instructions'>

</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler356()</code> should return 28010159.
    testString: assert.strictEqual(euler356(), 28010159, '<code>euler356()</code> should return 28010159.');

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

```js
function euler356() {
  // Good luck!
  return true;
}

euler356();
```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```
</section>