60 lines
1.0 KiB
Markdown
60 lines
1.0 KiB
Markdown
|
---
|
|||
|
|
id: 5
|
|||
|
|
localeTitle: 5900f3e71000cf542c50fefa
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 123: Prime square remainders'
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id='description'>
|
|||
|
|
Sea pn el primer primo: 2, 3, 5, 7, 11, ..., y sea r el resto cuando (pn − 1) n + (pn + 1) n esté dividido por pn2.
|
|||
|
|
Por ejemplo, cuando n = 3, p3 = 5, y 43 + 63 = 280 ≡ 5 mod 25.
|
|||
|
|
El valor mínimo de n para el cual el resto primero excede 109 es 7037.
|
|||
|
|
Encuentre el valor mínimo de n para el cual el resto primero excede 1010.
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
<section id='instructions'>
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler123()</code> debe devolver 21035.
|
|||
|
|
testString: 'assert.strictEqual(euler123(), 21035, "<code>euler123()</code> should return 21035.");'
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Challenge Seed
|
|||
|
|
<section id='challengeSeed'>
|
|||
|
|
|
|||
|
|
<div id='js-seed'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler123() {
|
|||
|
|
// Good luck!
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler123();
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Solution
|
|||
|
|
<section id='solution'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|
|||
|
|
</section>
|