---
id: 5900f3e71000cf542c50fefa
challengeType: 5
title: 'Problem 123: Prime square remainders'
videoUrl: ''
localeTitle: 'Problema 123: Resíduos quadrados principais'
---

## Description
<section id="description"> Seja pn o nono primo: 2, 3, 5, 7, 11, ..., e seja r o resto quando (pn − 1) n + (pn + 1) n é dividido por pn2. Por exemplo, quando n = 3, p3 = 5 e 43 + 63 = 280 ≡ 5 mod 25. O menor valor de n para o qual o restante excede 109 é 7037. Encontre o menor valor de n para o qual o restante excede primeiro 1010 </section>

## Instructions
<section id="instructions">
</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler123()</code> deve retornar 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>