by stupidityismygam » Tue Mar 25, 2008 5:49 pm
A triangular array of numbers has a first row consisting of the odd integers [unparseable or potentially dangerous latex formula] in increasing order. Each row below the first has one fewer entry than the row above it, and the bottom row has a single entry. Each entry in any row after the top row equals the sum of the two entries diagonally above it in the row immediately above it. How many entries in the array are multiples of [unparseable or potentially dangerous latex formula]?
my avatar is pretty awesome
tytia