Skip to main content

2024 AMC 12A Problem 22

Problem 22 of 25HarderCounting & Probability

The figure below shows a dotted grid 88 cells wide and 33 cells tall consisting of 1×11''\times1'' squares. Carl places 11-inch toothpicks along some of the sides of the squares to create a closed loop that does not intersect itself. The numbers in the cells indicate the number of sides of that square that are to be covered by toothpicks, and any number of toothpicks are allowed if no number is written. In how many ways can Carl place the toothpicks? A dotted grid 8 cells wide and 3 cells tall, with a 1 written in each cell of the middle row.

Answer choices

Show solution

Solution

Each middle-row cell must touch exactly one toothpick. First consider loops that pass from one side of the middle strip to the other. The loop can span all 88 columns, the first 7,7, the last 7,7, or the middle 6;6; a narrower span would leave an outer middle cell untouched. Once the two ends are fixed, each interior middle cell independently has its one toothpick on its top or bottom side, and the rest of the non-self-intersecting loop is forced. The four cases therefore contribute 26,25,25,2^6,2^5,2^5, and 242^4 loops. There are also exactly two loops that do not cross the middle strip: the horizontal rectangle running entirely along the top or entirely along the bottom. Hence the total is 26+25+25+24+22^6+2^5+2^5+2^4+2 =64+32+32+16+2=64+32+32+16+2 =146.=146. Thus, the correct answer is C.

More practice

Concepts: graph theory · casework

Problem text and solution from the LIVE past-contest archive. See also the AoPS wiki page for community solutions.