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

id	challengeType	title	videoUrl	localeTitle
5900f4d01000cf542c50ffe3	5	Problem 356: Largest roots of cubic polynomials		Problema 356: maiores raízes de polinômios cúbicos

Description

Seja a maior raiz real de um polinômio g (x) = x3 - 2n · x2 + n. Por exemplo, a2 = 3.86619826 ...

Encontre os últimos oito dígitos de.

Nota: representa a função floor.

Instructions

Tests

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

Challenge Seed

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

euler356();

Solution

// solution required