56 lines
1.2 KiB
Markdown
56 lines
1.2 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 такое, что f (n) mod p2 = 0, если такое целое число n существует, в противном случае R (p) = 0. <p> Пусть SR (L) - ΣR (p) для всех простых чисел, не превосходящих L. </p><p> Найдите SR (107). </p></section>
|
||
|
|
|
||
|
|
## Instructions
|
||
|
|
<section id="instructions">
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Tests
|
||
|
|
<section id='tests'>
|
||
|
|
|
||
|
|
```yml
|
||
|
|
tests:
|
||
|
|
- text: ''
|
||
|
|
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>
|