The Problem: |
|
Find the positive integers m and n for which the roots of the
equations
x2−mx+(n+1)=0 and
x2−(n+1)x+m=0
are positive integers
that, together with m and n , form in some order an arithmetic
progression whose sum is 21 .
|
The solution:
Method 1. Nearly all solvers observed
that
m+n=10 ; here is their argument. We are
given that
and we know that the roots of a monic quadratic
equation add up the the negative of the coefficient of the
x -term:
Put these equations together to get
21=(r1+s1)+(r2+s2)+m+n=m+n+1+m+n=2m+2n+1,
whence
m+n=10 , as claimed. Next, because
m and
n are at most 6 and distinct, the
only possibilities are
m=6 and
n=4 , or
m=4 and
n=6 . The latter pair produces a pair
of quadratics that fail to have integer solutions. With
m=6 and
n=4 , however, the quadratics
become
whose solutions are 1 and 5 (for the first) and 2 and
3 (for the second), satisfying all our requirements.
Method 2. Here we again use the fact that the sum of the
roots of each quadratic equation equals the negative of the coefficient of the
x -term and, what's more, their
product equals the constant term. Because we are dealing with positive integers
that satisfy
r1+s1=m=r2s2, and r2+s2=n+1=r1s1,
Method 3. Here we again use the fact that
r1s1=n+1 and
r2s2=m . The latter tells us that the
product of two of the numbers from 1 to 6 equals the third --- the only
possibility is
2⋅3=6 , which gives us right away that
m=6 . We are left with 1, 4, and 5 to
arrange in the equation
r1s1=n+1 , which forces
n to be 4.
Method 4. The discriminants of the given quadratics,
namely
must be perfect squares. By checking all 30 pairs
m and
n of distinct integers from 1 to 6,
one finds that only the choice
n=4 and
m=6 produces a perfect square in the
second discriminant. Happily, it produces a perfect square also in the first
discriminant.
math central
댓글 없음:
댓글 쓰기