Difference between revisions of "1998 AIME Problems/Problem 7"
Line 23: | Line 23: | ||
-When <math>(x, y) = (4, 94)</math>, <math>(a, b) = (1, 3), (3, 1)</math> and <math>(c, d) = (1, 93), (3, 91),...,(93, 1)</math>. This accounts for <math>94</math> solutions. | -When <math>(x, y) = (4, 94)</math>, <math>(a, b) = (1, 3), (3, 1)</math> and <math>(c, d) = (1, 93), (3, 91),...,(93, 1)</math>. This accounts for <math>94</math> solutions. | ||
− | We quickly see that <math>n</math>, the total number of | + | We quickly see that <math>n</math>, the total number of acceptable ordered pairs <math>(a, b, c, d) = 1 \cdot 48 + 2 \cdot 47 + 3 \cdot 46 + ... + 48 \cdot 1 = (24.5 - 23.5)(24.5) + (24.5 - 22.5)(24.5 + 22.5) + ... + (24.5 + 23.5)(24.5 - 23.5) = 48(24.5)^2 - 2(0.5^2 + 1.5^2 + ... + 23.5^2) = 28812 - \frac{1^2 + 3^2 + ... + 47^2}{2} = 28812 - \frac{1^2 + 2^2 + ... + 47^2 - 4(1^2 + 2^2 + ... + 23^2)}{2} = 28812 - \frac{47(47 + 1)(2(47) + 1)/6 - 4(23)(23 + 1)(2(23) + 1)/6}{2} = 19600</math>. Therefore, <math>\frac{n}{100} = \frac{19600}{100} = \boxed{196}</math>. |
(This solution uses the sum of squares identity to calculate <math>1^2 + 2^2 + ... + 47^2</math> and <math>1^2 + 2^2 + ... + 23^2</math>.) | (This solution uses the sum of squares identity to calculate <math>1^2 + 2^2 + ... + 47^2</math> and <math>1^2 + 2^2 + ... + 23^2</math>.) |
Revision as of 14:59, 25 October 2019
Problem
Let be the number of ordered quadruples
of positive odd integers that satisfy
Find
Solution 1
Define . Then
, so
.
So we want to find four natural numbers that sum up to 51; we can imagine this as trying to split up 51 on the number line into 4 ranges. This is equivalent to trying to place 3 markers on the numbers 1 through 50; thus the answer is , and
.
Solution 2
Another way we can approach this problem is by imagining a line of 98 stones. We want to place the stones into boxes so that each box has an odd number of stones. We then proceed by placing one stone in each box to begin with, ensuring that we have a positive number in every box. Now we have
stones left. Because we want an odd number in each box, we pair the stones, creating
sets of
. Every time we add a pair to one of the boxes, the number of stones in the box remains odd, because (an odd #) + (an even #) = (an odd #).
Our problem can now be restated: how many ways are there to partition a line of stones? We can easily solve this by using
sticks to separate the stones into
groups, and this is the same as arranging a line of
sticks and
stones.
Our answer is therefore
Solution 3
Let and
. Then
, where
are positive even integers ranging from
.
-When ,
and
. This accounts for
solutions.
-When ,
and
. This accounts for
solutions.
We quickly see that , the total number of acceptable ordered pairs
. Therefore,
.
(This solution uses the sum of squares identity to calculate and
.)
<baker77>
See also
1998 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 6 |
Followed by Problem 8 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.