eonhard Euler, an 18th-century Swiss mathematician to whom the idea of an abstract formal model of networks (graphs; see Chapter 11) is due, made the observation that the polynomial yields a prime...

eonhard Euler, an 18th-century Swiss mathematician to whom the idea of an abstract formal model of networks (graphs; see Chapter 11) is due, made the observation that the polynomial

yields a prime number when it’s evaluated for many small integers n: for example, f(0) = 41 and f(1) = 43 and f(2) = 47 and f(3) = 53, and so forth. Prove or disprove the following claim: the function f(n) yields a prime for every nonnegative integer n