Let fx x2 x 1 Prove or disprove that fn is prime for ever

Let f(x) = x² + x + 1. Prove or disprove that f(n) is prime for every nonnegative integer n.

Solution

this can be disapproved by taking a counter example.

for example take n=10

f(10)=10^2+10+1

      =111 which is not prime.( divisible by 3,37 also)

hence the given statement is not alwats right.