Ask Question
31 May, 15:02

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.

+4
Answers (1)
  1. 31 May, 16:22
    0
    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
Know the Answer?
Not Sure About the Answer?
Get an answer to your 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) ...” in 📙 Mathematics if there is no answer or all answers are wrong, use a search bar and try to find the answer among similar questions.
Search for Other Answers