AoPSWiki
Looking for a challenging algebra text? Preparing for MATHCOUNTS or the AMC exams?
Check out Art of Problem Solving's Introduction to Algebra by Richard Rusczyk.
Personal tools

2007 AIME II Problems/Problem 13

From AoPSWiki

Problem

A triangular array of squares has one square in the first row, two in the second, and in general, k squares in the kth row for 1 \leq k \leq 11. With the exception of the bottom row, each square rests on two squares in the row immediately below (illustrated in given diagram). In each square of the eleventh row, a 0 or a 1 is placed. Numbers are then placed into the other squares, with the entry for each square being the sum of the entries in the two squares below it. For how many initial distributions of 0's and 1's in the bottom row is the number in the top square a multiple of 3?

Image:2007 AIME II-13.png

Solution

Label each of the bottom squares as \displaystyle x_0, x_1 \ldots x_9, x_{10}.

Through induction, we can find that the top square is equal to {10\choose0}x_0 + {10\choose1}x_1 + {10\choose2}x_2 + \ldots {10\choose10}x_{10}.

Examine the equation \mod 3. All of the coefficients from \displaystyle x_2 \ldots x_8 will be multiples of 3 (since the numerator will have a 9). Thus, the expression boils down to x_0 + 10x_1 + 10x_9 + x_{10} \equiv 0 \mod 3. Reduce to find that x_0 + x_1 + x_9 + x_{10} \equiv 0 \mod 3. Out of x_0,\ x_1,\ x_9,\ x_{10}, either all are equal to 0, or three of them are equal to 1. This gives {4\choose0} + {4\choose3} = 1 + 4 = 5 possible combinations of numbers that work.

The seven terms from \displaystyle x_2 \ldots x_8 can assume either 0 or 1, giving us 2^7 possibilities. The answer is therefore 5 \cdot 2^7 = 640.

See also

2007 AIME II (ProblemsResources)
Preceded by
Problem 12
Followed by
Problem 14
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Try our innovative online adaptive learning system, Alcumus.
Over 1100 problems and 60+ video lessons. FREE!
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us