Mathematics Problem Of the Week

Fall 2007

POW #9

Meeting Ms. Pacman

Pacman is going to visit Ms. Pacman by walking along an nxn grid. He starts in the upper left corner and needs to travel to the lower right corner. Of course he wants to do this efficiently so, as he hits each intersection, he will either go down or to the right (on the page).

How many different paths could Pacman choose to make his journey? Justify your answer.

For example, a 2x2 grid offers six unique paths.

Due Friday, November 9^th at Noon.

Solutions should be submitted to Dr. R. Lock's mailbox in the Math/CS/Stat office or sent via e-mail to rlock@stlawu.edu.