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

56 lines
975 B
Markdown
Raw Normal View History

---
id: 5900f4d01000cf542c50ffe3
challengeType: 5
title: 'Problem 356: Largest roots of cubic polynomials'
videoUrl: ''
localeTitle: 'Problema 356: maiores raízes de polinômios cúbicos'
---
## Description
<section id="description"> Seja a maior raiz real de um polinômio g (x) = x3 - 2n · x2 + n. Por exemplo, a2 = 3.86619826 ... <p> Encontre os últimos oito dígitos de. </p><p> Nota: representa a função floor. </p></section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler356()</code> deve retornar 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>