Ask Question
14 March, 22:38

Using the factorised trinomial, prove that there are only two values of n for which is a prime number.

+3
Answers (1)
  1. 14 March, 22:51
    0
    4n² - 15n + 14 is always the product of two numbers, for it to be prime number, one of these factors must be either 1 or - 1.

    Case n - 2 = 1

    That would be n = 3

    Then 4n² - 15n + 14 = 5, which is prime.

    Case n - 2 = - 1

    That would be n = 1

    Then 4n ² - 15n + 14 = 3, which is also prime.

    Case 4n - 7 = 1

    That would be n = 2 and that makes other factor (n-2) zero so it's not prime

    Case 4n-7 = - 1

    That would be n = 3/2 which is not integer, so 4n ² - 15n + 14 will not be interger.

    For any other n values, 4n ² - 15n + 14 will be composite number since it is product of two factors.

    Therefore we are left with n = 1 and n = 3; only two values of n.
Know the Answer?
Not Sure About the Answer?
Get an answer to your question ✅ “Using the factorised trinomial, prove that there are only two values of n for which is a prime number. ...” 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