freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-457-a-polynomial-modulo-the-square-of-a-prime.spanish.md

---
id: 5900f5361000cf542c510048
challengeType: 5
title: 'Problem 457: A polynomial modulo the square of a prime'
videoUrl: ''
localeTitle: 'Problema 457: un polinomio modulo el cuadrado de un primo'
---

## Description
<section id="description"> Sea f (n) = n2 - 3n - 1. Sea p un primo. Sea R (p) el número entero positivo más pequeño n tal que f (n) mod p2 = 0 si existe tal entero n, de lo contrario R (p) = 0. <p> Sea SR (L) ∑R (p) para todos los primos que no excedan de L. </p><p> Encuentra SR (107). </p></section>

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

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler457()</code> debe devolver 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>