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

id, title, challengeType, forumTopicId, dashedName

id	title	challengeType	forumTopicId	dashedName
5900f4d01000cf542c50ffe3	Problem 356: Largest roots of cubic polynomials	5	302016	problem-356-largest-roots-of-cubic-polynomials

--description--

Let an be the largest real root of a polynomial g(x) = x^3 - 2^n \times x^2 + n.

For example, a_2 = 3.86619826\ldots

Find the last eight digits of \displaystyle\sum_{i = 1}^{30} \lfloor {a_i}^{987654321}\rfloor.

Note: \lfloor a\rfloor represents the floor function.

--hints--

rootsOfCubicPolynomials() should return 28010159.

assert.strictEqual(rootsOfCubicPolynomials(), 28010159);

--seed--

--seed-contents--

function rootsOfCubicPolynomials() {

  return true;
}

rootsOfCubicPolynomials();

--solutions--

// solution required