Using the factorised trinomial
(n-2)(4n-7)" align="absmiddle" class="latex-formula">, prove that there are only two values of n for which

is a prime number.
1 answer:
4n² - 15n + 14<span> 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 </span>4n² - 15n + 14<span> = 5 , which is prime.
Case n - 2 = -1
That would be n = 1
Then </span>4n<span>² - 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 </span>4n<span>² - 15n + 14 will not be interger.
For any other n values, </span>4n<span>² - 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.</span>
You might be interested in
It represent a square pyramid
Answer:
14.9 min
Step-by-step explanation:
r=rate
r25=5*7
r25=35
r=35/25
r=1.4
substitution
r160=t*15
t=time
r=1.4
1.4*160=t*15
224=t*15/15
224/15=t
14.9 min
Answer:
I think its 12.56
Step-by-step explanation:
Multiply 4 and 3.14(thats pi)
Yes, being straight is the greatest