Check out the towers of hanoi puzzle. (http://www.superkids.com/aweb/tools/logic/towers/)

Prove carefully that to move $N$ discs from one peg to another takes AT LEAST $2^N-1$ moves, NO MATTER HOW YOU MOVE THE DISCS (so long as you never put a disc on top o f a smaller disk).