freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.english.md
Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828)
* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown
2018-10-20 23:32:47 +05:30

878 B

id, challengeType, title
id challengeType title
5900f4d01000cf542c50ffe3 5 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.

Instructions

Tests

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

Challenge Seed

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

euler356();

Solution

// solution required