Prove that the polynomial n2 − 79n + 1601 does not produce a primenumber for every integer n ≥ 0.
Question
Solution 1
Sure, here is a stepbystep proof:

The given polynomial is n^2  79n + 1601.

Let's evaluate the polynomial for n = 80.

Substituting n = 80 into the polynomial, we get:
80^2  79*80 + 1601 = 6400  6320 + 1601 = 1681.

1681 is not a prime number because it has factors other than Knowee AI is a powerful AIpowered study tool designed to help you to solve study problem.
Knowee AI is a powerful AIpowered study tool designed to help you to solve study problem.
Knowee AI is a powerful AIpowered study tool designed to help you to solve study problem.
Knowee AI is a powerful AIpowered study tool designed to help you to solve study problem.
Knowee AI is a powerful AIpowered study tool designed to help you to solve study problem.
Knowee AI
Similar Questions
Prove that the polynomial n2 − 79n + 1601 does not produce a primenumber for every integer n ≥ 0.
Prove that for every positive integer n, and sets A and B1, B2, ..., Bn, A  ∩(i=1 to n) Bi = ∪(i=1 to n) (A  Bi).
T(n)=n+4n2+8+16n4+32+⋯+Θ(nlg4)=lg(n−1)∑i=0 2in+2lg(n−1)∑i=0 4i+Θ(n2)=2lgn−12−1n+2⋅4lgn−14−1+Θ(n2)=(2lgn−1)n+23(4lgn−1)+Θ(n2)=(n−1)n+23(n2−1)+Θ(n2)=Θ(n2)
The goal of hashing is to produce a search that takesAO(1) timeBO(n2) timeCO(log n ) timeDO(n log n ) timePrevious
Prove the equality gcd(m, n) = gcd(n, m mod n) for every pair of positiveintegers m and n
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.