56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
|
---
|
|||
|
|
id: 5900f54b1000cf542c51005d
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 479: Roots on the Rise'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 问题479：崛起的根源
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description">设ak，bk和ck表示表达式1 / x =（k / x）2（k + x2）-kx的三个解（实数或复数）。 <p>例如，对于k = 5，我们看到{a5，b5，c5}约为{5.727244，-0.363622 + 2.057397i，-0.363622-2.057397i}。 </p><p>令所有整数p，k的S（n）=Σ（ak + bk）p（bk + ck）p（ck + ak）p，使得1≤p，k≤n。 </p><p>有趣的是，S（n）总是一个整数。例如，S（4）= 51160。 </p><p>求S（106）modulo 1 000 000 007。 </p></section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
<section id="instructions">
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler479()</code>应该返回191541795。
|
|||
|
|
testString: 'assert.strictEqual(euler479(), 191541795, "<code>euler479()</code> should return 191541795.");'
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Challenge Seed
|
|||
|
|
<section id='challengeSeed'>
|
|||
|
|
|
|||
|
|
<div id='js-seed'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler479() {
|
|||
|
|
// Good luck!
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler479();
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Solution
|
|||
|
|
<section id='solution'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|
|||
|
|
</section>
|