SOLUTION: Find the number of positive integers n, {{{1 <=n<=1000}}}, for which the polynomial {{{x^2 + x - n}}} can be factored as the product of two linear factors with integer coefficients
Question 1158926: Find the number of positive integers n, , for which the polynomial can be factored as the product of two linear factors with integer coefficients. Found 2 solutions by Edwin McCravy, solver91311:Answer by Edwin McCravy(20054) (Show Source):
The factorization of x² + x - n must be in the form
(x - p)(x + q) where p and q are positive integers.
We must have this identity for all values of x:
x² + x - n = (x - p)(x + q)
x² + x - n = x² + qx - px - pq
x² + x - n = x² + (q - p)x - pq
So q - p = 1
pq = n
q = p + 1
p(p+1) = n
The only positive zero of the polynomial on the left is approximately 0.6,
and the p²+p-1 is positive for and only for positive values of integer p greater
than or equal to 1.
The only negative zero of the polynomial on the right is approximately 31.1,
and the p²+p-1000 is negative only for positive values of p less than or equal
to 31. So p<=31
Therefore there are 31 ways the polynomial x² + x - n can be factored as the
product of two linear factors with integer coefficients.
factorization when and
(x-p)(x+q) p= n=
--------------------------------
1. (x-1)(x+2) 1 2
2. (x-2)(x+3) 2 6
3. (x-3)(x+4) 3 12
…
29. (x-29)(x+30) 29 870
30. (x-30)(x+31) 30 930
31. (x-31)(x+32) 31 992
Edwin
Since the sign on the constant term is negative, the two roots must have opposite signs. And since the coefficient on the linear term is a positive 1, the positive root must have an absolute value that exceeds the absolute value of the negative root by one.
then there exist integers and such that if and are factors of the quadratic, the following relations hold:
and
We know the smallest possible values for and are 1 and 2, and therefore the smallest is 2. To get a boundary for the largest possible we solve:
I leave it as an exercise for the student to verify that the positive root of this equation is slightly in excess of 31.
Checking: If , then and but if , then = and .
Therefore the set of values for that satisfies all conditions of the problem is which leads to the conclusion that there are exactly 31 pairs that produce 31 unique values that satisfy the conditions.
John
My calculator said it, I believe it, that settles it