A polynomial modulo the square of a prime

Problem 457

Published on 02 February 2014 at 04:00 am [Server Time]

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).

Confirmation Code:
Go to back to Problems