1997 AIME Problem 10

Below is the professionally curated solution for Problem 10 of the 1997 AIME, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 1997 AIME solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:counting pairsdouble counting

Difficulty rating: 2450

10.

Every card in a deck has a picture of one shape — circle, square, or triangle, which is painted in one of the three colors — red, blue, or green. Furthermore, each color is applied in one of three shades — light, medium, or dark. The deck has 2727 cards, with every shape-color-shade combination represented. A set of three cards from the deck is called complementary if all of the following statements are true:

• Either each of the three cards has a different shape or all three of the cards have the same shape.

• Either each of the three cards has a different color or all three of the cards have the same color.

• Either each of the three cards has a different shade or all three of the cards have the same shade.

How many different complementary three-card sets are there?

Solution:

Given any two distinct cards, there is exactly one card completing them to a complementary set: in each attribute, if the two cards agree, the third card must share that value, and if they differ, the third must take the one remaining value. The completing card is distinct from both (the two given cards differ somewhere, and in that attribute the third card differs from each).

So the (272)=351\binom{27}{2} = 351 pairs of cards each extend to one complementary set, and each complementary set is produced by (32)=3\binom{3}{2} = 3 of these pairs. The number of sets is 3513=117.\frac{351}{3} = 117.

← Problem 9Full ExamProblem 11

Problem 10 in Other Years