Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md
Oliver Eyton-Williams ee1e8abd87 feat(curriculum): restore seed + solution to Chinese (#40683)
* feat(tools): add seed/solution restore script

* chore(curriculum): remove empty sections' markers

* chore(curriculum): add seed + solution to Chinese

* chore: remove old formatter

* fix: update getChallenges

parse translated challenges separately, without reference to the source

* chore(curriculum): add dashedName to English

* chore(curriculum): add dashedName to Chinese

* refactor: remove unused challenge property 'name'

* fix: relax dashedName requirement

* fix: stray tag

Remove stray `pre` tag from challenge file.

Signed-off-by: nhcarrigan <nhcarrigan@gmail.com>

Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
2021-01-12 19:31:00 -07:00

637 B

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) = 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