olymmath

PAMO 2001 Problem 2

  • Day 1

Let nn be a positive integer. A child builds a wall along a line with nn identical cubes. He lays the first cube on the line and at each subsequent step, he lays the next cube either on the ground or on the top of another cube, so that it has a common face with the previous one. How many such distinct walls exist?

Dataset text AI-MO AoPS. Quoted with source.

Official text: Pan-African Mathematics Olympiad 2001 official paper, page 1.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator pamo/2001/p2 · Tag J8TVJ7EYQE · Edit this page on GitHub · Keys: j next, k previous