Answer Sheet

Number Answer Problem ID

1 1001/2003 20D52
2 5 sequences 21C1
3 30 interior diagonals 0C551
4 80 cm 41A01
5 1/210 AD5
6 1/10 20A01
7 1/18 00D51
8 195 subcommittees 40C1
9 4 5C552
10 13/18 03A4
11 4 arrangements CD02
7
12 30 5D121
13 69 BD02
14 8 51B4
15 41/60 53A21
5
16 23 45315
17 37 lines 5C551
18 4 points D0B4
19 25 integers 2A02
20 118 integers A0C1
21 240 55B01
22 1/8 B0D01
23 26 0C322
24 7 40B4
25 4 B4141
26 1/7 D1B4
27 64/125 15B01
28 13/20 B0A01
29 1/128 B0B4
30 7/72 1D414

1 Copyright MATHCOUNTS Inc. All rights reserved

 Solutions

(1) 1001/2003 ID: [20D52]

Let n be the number of rectangles contained in the bottom row, and let m be the number of rectangles in the
bottom row which contain a shaded square. There are n rectangles contained in the top row and n rectangles
spanning both rows, so there are 3n rectangles in the figure. Similarly, 3m rectangles contain a shaded square.
The probability that a rectangle chosen at random includes a shaded square is 3m/3n = m/n.
A rectangle contained in the bottom row is
determined by choosing any two of the 2004 vertical segments as
sides of the rectangle. Therefore, n = 2004
2 = 2004·2003
2 = 1002 · 2003. A rectangle in the bottom row which
contains a shaded square is determined by choosing one side from among the 1002 vertical segments to the left
of the shaded square and one side from among the 1002 vertical segments to the right of the shaded square.
Therefore, m = 10022 . The probability that a rectangle chosen at random from the figure does not include a
m 10022 1002 1001
shaded square is 1 − =1− =1− = .
n 1002 · 2003 2003 2003

(2) 5 sequences ID: [21C1]

Denote a rotation by r and a reflection by s. Then we see that applying r three times is the same as doing
nothing at all, and applying s twice is the same as doing nothing at all.
It is clear that in our five moves we must have an even number of reflections. If we apply s 0 or 4 times, then
we must apply r 5 or 1 times and will not end up at our starting position. However, if we apply s 2 times,
then we apply r 3 times. Note we cannot have the sequence rsr, since this is the same as just s; we would then
reduce to 2 s and 1 r, and no sequence of this form works.
However, it is clear that the 5 arrangements of rrrss not containing this subsequence are valid, since they
contain either rrr or ss, so they quickly reduce to the trivial action (i.e. the equivalent of doing nothing).

(3) 30 interior diagonals ID: [0C551]

There are two kinds of vertices: those at the points of the star, and those that aren’t.
If a vertex is at the point of the star, interior diagonals can only be drawn to the opposite point and to the
vertices on either side of the opposite point, giving 3 diagonals per each of 6 points, for a total of 18 diagonals.
If a vertex is not at a point, diagonals can be drawn to the two adjacent non-point vertices, as well as to the
opposite non-point vertex and the two vertices to either side of the opposite vertex. This gives 7 diagonals for
each of 6 vertices, for a total of 42 diagonals.
Adding the two types gives 18 + 42 = 60 diagonals. But each diagonal is counted twice: once for each endpoint,
60
so the actual number of interior diagonals is = 30 .
2

(4) 80 cm ID: [41A01]

No solution is available at this time.

2 Copyright MATHCOUNTS Inc. All rights reserved

(5) 1/210 ID: [AD5]
We count the number of ways to draw the tan chips consecutively, the pink chips consecutively, and the violet
chips consecutively (although not necessarily in that order). First of all, we can draw the tan chips in 3! ways,
the pink chips in 2! ways, and the violet chips in 4! ways. We can choose our drawing order (e.g pink-tan-violet)
in 3! ways. Thus we have 3!2!4!3! satisfying arrangements and 9! total ways of drawing the chips. So our answer
1
is 3!2!4!3!
9! = .
210

(6) 1/10 ID: [20A01]

No solution is available at this time.

(7) 1/18 ID: [00D51]

The probability is 32 that the second card played in the first round is different from the first card played. The
probability is 31 that the third card played is the color of neither of the first two cards played. Therefore, the
probability is 32 · 31 = 92 that one card of each color is played in the first round.
Assume now that one card of each color was played in the first round. Without loss of generality, the hands of
the players are
Player 1 Player 2 Player 3
green, blue green, red red, blue
There are 8 equally likely outcomes for the set of cards played in the second round. Let’s describe them using
strings of 3 letters; for example, GRR denotes the event that Player 1 plays green and Players 2 and 3 each
play red. The 8 possible outcomes are GGR, GGB, GRR, GRB, BGR, BGB, BRR, and BRB. Only 2 of these
8 possibilities include one card of each color, so the probability that one card of each color will be played in
the second round is 82 = 14 , given that one card of each color was played in the first round.
Finally, if in both of the first two rounds one card of each color was played, the three cards left over from
the original 9 are different colors. Therefore, the probability is 1 that one card of each color will be played
in the third round, given that one card of each color was played in each of the first two rounds. In total, the
1
probability that one card of each color will be played in every round is 29 · 41 · 1 = .
18

(8) 195 subcommittees ID: [40C1]

Because there are 4 teachers on the committee, there are 6 non-teachers. Now, in total, we can form 10


4 = 210
subcomittees. The number
of subcomittees with 0 teachers is the number of subcommittees formed by the 6
nonteachers, totaling 64 = 15. So, the number of subcomittees with at least 1 teacher is 210 − 15 = 195 .

(9) 4 ID: [5C552]

Our goal is to divide the factors of 8! into three groups in such a way that the products of the factors in each
group are as close together as possible. Write 8! as 8 · 7 · 6 · 5 · 4 · 3 · 2. Observe that 303 < 8! < 403 , so the
cube root of 8! is between 30 and 40. With this in mind, we group 7 and 5 to make one factor of 35. We can
also make a factor of 36 by using 6 along with 3 and 2. This leaves 8 and 4 which multiply to give 32. The
assignment (a, b, c) = (32, 35, 36) has the minimum value of c − a, since 31, 33, 34, 37, 38, and 39 contain prime
factors not present in 8!. Therefore, the minimum value of c − a is 4 .

3 Copyright MATHCOUNTS Inc. All rights reserved

(10) 13/18 ID: [03A4]
Suppose that there are a balls in the first box and b balls in the second box. Without loss of generality, assume
a ≤ b. Each of the green balls in the first box has probability 21 · a1 = 2a
1
of being drawn, and each of the green
1
balls in the second box has probability 2b of being drawn. The probability that a green ball is drawn is the
1 1
sum of these probabilities. To maximize the sum of five numbers each of which is either 2a or 2b , as many of
1
the numbers as possible should be the larger number, 2a . Since there are a balls in the first box, there are at
most a green balls in the first box. Therefore, the maximum probability of drawing a green ball if there are
a
a balls in the first box is 2a + 5−a 1 5−a
2b = 2 + 2(10−a) , where we have substituted 10 − a for b. To more easily
maximize this expression, we decrease the number of appearances of the variable by writing the probability as
1 5−a 1 10 − a − 5
+ = +
2 2(10 − a) 2 2(10 − a)
1 10 − a 5
= + −
2 2(10 − a) 2(10 − a)
1 1 5
= + − .
2 2 2(10 − a)
5
=1− .
2(10 − a)

This probability is maximized when the denominator of the fraction being subtracted from 1 is maximized,
13
which occurs when a = 1. The maximum probability is .
18

(11) 4 arrangements ID: [CD02]

Let Bob be in Seat 1, and then number the seats from 1 through 7 going clockwise, so that Ed is in Seat 3.
Seat 2 must be filled by someone who was not originally next to either Bob or Ed. The only person who satisfies
this is Guy, so Guy must sit in Position 2.
Cal and Dan were initially next to each other, so they must be separated. The possible pairs of nonadjacent
seats available to them are 4 and 6, 5 and 7, or 4 and 7.
Case 1: Cal and Dan sit in seats 4 and 6. Dan was originally next to Ed, so he can’t be in Seat 4; thus Cal is
in 4 and Dan is in 6. Hal and Fay remain; Hal can’t sit next to Bob in Seat 7, so he must be in 5, with Fay in
7. There is 1 arrangement here.
Case 2: Cal and Dan sit in seats 5 and 7. Cal was originally next to Bob, so he can’t be in Seat 7, and is thus
5 with Dan in 7. Fay must avoid Ed by choosing Seat 6, leaving Hal to take 4. 1 arrangement here.
Case 3: Cal and Dan sit in seats 4 and 7. We must have Cal in 4 and Dan in 7 to avoid conflicts with Bob
or Ed. Now Hal and Fay are left with seats 5 and 6 with no restrictions, so they can sit in either order. Thus
there are 2 possibilities here.
So we are left with a total of 4 possibilities.

7
(12) 30 ID: [5D121]
No solution is available at this time.

4 Copyright MATHCOUNTS Inc. All rights reserved

(13) 69 ID: [BD02]
First, recall that if the sum of the digits of a number is divisible by 9, then the number is also divisible by 9.
So, every time we hit an integer in this sequence that is divisible by 9, we can simply disregard all of its digits
as we continue building to the next integer. For instance, after a3 = 135, we start again, considering 7, 79,
7911. 7911 is divisible by 9, so we move on to 13, 1315, 131517. 131517 is divisible by 9, so we start again with
19, 1921, 192123. Notice that every third term is divisible by 9. Continuing in such a manner will reveal that
m must be 69 .

(14) 8 ID: [51B4]

Make a list of the two-digit multiples of 19 and 31: 19, 31, 38, 57, 62, 76, 93, and 95. If we build the string
from the beginning, we have different possibilities to check. For example, the second digit is 9, but the third
digit could be 3 or 5. However, no units digit appears more than once, so if we build the string in reverse then
the order is determined. If the 2002nd digit is 9, then the 2001st digit is 1, the 2000th digit is 3, the 1999th
digit is 9, etc. Therefore, the first digit would be 9. So if the first digit is 1, then the final digit cannot be 9. If
the 2002nd digit is 8, the the 2001st digit is 3, the 2000th digit is 9, the 1999th digit is 1, the 1998th digit is
3, etc. In this case, the first digit is 1, so the maximum possible last digit is 8 .

(15) 41/60 ID: [53A21]

No solution is available at this time.

5
(16) 23 ID: [45315]
No solution is available at this time.

5 Copyright MATHCOUNTS Inc. All rights reserved

(17) 37 lines ID: [5C551]
Since all of the lines pass through the same point, they can be distinguished by their slopes. The slope may be
0, 1, undefined, or any fraction of the form m n where m and n are distinct elements of the set {1, 2, 3, . . . , 7}.
There are 7 × 6 = 42 ways to choose a numerator m and denominator n from {1, 2, 3, . . . , 7}, and we can count
the number of distinct fractions if we subtract those for which m n reduces. We find 3 · 2 fractions that reduce
by taking the numerator and denominator from the set {2, 4, 6}. Also, the fractions 63 and 36 reduce. These are
all the fractions that reduce, because a common factor of two distinct positive integers less than 8 must cannot
be greater than 3. In total, there are 42 − 6 − 2 = 34 slopes of the form m
n with m and n distinct and positive.
Including the slopes 0, 1, and undefined, there are a total of 37 slopes.

6 Copyright MATHCOUNTS Inc. All rights reserved

(18) 4 points ID: [D0B4]
Let A be (−5, 0), let B be (5, 0), and let C be (a, b). If a2 + b2 = 25, then C lies on the circle of radius 5
centered at the origin. To find the area of triangle ABC, we can let the base be AB and the height be the
distance from (a, b) to the x-axis, which is |b|. We find
1
10|b| = 10 =⇒ |b| = 2
2
The lines y = 2 and y = −2 both intersect the circle at two distinct points. So the number of possible locations
for C is 4 .

y=2

y = −2

(19) 25 integers ID: [2A02]

Since n has the same remainder whether divided by 6 or by 8, we can write that n = 6a + r = 8b + r, where
0 ≤ r ≤ 5. This implies that 3a = 4b, and so a is a multiple of 4 and we can write a = 4k for some integer k.
Since 100 < n < 200, we see that 95 < 6a < 200, or 95 200
24 < k < 24 . Since k is an integer, 4 ≤ k ≤ 8. If k = 4,
then we must have r = 5. Otherwise, r = 0, 1, 2, 3, 4, 5 are all allowable. Thus we have a total of 25 possible
values for n.

(20) 118 integers ID: [A0C1]

If the units digit is a 0, then the only two cases are that the 0 is the repeated digit, in which case the tens digit
must be 0 and the hundreds digit can be 1 through 9, or the first two digits are the repeated ones, of which
there are also 9 choices. Now, if the units digit is any even digit of the set {2, 4, 6, 8}, then the situation is
different. If the repeated digit is to be the units digit, it can be repeated in the hundreds digit, in which case
there are 9 choices of tens digit, or it can be repeated in the tens digit, in which case there are 8 choices of
hundreds digit. Or, if the first two digits are the repeated ones, they can be any of 1 through 9 excluding the
even units digit, for a total of 8. So, for each of 2, 4, 6 and 8, there are 9 + 8 + 8 = 25. So, the total number is
2 · 9 + 4 · 25 = 118 .

(21) 240 ID: [55B01]

No solution is available at this time.

7 Copyright MATHCOUNTS Inc. All rights reserved

(22) 1/8 ID: [B0D01]
Since 1000 is divisible by 8, the last three digits determine whether the number is divisible by 8. The possible
combinations for the last three digits are the triples of the form (a, b, c) where a, b, and c are integers between
1 and 6 inclusive. Since each triple is equally likely, we want to count the number of them for which the
three-digit integer abc is divisible by 8.
Arrange the triples in a 3-dimensional array where the x, y, and z coordinates of (a, b, c) are a, b, and c,
respectively. Consider a 1 × 1 × 1 cube within this array, as shown.

Let r be the remainder when the three-digit number abc is divided by 8. Then the remainder when the number
whose digits are a, b + 1, and c is divided by 8 is r + 2, since 100a + 10(b + 1) + c is 10 more than 100a + 10b + c.
Similarly, adding 100 is equivalent to adding 4 to the remainder when dividing by 8. The remainders of all 8
numbers in the 1 × 1 × 1 cube can be calculated by moving along the edges of the cube and adding 1, 2, or 4
each time. The results are shown in the figure.

For any value of r, all 8 remainders are represented in this diagram. In particular, every 2 × 2 × 2 cube contains
exactly 1 multiple of 8. Since the original 6 × 6 × 6 cube can be decomposed into 27 1 × 1 × 1 cubes, there are
27 multiples of 8 among the 63 three-digit numbers of the form abc where 1 ≤ a, b, c ≤ 6. Since each number
27 1
is equally likely to be rolled, the probability of rolling a multiple of 8 is 3 = .
6 8
(Note: It is understood in the discussion of remainders that if a “remainder” greater than 7 is obtained, it is
decreased by 8. So, for example, if abc leaves a remainder of 7 when divided by 8, then the number whose
digits are a + 1, b, and c leaves a remainder of 7 + 4 − 8 = 3, not 7 + 4 = 11, when divided by 8.)

8 Copyright MATHCOUNTS Inc. All rights reserved

(23) 26 ID: [0C322]
Define A to be 1 × 3 × 5 × . . . × 97 × 99, and let t be the exponent of 3 in the prime factorization of A. Because
3n is a factor of A if and only if n ≤ t, the maximum possible value of n is t. Since A is written as a product of
integers, we can find t by summing the exponents of 3 in the prime factorizations of the numbers 3, 5, 7, . . . , 99.
The dots shown in columns in the following diagram indicate the number of factors of 3 of each odd number
between 3 and 99. (Non-multiples of 3 are omitted.)

3 9 15 21 27 33 39 45 51 57 63 69 75 81 87 93 99

We count the dots in this diagram by rows. In the bottom row, each the 17 numbers 3, 9, 15, . . . , 99 gives one
factor of 3. In the second row, the 6 multiples of 32 each give one additional factor of 3. The multiples 27 and 81
of 33 each provide one more factor of 3, and 81 = 34 gives the last factor of 3 for a total of 17 + 6 + 2 + 1 = 26
factors of 3.

(24) 7 ID: [40B4]

Write each factorial as a product of integers, cancel, and regroup. We get
10 · 9 · 8 · 7 · 6 · 5 · 4 · 3 · 2
n! =
3·2·5·4·3·2
= 10 · 9 · 8 · 7
= (2 · 5)(3 · 3)(2 · 2 · 2)(7)
= (2 · 5)(3)(2 · 2)(7)(6)
= (2)(3)(2 · 2)(7)(6)(5)
= (2)(3)(7)(6)(5)(4)
= (7)(6)(5)(4)(3)(2),

so n = 7 .

9 Copyright MATHCOUNTS Inc. All rights reserved

(25) 4 ID: [B4141]
Each number in Pascal’s triangle is the sum of the two numbers above it. If we use 0’s and 1’s to stand for ”even”
and ”odd”, then by using the rules 0+0 = 0, 0+1 = 1, and 1+1 = 0, we can efficiently compute the parity (even-
1
1 1
1 0 1
1 1 1 1
1 0 0 0 1
1 1 0 0 1 1
1 0 1 0 1 0 1
1 1 1 1 1 1 1 1
1 0 0 0 0 0 0 0 1
1 1 0 0 0 0 0 0 1 1
or oddness) of the entries without computing the entries themselves: 1 0 1 0 0 0 0 0 1 0 1
1 1 1 1 0 0 0 0 1 1 1 1
1 0 0 0 1 0 0 0 1 0 0 0 1
1 1 0 0 1 1 0 0 1 1 0 0 1 1
1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1
1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1
1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1
1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1
1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1
1
1 1
1 1
1 1 1 1
1 1
1 1 1 1
1 1 1 1
1 1 1 1 1 1 1 1
1 1
1 1 1 1
There’s an interesting pattern here! It’s clearer if we don’t write the 0’s : 1 1 1 1
1 1 1 1 1 1 1 1
1 1 1 1
1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1
1 1 1 1
1 1 1 1
1 1 1 1 1 1 1 1
1 1 1 1
Anyway, this table shows that there are four rows that qualify: the 2nd , 4th , 8th , and 16th rows. So the answer
is 4 .

10 Copyright MATHCOUNTS Inc. All rights reserved

(26) 1/7 ID: [D1B4]

3
For Manu to win on his first turn, the sequence of flips would have to be TTH, which has probability 21 .
For Manu to win on his second turn, the sequence of flips would have to be TTTTTH, which has probability
1 6 1 3n



2 . Continuing, we find that the probability that Manu wins on his nth turn is 2 . The probability that
Manu wins is the sum of these probabilities, which is
1
1 1 1 23
+ + + · · · = = 1/7 ,
23 26 29 1 − 213

where we have used the formula a/(1 − r) for the sum of an infinite geometric series whose first term is a and
whose common ratio is r.

(27) 64/125 ID: [15B01]

No solution is available at this time.

(28) 13/20 ID: [B0A01]

No solution is available at this time.

(29) 1/128 ID: [B0B4]

The only way for the Dora to end up at her starting point in four steps is for her to traverse the four sides of
the gray square. She can do this in two ways: clockwise and counterclockwise. The probability of each of these

4 1 1 1
two paths is 14 = 2561
. Therefore, the probability that she ends up where she started is + = .
256 256 128

(30) 7/72 ID: [1D414]

We can also use a sticks and stones method to find the combination of three number from 1 to 6 that sum up
to 8. We can let the groups of stones represent the number on the dice and the sticks represent the separation
of the stones into three groups (three dice rolls). Since each roll must be at least 1 and at most 6, the two bars
can fall only in the following spaces:
⋆ ⋆ ⋆ ⋆ ⋆ ⋆ ⋆ ⋆
This give us 72 = 21 ways to arrange the sticks and stones.

Since there are 6 possible numbers that could come up on each roll, there are 63 = 216 possible combinations
21 7
of three rolls. This gives us a probability of 216 = ways to roll a sum of 8 from three rolls.
72

11 Copyright MATHCOUNTS Inc. All rights reserved