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.