How many integers n can be used such that the quantity |2n^2 + 3n + 11 - n^2 + 9n| results in a prime number?
+2264
How many integers n can be used such that the quantity |2n^2 + 3n + 11 - n^2 + 9n| results in a prime number?
|2n2 + 3n + 11 – n2 + 9n|
n2 + 12n + 11
factors to solutions n = –1
n = –11 —>> absolute value is +11
One isn't a prime, so eleven is the only solution.
So, the answer to "how many are there" is one,
since absolute value limits it to its positive value.
.
