## Problem of the Day #318: Pascal Paths
*January 31, 2012*

*Posted by Alex in : potd , trackback*

Albert starts at the top corner of Pascal’s triangle. At each step, Albert either goes down-left or down-right, eating each number he comes across. By the time Albert is at the $9^\text{th}$ row, $4^\text{th}$ column ($0$-indexed), what is the maximum possible total of the numbers Albert has eaten?

## Comments»

show