AMC 8 · 2018 · #19

Easy mode Grade 4
📗 View original problem →

Problem

Picture a pyramid made of boxes. The bottom row has 44 boxes. The next row up has 33 boxes, sitting on top of the gaps. Then a row of 22, and one box at the very top.

Every box holds either a "+" or a "-".

Here is the rule for the upper rows. Look at any box that is not on the bottom. It sits on top of two boxes from the row below.

  • If those two boxes below match (both "+" or both "-"), this box gets a "+".
  • If those two boxes below do not match (one "+" and one "-"), this box gets a "-".

(The diagram below shows one example of the pyramid filled in.)

You get to choose the 44 signs in the bottom row. Once they are chosen, every other box is forced by the rule.

How many different ways can you fill the bottom row so that the box at the very top ends up as a "+"?

Pick an answer.

(A)
2
(B)
4
(C)
8
(D)
12
(E)
16

AMC 8 2018 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.

Try it yourself first — the explanation is most useful after you’ve attempted it.