---
id: 5900f5361000cf542c510048
challengeType: 5
title: 'Problem 457: A polynomial modulo the square of a prime'
---
## Description
Let f(n) = n2 - 3n - 1.
Let p be a prime.
Let R(p) be the smallest positive integer n such that f(n) mod p2 = 0 if such an integer n exists, otherwise R(p) = 0.
Let SR(L) be ∑R(p) for all primes not exceeding L.
Find SR(107).
## Instructions
## Tests
```yml
tests:
- text: euler457() should return 2647787126797397000.
testString: assert.strictEqual(euler457(), 2647787126797397000, 'euler457() should return 2647787126797397000.');
```
## Challenge Seed
```js
function euler457() {
// Good luck!
return true;
}
euler457();
```