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
1 answer:
You might be interested in
Answer:
Step-by-step explanation:
There is no solution as you have two variables and only one equation. The best you can do is solve for one variable as a function of the other.
Answer:
(-√(6-√26) < x < √(6-√26)) ∪ (x < -√(6 +√26)) ∪ (√(6 +√26) < x)
Step-by-step explanation:
Using x^2 = z, the equation can be rewritten as ...
z^2 -12z +10 > 0
(z -6)^2 -26 > 0
|z -6| > √26
This resolves to two equations.
This one ...
x^2 -6 < -√26 . . . . substitute x^2 for z
|x| < √(6-√26) . . . . add 6, take the square root; use √a^2 = |a|
-√(6-√26) < x < √(6-√26)
__
and this one ...
x^2 -6 > √26
|x| > √(6 +√26)
x < -√(6 +√26) ∪ √(6 +√26) < x
