Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md
Oliver Eyton-Williams 0bd52f8bd1 Feat: add new Markdown parser (#39800)
and change all the challenges to new `md` format.
2020-11-27 10:02:05 -08:00

578 B

id, title, challengeType, forumTopicId
id title challengeType forumTopicId
5900f4d01000cf542c50ffe3 Problem 356: Largest roots of cubic polynomials 5 302016

--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.

--hints--

euler356() should return 28010159.

assert.strictEqual(euler356(), 28010159);

--seed--

--seed-contents--

function euler356() {

  return true;
}

euler356();

--solutions--

// solution required