AMC 10 Step by Step

2010 AMC 10B Problem 18

P16-20~5 minPrint

Positive integers aa , bb , and cc are randomly and independently selected with replacement from the set {1,2,3,…,2010}\{1, 2, 3,\dots, 2010\} . What is the probability that abc+ab+aabc + ab + a is divisible by 33 ?

Log in to save your progress.
Show solution without answering

Key insight

Factor the expression as a times (bc + b + 1). It is a multiple of 3 when a is, or when bc + b + 1 is.

Solution

Whether a number is a multiple of 33 depends only on the remainders when you divide by 33. So think about remainders.

1. Factor. Every term has an aa, so
abc+ab+a=a(bc+b+1).abc + ab + a = a(bc + b + 1).
A product is a multiple of 33 exactly when one of its factors is (because 33 is prime).
2. Each remainder is equally likely. 2010=3⋅6702010 = 3 \cdot 670, so among 1,…,20101, \dots, 2010 exactly 670670 numbers leave remainder 00, 670670 leave remainder 11, and 670670 leave remainder 22. Each remainder has probability 13\frac13, separately for aa, bb and cc.
3. Case 1: aa is a multiple of 33. Probability 13\frac13. The whole expression is then a multiple of 33.
4. Case 2: aa is not a multiple of 33. Probability 23\frac23. Now we need bc+b+1bc + b + 1 to be a multiple of 33. Check all 99 pairs of remainders for bb and cc (only remainders matter):

bbccbc+b+1bc + b + 1Multiple of 33?
00any11no
110022no
111133yes
112244no
220033yes
221155no
222277no

Two of the 99 equally likely pairs work, so this has probability 29\frac29.
5. Add the two cases (they do not overlap):
13+23⋅29=927+427=1327.\frac13 + \frac23 \cdot \frac29 = \frac{9}{27} + \frac{4}{27} = \frac{13}{27}.

The answer is (E) 1327\boxed{\textbf{(E)}\ \dfrac{13}{27}}.

Why this works

Divisibility by 33 only cares about remainders, so a problem about 20102010 choices becomes a problem about 33 remainders. Factoring out the common aa splits the question into "is aa a multiple of 33?" and "is the other factor?". The number 20102010 matters only because it is a multiple of 33, which makes all three remainders equally likely.

Alternative approach

Count remainder triples. There are 3⋅3⋅3=273 \cdot 3 \cdot 3 = 27 equally likely choices of remainders for (a,b,c)(a, b, c).

  • aa has remainder 00: any bb and cc work, 99 triples.
  • aa has remainder 11 or 22: only the 22 good pairs from the table work, 2⋅2=42 \cdot 2 = 4 triples.

That is 9+4=139 + 4 = 13 good triples out of 2727, so the probability is 1327\frac{13}{27}.

Concise solution

A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.

Factor: abc+ab+a=a(bc+b+1)=a(b(c+1)+1)abc + ab + a = a(bc + b + 1) = a\big(b(c+1) + 1\big).

Because 2010=3⋅6702010 = 3 \cdot 670, each of a,b,ca, b, c is equally likely to be 0,10, 1, or 2(mod3)2 \pmod 3, independently.

The product is divisible by 33 if a≡0a \equiv 0, which has probability 13\frac13.

Otherwise (probability 23\frac23) we need b(c+1)+1≡0b(c+1) + 1 \equiv 0, i.e. b(c+1)≡2(mod3)b(c+1) \equiv 2 \pmod 3. The residue pairs (b,c+1)(b, c+1) with product 22 are (1,2)(1, 2) and (2,1)(2, 1); each pair occurs with probability 19\frac19, so this has probability 29\frac29.

Total:
13+23⋅29=927+427=1327.\frac13 + \frac23\cdot\frac29 = \frac{9}{27} + \frac{4}{27} = \frac{13}{27}.

The answer is (E) 1327\boxed{\textbf{(E)}\ \dfrac{13}{27}}.

Review in the AoPS books

Similar problems

Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.