Question

There is an integer n such that 2n2 − 5n + 2 is prime. To prove the statement it suffices to find a value of n such that (n, 2n2 − 5n + 2) satisfies the property "2n2 − 5n + 2 is prime." Show that you can do this by entering appropriate values for n and 2n2 − 5n + 2.

Answer 1

Answer:

n = 0 or 3

Step-by-step explanation:

2n² - 5n + 2

2n² - 4n - n + 2

2n(n - 2) -1(n - 2)

(n - 2)(2n - 1)

Prime number is one which is divisible by itself and 1

n-2 = 1 n = 3

2n-1 = 1 n = 0