freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.english.md
mrugesh 22afc2a0ca feat(learn): python certification projects (#38216)
Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com>
Co-authored-by: Beau Carnes <beaucarnes@gmail.com>
2020-05-27 13:19:08 +05:30

865 B

id, challengeType, isHidden, title, forumTopicId
id challengeType isHidden title forumTopicId
5900f4d01000cf542c50ffe3 5 false Problem 356: Largest roots of cubic polynomials 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.

Instructions

Tests

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

Challenge Seed

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

euler356();

Solution

// solution required