a) Let P(n) = n +n +41. Write a computer program (in Java, Matlab or Python)...

Transcribed Image Text:

a) Let P(n) = n² +n +41. Write a computer program (in Java, Matlab or Python) which finds the smallest positive counterexample for the statement: "If n is a positive integer then P(n) is a prime number". b) Similar to a) find the smallest counterexample for the polynomial: g(x) = x²-79x+1601. a) Let P(n) = n² +n +41. Write a computer program (in Java, Matlab or Python) which finds the smallest positive counterexample for the statement: "If n is a positive integer then P(n) is a prime number". b) Similar to a) find the smallest counterexample for the polynomial: g(x) = x²-79x+1601.

Answer rating: 100% (QA)

Python import sympy def isprimenum if num 2 return False return sympyisprimenum def findsm... View the full answer