Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.english.md
Oliver Eyton-Williams bd68b70f3d Feat: hide blocks not challenges (#39504)
* fix: remove isHidden flag from frontmatter

* fix: add isUpcomingChange

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

* feat: hide blocks not challenges

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>
2020-09-03 15:07:40 -07:00

849 B

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