56 lines
1.3 KiB
Markdown
56 lines
1.3 KiB
Markdown
|
---
|
|||
|
|
id: 5900f4ff1000cf542c510011
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 402: Integer-valued polynomials'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 问题402：整数值多项式
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description">可以证明，对于每个整数n，多项式n4 + 4n3 + 2n2 + 5n是6的倍数。还可以显示6是满足该属性的最大整数。 <p>将M（a，b，c）定义为最大m，使得n4 + an3 + bn2 + cn是所有整数n的m的倍数。例如，M（4,2,5）= 6。 </p><p>此外，将S（N）定义为所有0 <a，b，c≤N的M（a，b，c）之和。 </p><p>我们可以验证S（10）= 1972和S（10000）= 2024258331114。 </p><p>设Fk为斐波纳契数列：对于k≥2，F0 = 0，F1 = 1且Fk = Fk-1 + Fk-2。 </p><p>求最高9位数为ΣS（Fk）为2≤k≤1234567890123。 </p></section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
<section id="instructions">
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler402()</code>应返回356019862。
|
|||
|
|
testString: 'assert.strictEqual(euler402(), 356019862, "<code>euler402()</code> should return 356019862.");'
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Challenge Seed
|
|||
|
|
<section id='challengeSeed'>
|
|||
|
|
|
|||
|
|
<div id='js-seed'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler402() {
|
|||
|
|
// Good luck!
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler402();
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Solution
|
|||
|
|
<section id='solution'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|
|||
|
|
</section>
|