freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-356-largest-roots-o...

26 lines
407 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters!

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

---
id: 5900f4d01000cf542c50ffe3
title: 问题356三次多项式的最大根
challengeType: 5
videoUrl: ''
---
# --description--
设a是多项式的最大实根gx= x3 - 2n·x2 + n。例如a2 = 3.86619826 ......
找到最后八位数字。
注意:代表楼层功能。
# --hints--
`euler356()`应该返回28010159。
```js
assert.strictEqual(euler356(), 28010159);
```
# --solutions--