Difference between revisions of "1980 AHSME Problems/Problem 29"
J314andrews (talk | contribs) (→Solution 3 (Modular Arithmetic)) |
J314andrews (talk | contribs) (→Problem) |
||
Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
− | How many ordered triples (x,y,z) of integers satisfy the system of equations below? | + | How many ordered triples <math>(x,y,z)</math> of integers satisfy the system of equations below? |
<cmath>\begin{array}{l} x^2-3xy+2y^2-z^2=31 \\ -x^2+6yz+2z^2=44 \\ x^2+xy+8z^2=100\\ \end{array} </cmath> | <cmath>\begin{array}{l} x^2-3xy+2y^2-z^2=31 \\ -x^2+6yz+2z^2=44 \\ x^2+xy+8z^2=100\\ \end{array} </cmath> |
Revision as of 18:36, 25 June 2025
Contents
Problem
How many ordered triples of integers satisfy the system of equations below?
Solution 1
Sum of three equations,
(x,y,z) are integers, ie. ,
: 1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144, 169
: 174, 171, 166, 159, 150, 139, 126, 111, 94, 75, 54, 31, 6
so there is NO solution
Wwei.yu (talk) 22:09, 28 March 2020 (EDT)Wei
Solution 2 (Eliminate Cross Terms)
First, to eliminate the term, multiply both sides of the third equation by
to get
, and then add it to the first equation to get
.
Next, to eliminate the term, multiply both sides of the new equation by
to get
, and then add it to the second equation to get
.
This equation can be rearranged to get . Since
is not divisible by
,
must be divisible by
and there exists an integer
such that
. Substituting
and dividing both sides of this equation by
yields
. So
, which is only true if
. But
would require
, which is impossible since
is not a perfect square. Therefore, this equation (and also this system) has
integer solutions.
-j314andrews, based on solution by Farenhajt
Solution 3 (Modular Arithmetic)
Reducing the second equation mod yields
. Therefore,
and
is even.
Reducing the first equation mod and substituting yields
. Therefore,
and
is odd.
Since is even,
, and since
is odd,
. Also
. Reducing the second equation mod
and substituting yields
, so
is odd.
Reducing the third equation mod and substituting yields
. Since
is odd,
.
Since is odd,
. Reducing the first equation mod
and substituting yields
, which is impossible.
Therefore, this system has integer solutions.
-j314andrews
See also
1980 AHSME (Problems • Answer Key • Resources) | ||
Preceded by Problem 28 |
Followed by Problem 30 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 • 26 • 27 • 28 • 29 • 30 | ||
All AHSME Problems and Solutions |
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions.