56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
---
|
||
id: 5900f4791000cf542c50ff8c
|
||
challengeType: 5
|
||
title: 'Problem 269: Polynomials with at least one integer root'
|
||
videoUrl: ''
|
||
localeTitle: 问题269：具有至少一个整数根的多项式
|
||
---
|
||
|
||
## Description
|
||
<section id="description">多项式P（x）的根或零是等式P（x）= 0的解。将Pn定义为其系数是n的数字的多项式。例如，P5703（x）= 5x3 + 7x2 + 3。 <p>我们可以看到：Pn（0）是n的最后一位，Pn（1）是n的位数之和，Pn（10）是n本身。定义Z（k）作为正整数的数量，n ，不超过多项式Pn具有至少一个整数根的k。 </p><p>可以证实Z（100 000）是14696。 </p><p>什么是Z（1016）？ </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler269()</code>应该返回1311109198529286。
|
||
testString: 'assert.strictEqual(euler269(), 1311109198529286, "<code>euler269()</code> should return 1311109198529286.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler269() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler269();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|