Difference between revisions of "1993 AIME Problems/Problem 4"
Danielguo94 (talk | contribs) (→Solution 2) |
Strategist (talk | contribs) (→Solution) |
||
Line 24: | Line 24: | ||
For <math>(m,n) = (1,92)</math>, we know that <math>0 < a < a + 1 < a + 93 < a + 94 < 500</math>, so there are <math>405</math> four-tuples. For <math>(m,n) = (3,28)</math>, <math>0 < a < a + 3 < a + 31 < a + 34 < 500</math>, and there are <math>465</math> four-tuples. In total, we have <math>405 + 465 = \boxed{870}</math> four-tuples. | For <math>(m,n) = (1,92)</math>, we know that <math>0 < a < a + 1 < a + 93 < a + 94 < 500</math>, so there are <math>405</math> four-tuples. For <math>(m,n) = (3,28)</math>, <math>0 < a < a + 3 < a + 31 < a + 34 < 500</math>, and there are <math>465</math> four-tuples. In total, we have <math>405 + 465 = \boxed{870}</math> four-tuples. | ||
+ | |||
+ | === Solution 3 === | ||
+ | Square both sides of the first equation in order to get <math>bc</math> and <math>ad</math> terms, which we can plug <math>93</math> in for. | ||
+ | |||
+ | <math>(a+d)^2 = (b+c)^2 \implies a^2 + 2ad + d^2 = b^2 + 2bc + c^2 \implies 2bc-2ad = a^2-b^2 + d^2-c^2 \implies 2(bc-ad) = (a-b)(a+b)+(d-c)(d+c)</math> | ||
+ | |||
+ | We can plug <math>93</math> in for <math>bc - ad</math> to get <math>186</math> on the left side, and also observe that <math>a-b = c-d</math> after rearranging the first equation. Plug in <math>c-d</math> for <math>a-b</math>. | ||
+ | |||
+ | <math>186 = (c-d)(a+b) + (d-c)(d+c) \implies 186 = -(d-c)(a+b) + (d-c)(d+c) \implies 186 = (d-c)(d+c-a-b)</math> | ||
+ | |||
+ | Now observe the possible factors of <math>186</math>, which are <math>1 \cdot 186, 2\cdot 93, 3 \cdot 62, 6\cdot 31</math>. <math>(d-c)</math> and <math>(d+c-a-b)</math> must be factors of <math>186</math>, and <math>(d+c-a-b)</math> must be greater than <math>(d-c)</math>. | ||
+ | |||
+ | <math>1 \cdot 186</math> work, and yields <math>405</math> possible solutions. | ||
== See also == | == See also == |
Revision as of 00:56, 21 December 2011
Problem
How many ordered four-tuples of integers with
satisfy
and
?
Solution
Solution 1
Let so
. It follows that
. Hence
.
Solve them in tems of to get
. The last two solutions don't follow
, so we only need to consider the first two solutions.
The first solution gives us and
, and the second one gives us
.
So the total number of such four-tuples is .
Solution 2
Let and
. From
,
.
Substituting ,
, and
into
,
Hence,
or
.
For , we know that
, so there are
four-tuples. For
,
, and there are
four-tuples. In total, we have
four-tuples.
Solution 3
Square both sides of the first equation in order to get and
terms, which we can plug
in for.
We can plug in for
to get
on the left side, and also observe that
after rearranging the first equation. Plug in
for
.
Now observe the possible factors of , which are
.
and
must be factors of
, and
must be greater than
.
work, and yields
possible solutions.
See also
1993 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 3 |
Followed by Problem 5 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |