56 lines
1.0 KiB
Markdown
56 lines
1.0 KiB
Markdown
---
|
||
id: 5900f5361000cf542c510048
|
||
challengeType: 5
|
||
title: 'Problem 457: A polynomial modulo the square of a prime'
|
||
videoUrl: ''
|
||
localeTitle: 问题457：多项式以素数的平方为模
|
||
---
|
||
|
||
## Description
|
||
<section id="description">设f（n）= n2 - 3n - 1.设p为素数。令R（p）是最小的正整数n，使得如果存在这样的整数n则f（n）mod p2 = 0，否则R（p）= 0。 <p>对于不超过L的所有素数，令SR（L）为ΣR（p）。 </p><p>找到SR（107）。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler457()</code>应该返回2647787126797397000。
|
||
testString: 'assert.strictEqual(euler457(), 2647787126797397000, "<code>euler457()</code> should return 2647787126797397000.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler457() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler457();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|