Answer Sheet

Number Answer Problem ID

1 19 A354D
2 31 4D02
3 9 natural numbers 50B4
4 2 BB501
5 155 525D1
6 7 divisors 20B4
7 45 C25D1
8 3 C3A4
9 1/3 C0A01
10 55 C4CC2
11 722 45B01
12 14 B5B01
13 5 01A01
14 16 31531
15 6 balls 0DCC2
16 5/8 A0514
17 402 00A01
211
18 36 335D1
19 53 10C1
20 332 B5B11
21 32 A4B01
22 9 (base 10) 1DB44
23 75 4454D
24 8775 AC424
25 28 integers 2A422
26 3 425D1
27 61 C0B4
28 120 3D02
29 20 4A501
30 225 numbers 42514

1 Copyright MATHCOUNTS Inc. All rights reserved

 Solutions

(1) 19 ID: [A354D]

No solution is available at this time.

(2) 31 ID: [4D02]

Since a, b, c are consecutive integers, we have that a = b − 1 and c = b + 1. So a + b + c = 3b. Thus the given
equation becomes abc 3b = 341, or ac = 31 · 33. So c = 33 and a = 31 .

(3) 9 natural numbers ID: [50B4]

The only way for the product of the distinct prime factors of a number to be 6 is for the number to be of the
form 2a · 3b for a ≥ 1 and b ≥ 1. By considering each value of a separately, we will count the number of ordered
pairs (a, b) for which 2a · 3b < 100. If a = 1, then b could be 1, 2, or 3. If a = 2 or 3, then b could be 1 or 2. If
a = 4 or 5, then b equals 1. Altogether, there are 3 + 4 + 2 = 9 natural numbers less than 100 the product of
whose distinct prime factors is 6.

(4) 2 ID: [BB501]

The expression 2n − 1 is odd for every integer n, and conversely every odd integer takes the form 2n − 1 for
some integer n. Therefore, there is one solution n for each (not necessarily positive) odd divisor of 20. The
positive odd divisors of 20 are 1 and 5, so we solve 2n − 1 = −5, 2n − 1 = −1, 2n − 1 = 1, and 2n − 1 = 5 to
find the solutions n = −2, n = 0, n = 1, and n = 3. These values for n sum to 2 .

(5) 155 ID: [525D1]

Since n must be prime, we start with the smallest prime and work our way up:
When n = 2, we have 22 − 2 − 1 = 1 which is not composite.
When n = 3, we have 32 − 3 − 1 = 5 which is not composite.
When n = 5, we have 52 − 5 − 1 = 19 which is not composite.
When n = 7, we have 72 − 7 − 1 = 41 which is not composite.
When n = 11, we have 112 − 11 − 1 = 109 which is not composite.
When n = 13, we have 132 − 13 − 1 = 155 = 5 · 31 which is composite.
Therefore our answer is 155 .

(6) 7 divisors ID: [20B4]

Suppose that d divides 8! and that d > 7!. Taking the reciprocal of both sides of d > 7! and multiplying by 8!,
we find 8! 8! 8!
d < 7! = 8. There are 7 positive integers less than 8, and d can be chosen so that d takes on any of
these values, since 8!
d ranges over all the divisors of 8! as d ranges over the divisors of 8!. Therefore, 7 divisors
of 8! are greater than 7!.

2 Copyright MATHCOUNTS Inc. All rights reserved

 (7) 45 ID: [C25D1]
We first note that any set of 5 consecutive odd integers can be written as n − 4, n − 2, n, n + 2, n + 4 where n
is an odd integer. The sum of these is just 5n, so we’re looking for the smallest odd value of n such the 5n is
a perfect square. If 5n is a perfect square, then n = 5k 2 for some integer k. When k = 1 we get the quintuple
given in the problem statement and when k = 2 we get an even value of n, but when k = 3 we get that n = 45,
which gives us the quintuple 41, 43, 45, 47, 49. The sum of

(8) 3 ID: [C3A4]

The units digit of a positive integer when expressed in base 6 is the same as the remainder when the integer is
divided by 6. For example, the number 15026 is equal to 1 · 63 + 5 · 62 + 0 · 6 + 2, and 6 divides every term except
the units digit, 2. When 217 is divided by 6, the remainder is 1. When 45 is divided by 6, the remainder is 3.
Therefore, the product of 217 and 45 has a remainder of 1 · 3 = 3 when divided by 6.

(9) 1/3 ID: [C0A01]

No solution is available at this time.

(10) 55 ID: [C4CC2]

Let us write out the prime factorizations of each term of the sequence. We have:

2 = 21 · 30
6 = 21 · 31
12 = 22 · 31
72 = 23 · 32 .

Notice that the exponent of the power of 2 on each term is equal to the sum of the exponents of the power of
2 on the previous two terms, and similarly for 3. Indeed, if two consecutive terms of the sequence are given by
2e2 · 3e3 and 2f2 · 3f3 , then their product is 2e2 +f2 · 3e3 +f3 . It follows that the exponents of the 2 and 3 satisfy the
Fibonacci sequence. After inspection, the ninth term is equal to 2F9 · 3F8 , where we calculate F9 = 34, F8 = 21.
Thus, the answer is 34 + 21 = 55 .

(11) 722 ID: [45B01]

No solution is available at this time.

(12) 14 ID: [B5B01]

No solution is available at this time.

(13) 5 ID: [01A01]

The first 10 terms of any arithmetic sequence can be represented as x, x + c, x + 2c, . . . x + 9c, where x is the
first term and c is the constant difference between each consecutive term. So, the sum of all of these terms will
include 10x and (1 + 2 + . . . + 9)c, which equals 45c. As a result, the sum of all the terms is 10x + 45c and the
greatest number we can factor out is 5 , where we end up with 5(2x + 9c).

3 Copyright MATHCOUNTS Inc. All rights reserved

(14) 16 ID: [31531]
No solution is available at this time.

(15) 6 balls ID: [0DCC2]

After trying the first few steps, we notice that the boxes resemble the set of positive integers in quinary (base
5). In particular, the first box corresponds to the units digit, the second corresponds to the fives digit, and so
forth. An empty box corresponds to the digit 0 and a box with k balls, 1 ≤ k ≤ 4 corresponds to the digit k.
We need to verify that this is true. On the first step, the boxes represent the number 1. For the nth step,
suppose that the units digit of n in quinary is not equal to 4, so that the first box is not full. The operation
of adding 1 in quinary simply increments the units digit of n by 1. Indeed, Mady performs the corresponding
operation by adding a ball to the first box. Otherwise, if the units digit of n in quinary is equal to 4, suppose
that the rightmost m consecutive quinary digits of n are equal to 4. Then, adding 1 to n entails carrying over
multiple times, so that the m + 1th digit will be incremented once and the other m digits will become zero.
Mady does the same: she places a ball in the first available box (the m + 1th), and empties all of the previous
boxes.
It follows that the number of filled boxes on the 2010th step is just the sum of the digits in the quinary
expression for 2010. Converting this to quinary, the largest power of 5 less than 2010 is 54 = 625, and that
3 < 2010/625 < 4. Then, 2010 − 3 · 625 = 135. Repeating this step, we find that

2010 = 3 · 54 + 1 · 53 + 2 · 51 ,

so the desired answer is 3 + 1 + 2 = 6 .

(16) 5/8 ID: [A0514]

First, we expand the base-three repeating decimal a series of base-ten fractions. As the base-three decimal
repeats every two digits, we will combine them in pairs.

0.123 = 1 · 3−1 + 2 · 3−2 + 1 · 3−3 + 2 · 3−4 + · · ·

1 2 1 2
= + + + + ···
3 9 27 81
3+2 3+2
= + + ···
9 81
5
This is an infinite geometric series with first term 9 and common ratio 91 . This sums to
5
9 5 9 5
1 = · = .
1− 9
9 8 8

(17) 402 ID: [00A01]

No solution is available at this time.

4 Copyright MATHCOUNTS Inc. All rights reserved

 211
(18) 36 ID: [335D1]
b c
We rewrite 1 12 as 32 and use the fact that a −c



b = a . Our sum is then
 2  2
2 2 3 3 4 2 3 9
+ +1+ + = + +1+ + .
3 3 2 2 9 3 2 4

Since we have fractions with denominators of 4 and 9, we multiply each fraction as necessary to put everything
16
over a common denominator of 4 · 9 = 36. This leaves our sum as 36 + 24 36 54 81
36 + 36 + 36 + 36 , which simplifies our
211
final answer of .
36

(19) 53 ID: [10C1]

The positive integers with exactly four positive factors can be written in the form pq, where p and q are distinct
prime numbers, or p3 , where p is a prime number.
Using this, we can see that the smallest five positive integers with exactly four positive factors are 2 · 3 = 6,
23 = 8, 2 · 5 = 10, 2 · 7 = 14, and 3 · 5 = 15. Summing these numbers, we get 6 + 8 + 10 + 14 + 15 = 53 .

(20) 332 ID: [B5B11]

No solution is available at this time.

(21) 32 ID: [A4B01]

No solution is available at this time.

(22) 9 (base 10) ID: [1DB44]

A number ABCb , where A, B, C are digits in base b, equals A(b2 )+B(b)+C in base 10. Using this information,
we write the equations for the two conditions:

441b = 4b2 + 4b + 1 = n2
351b = 3b2 + 5b + 1 = (n − 2)2

The first equation can be factored, so (2b + 1)2 = n2 , and thus 2b + 1 = n.

Plugging this into the second equation, we get that (n − 2)2 = (2b − 1)2 = 4b2 − 4b + 1.
So 3b2 + 5b + 1 = 4b2 − 4b + 1, and −b2 + 9b = 0.
The solutions to this are b = 0, b = 9, but b = 0 is impossible. Therefore, b = 9 .

(23) 75 ID: [4454D]

No solution is available at this time.

5 Copyright MATHCOUNTS Inc. All rights reserved

(24) 8775 ID: [AC424]
n(n+1)
The nth triangular number is given by the formula 2 . Thus, the members of the sequence are the values
n(n+1)
n(n+1)
of 2
7 = 14 that are integers since multiplying this expression by 7 always yields a triangular number.
n(n+1)
If 14 is an integer, then n(n + 1) must be divisible by 14. This in turn means that n(n + 1) has factors of 2
and 7. Note that we know it has a factor of 2 since it is the product of two consecutive numbers: one must be
odd and the other must be even, which has a factor of 2. Therefore, we only need to consider when n(n + 1)
has a factor of 7. For the first few terms, we can let n = 6, 7, 13, 14, 20, 21, . . . (either n is a multiple of 7 or is
one less than a multiple of 7). These values of n do indeed give us 3, 4, 13, 15, 30, 33, . . . when plugged into the
formula for each term, n(n+1)
14 .
We now examine the values of n, which have a more recognizable pattern than the sequence explicitly given in
the problem. Every second term in the sequence for n is a multiple of 7. The 100th term is n = 7 · 100
2 = 350.
350(351)
Plugging this into the formula for the sequence given in the problem, n(n+1)
14 = 14 = 8775 .

(25) 28 integers ID: [2A422]

The one-digit prime numbers are 2, 3, 5, and 7. A number is divisible by 3 if and only if the sum of its digits
is divisible by 3. So we want to count the number of ways we can pick three or fewer of these digits that add
up to a multiple of 3 and form a number with them. We will use modular arithmetic. Of our allowable digits,
3 ≡ 0, 7 ≡ 1, 2 ≡ 2 (mod 3), and 5 ≡ 2 (mod 3). The ways to add up 3 or fewer numbers to get 0 modulo 3
are shown:
1. 0
2. 0 + 0
3. 1 + 2
4. 0 + 0 + 0
5. 1 + 1 + 1
6. 2 + 2 + 2
7. 0 + 1 + 2
We will count the number of 3-primable integers each case produces:
1. There is 1 number, 3.
2. There is 1 number, 33.
3. One of the digits is 7, and the other digit is either 2 or 5. So there are 2 choices for this digit, and once the
digit is chosen, there are 2 ways to arrange the digits of the 3-primable number (for example, if we choose the
digit 2, then we could either have 72 or 27). So there are (2)(2) = 4 numbers in this case.
4. There is 1 number, 333.
5. There is 1 number, 777.
6. Each of the three digits is either 2 or 5. This gives 23 = 8 numbers.
7. One of the digits is 3, one of the digits is 7, and the other digit is either 2 or 5. Once we choose either 2
or 5, there are 3! = 6 ways to arrange the digits of the 3-primable number. So there are 2(6) = 12 numbers in
this case.
So in total, our answer is 1 + 1 + 4 + 1 + 1 + 8 + 12 = 28 .

6 Copyright MATHCOUNTS Inc. All rights reserved

(26) 3 ID: [425D1]
We first consider the units digit of the sum of all numbers between 100 and 199. For each digit d, 0 ≤ d ≤ 9,
there will be exactly 10 numbers in that range that end in d. When we add all 10 of those numbers to our sum,
the effect on the units digit is the same as adding d 10 times or just adding 10d once. Since d is an integer, 10d
ends in 0, so adding all ten of the integers ending in d has no effect on the unit digit of the sum. Applying this
logic to all 10 values of d gives us that adding all of the numbers between 100 and 199 to something doesn’t
change the units digit. This means that the units digit of the sum of the integers between 100 and 202 is the
same as the units digit of the sum of 200, 201, and 202, which is clearly just 3 .

(27) 61 ID: [C0B4]

Factor out 12! from both terms: 12! + 14! = 12!(1 + 13 · 14) = 12! · 183. Factor 183 = 3 · 61. Since 12! has no
prime factors greater than 11, 61 is the greatest prime factor of 12! + 14!.

(28) 120 ID: [3D02]

Call Jan’s number J. 12 = 22 · 3 and 15 = 3 · 5, so J has at least two factors of 2, one factor of 3, and one
factor of 5 in its prime factorization. If J has exactly two factors of 2, then the prime factorization of J is of
the form 22 · 3a · 5b · · · . Counting the number of positive factors of this yields (2 + 1)(a + 1)(b + 1) · · · = 3k,
where k is some integer. But we know J has 16 factors, and since 16 is not divisible by 3, 16 ̸= 3k for any
integer k. So J cannot have exactly two factors of 2, so it must have at least 3. This means that J is divisible
by 23 · 3 · 5 = 120. But 120 already has (3 + 1)(1 + 1)(1 + 1) = 16 factors, so J must be 120 (or else J would
have more than 16 factors).

(29) 20 ID: [4A501]

Produce an exhaustive list of the pairs of factors which multiply to give 60, as well as the sum and the
Factors Sum Difference
(1,60) 61 59
(2,30) 32 28
difference of each pair of factors. (3,20) 23 17 The only number which appears in both the
(4,15) 19 11
(5,12) 17 7
(6,10) 16 4
second column and the third column is 17. Therefore, (A, B) = (20, 3) and (C, D) = (5, 12) or (12, 5). In
particular, A = 20 .

(30) 225 numbers ID: [42514]

2 is the only even prime number. Consider the prime factorization 2a pb q c where p and q are prime numbers.
All of the positive factors of this number are of the form 2x py q z , where x is an integer 0 to a, inclusive; y is
drawn from 0 to b, and z is chosen from 0 to c.
If x = 0, the factor is odd. If x ≥ 1, the factor is even. So for the number to have an equal number of odd and
even factors, we must have a = 1 so that half the factors use x = 0 and the other half x = 1. This applies to
other numbers with a number of odd prime factors besides 2.
So we wish to count the even numbers from 100 to 1000, inclusive, that are not divisible by 4. The even
numbers are 100, 102, 104, . . . , 1000, of which there are 451. Every other one, starting at 100, is a multiple of
4, so there are 226 multiples of 4 and 225 numbers divisible by 2 but not 4.

7 Copyright MATHCOUNTS Inc. All rights reserved