Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.english.md
Oliver Eyton-Williams bd68b70f3d Feat: hide blocks not challenges (#39504)
* fix: remove isHidden flag from frontmatter

* fix: add isUpcomingChange

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

* feat: hide blocks not challenges

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>
2020-09-03 15:07:40 -07:00

65 lines
849 B
Markdown

---
id: 5900f4d01000cf542c50ffe3
challengeType: 5
title: 'Problem 356: Largest roots of cubic polynomials'
forumTopicId: 302016
---
## 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);
```
</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>