Answer Sheet

Number Answer Problem ID

1 24 ABC51
2 640 (area codes) 4CA53
3 960 subsets D5403
4 97536 240D1
5 1/7 11B04
6 2422.50 dollars 43544

1 Copyright MATHCOUNTS Inc. All rights reserved

 Solutions

(1) 24 ID: [ABC51]

The sum of the number of students who liked only math, those who liked only science, those who liked both
subjects, and those who liked neither should be 120 (the total number of students). We already know that 23
liked only math. Since 84 students total said that they liked math, 84 − 23 = 61 must like both math and
science. We also know that 73 students said that they liked science. Since 61 of these students said that they
liked both math and science, we are left with 73 − 61 = 12 students that like science, but not math. This leaves
120 − 23 − 61 − 12 = 24 students who disliked both of the subjects.

(2) 640 (area codes) ID: [4CA53]

Prior to 1995, there were 10 − 2 = 8 possibilities for the first digit, 2 possibilities for the second digit, and 10
possibilities for the third digit, for a total of

8 · 2 · 10 = 160

total area codes.

After 1995, there are 10 − 2 = 8 possibilities for the first digit, 10 possibilities for the second digit, and 10
possibilities for the third digit, for a total of

8 · 10 · 10 = 800

total area codes.

Thus there are 800 − 160 = 640 more area codes possible today than prior to 1995.

2 Copyright MATHCOUNTS Inc. All rights reserved

(3) 960 subsets ID: [D5403]
There are 10 letters in the set, 4 of which (A, O, U, and E) are vowels. Subsets can contain anywhere between
1 and 10 letters.
There is only one 10 letter subset, and it will have to contain all of the vowels. From here, the combination
n!
function, C(n, k) = (n−k)!k! will be useful. A 9, 8, or 7 letter subset would have to use at least one vowel
as well, because there are only six consonants in the set, and the rest of the letters would have to be vowels.
10! 10!
There are C(10, 9) = (10−9)!9! = 10 subsets of 9 letters, C(10, 8) = (10−8)!8! = 45 subsets of 8 letters, and
10!
C(10, 7) = (10−7)!7! = 120 subsets of 7 letters.
There is only one 6 letter subset that would contain no vowels (the subset that is all the consonants.) All other
6-letter subsets would contain at least one vowel. To find how many sets of 6 there are, use the combination
10!
function. C(10, 6) = (10−6)!6! = 210. Subtract the all consonant set, so there are 209 sets of 6 with at least one
vowel.
For a 5 letter subset, again, find the total number of subsets of 5 and the number of these which contain no
10!
vowels. The total number of 5 letter subsets is C(10, 5) = (10−5)!5! = 252. There are six consonants, so there
6!
can be C(6, 5) = (6−5)!5! = 6 sets with no vowels, so there are 252 − 6 = 246 sets of 5 with at least one vowel.
10! 6!
There are C(10, 4) = (10−4)!4! = 210 total sets of 4 letters, and C(6, 4) = (6−4)!4! = 15 all-consonant sets, so
there are 195 sets of 4 with at least one vowel.
10! 6!
There are C(10, 3) = (10−3)!3! = 120 total sets of 3 letters, and C(6, 3) = (6−3)!3! = 20 all-consonant sets, so
there are 100 sets of 3 with at least one vowel.
10! 6!
There are C(10, 2) = (10−2)!2! = 45 total sets of 2 letters, and C(6, 2) = (6−2)!2! = 15 all-consonant sets, so
there are 30 sets of 2 with at least one vowel.
Finally, there are 4 subsets of 1 that contain a vowel. Adding all of the possible subsets above together, we
find that there are 1 + 10 + 45 + 120 + 209 + 246 + 195 + 100 + 30 + 4 = 960 total subsets that contain at
least one vowel.

(4) 97536 ID: [240D1]

A number is divisible by 6 if it is divisible 3 and 2. For this to be true 6, our five-digit-number’s ones digit
must be even and the sum of its five digits must be divisible by 3. Since there are no even numbers among
our given digits 3, 5, 7, and 9, we know that these four must be our ten thousands, thousands, hundreds, and
tens digits (not necessarily in that order). To form the largest such number possible, we first maximize our ten
hundreds digit and let it be 9. Then, we consider our thousands digit. Out of our remaining three digits 3, 5,
and 7, the largest is 7 so we let that be our thousands digit. Following similar reasoning, we let our hundreds
digit be 5 and the tens digit be 3.
We then work on finding our ones digit by testing out the even digits from largest to smallest. 8 doesn’t work
because 9 + 7 + 5 + 3 + 8 = 32 which is not divisible by 3. Trying our next largest possible digit 6, we find that
9 + 7 + 5 + 3 + 6 = 30, which is indeed divisible by 3, so 6 works. Thus, our five-digit number is 97536 .

(5) 1/7 ID: [11B04]

7!
The word ELEMENT has 3! = 840 total arrangements.
We create a block of three consecutive E’s by fusing them into one EEE superblock, which we will denote by
the letter X. The ”word” XLMNT has 5! = 120 arrangements, so there are 120 ways to arrange the letters in
ELEMENT such that the three E’s are consecutive.
120 1
Thus, the desired probability is 840 = .
7

3 Copyright MATHCOUNTS Inc. All rights reserved

(6) 2422.50 dollars ID: [43544]
20×19×18×17
There are 4! = 4845 unique lottery tickets, so it would cost a total of 4845($0.50) = $2422.50 to
buy them all.

4 Copyright MATHCOUNTS Inc. All rights reserved