55 lines
1.3 KiB
Markdown
55 lines
1.3 KiB
Markdown
---
|
||
id: 5900f5231000cf542c510034
|
||
challengeType: 5
|
||
title: 'Problem 438: Integer part of polynomial equation"s solutions'
|
||
videoUrl: ''
|
||
localeTitle: 问题438:多项式方程解的整数部分
|
||
---
|
||
|
||
## Description
|
||
<section id="description">对于整数的n元组t =(a1,...,an),let(x1,...,xn)是多项式方程xn + a1xn-1 + a2xn-2 + ... +的解。 an-1x + an = 0。 <p>考虑以下两个条件:x1,...,xn都是真实的。如果x1,...,xn被排序,则⌊xi⌋= i,1≤i≤n。 (⌊·⌋:地板功能。) </p><p>在n = 4的情况下,有12个n元组的整数满足两个条件。我们将S(t)定义为t中整数绝对值的总和。对于n = 4,我们可以验证满足两个条件的所有n元组t的ΣS(t)= 2087。 </p><p>找到ΣS(t)为n = 7。 </p></section>
|
||
|
||
## Instructions
|
||
undefined
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: ''
|
||
testString: 'assert.strictEqual(euler438(), 2046409616809, "<code>euler438()</code> should return 2046409616809.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler438() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler438();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|