2018 AIME I Problems/Problem 9: Difference between revisions
Cocohearts (talk | contribs) |
No edit summary |
||
| Line 18: | Line 18: | ||
-expiLnCalc | -expiLnCalc | ||
== Sol. 2 (C++) == | |||
This code works: | |||
int num = 0; | |||
for(int i = 1; i <= 20; i++){ | |||
for(int j = i+1; j <= 20; j++){ | |||
for(int k = j+1; k <= 20; k++){ | |||
for(int m = k+1; m <= 20; m++){ | |||
if(i+j==16 || i + k == 16 || i + m == 16 || j + k == 16 | |||
|| j + m == 16 || k + m == 16){ | |||
if(i+j==24 || i+k==24 || i+m==24 || j+k==24 || j+m == 24 || k+m==24){ | |||
num++; | |||
} | |||
} | |||
} | |||
} | |||
} | |||
} | |||
cout << num << endl; | |||
==See Also== | ==See Also== | ||
{{AIME box|year=2018|n=I|num-b=8|num-a=10}} | {{AIME box|year=2018|n=I|num-b=8|num-a=10}} | ||
{{MAA Notice}} | {{MAA Notice}} | ||
Revision as of 22:54, 13 March 2018
Find the number of four-element subsets of
with the property that two distinct elements of a subset have a sum of
, and two distinct elements of a subset have a sum of
. For example,
and
are two such subsets.
Solutions
Solution 1
This problem is tricky because it is the capital of a few "bashy" calculations. Nevertheless, the process is straightforward. Call the set
.
Note that there are only two cases: 1 where
and
or 2 where
and
. Also note that there is no overlap between the two situations! This is because if they overlapped, adding the two equations of both cases and canceling out gives you
, which cannot be true.
Case 1.
This is probably the simplest: just make a list of possible combinations for
and
. We get
for the first and
for the second. That appears to give us
solutions, right? NO. Because elements can't repeat, take out the supposed sets
![]()
That's ten cases gone. So
for Case 1.
Case 2.
We can look for solutions by listing possible
values and filling in the blanks. Start with
, as that is the minimum. We find
, and likewise up to
. But we can't have
or
because
or
, respectively! Now, it would seem like there are
values for
and
unique values for each
, giving a total of
, but that is once again not true because there are some repeated values! We can subtract 1 from all pairs of sets that have two elements in common, because those can give us identical sets. There are 3 pairs about
and 3 pairs about
, meaning we lose
. That's
for Case 2.
Total gives
.
-expiLnCalc
Sol. 2 (C++)
This code works:
int num = 0;
for(int i = 1; i <= 20; i++){
for(int j = i+1; j <= 20; j++){
for(int k = j+1; k <= 20; k++){
for(int m = k+1; m <= 20; m++){
if(i+j==16 || i + k == 16 || i + m == 16 || j + k == 16
|| j + m == 16 || k + m == 16){
if(i+j==24 || i+k==24 || i+m==24 || j+k==24 || j+m == 24 || k+m==24){
num++;
}
}
}
}
}
}
cout << num << endl;
See Also
| 2018 AIME I (Problems • Answer Key • Resources) | ||
| Preceded by Problem 8 |
Followed by Problem 10 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions. Error creating thumbnail: File missing