MathDB

E 11

Source:

May 25, 2007

Euleralgebrapolynomialmodular arithmetic

Problem Statement

In 1772 Euler discovered the curious fact that

n^2 +n+41

is prime when

n

is any of

0,1,2, \cdots, 39

. Show that there exist

40

consecutive integer values of

n

for which this polynomial is not prime.

Back to Problems View on AoPS