Problem

Source: MOP 2005 Homework - Blue Group #11

Tags: calculus, derivative, algebra, polynomial, combinatorics unsolved, combinatorics



Consider an infinite array of integers. Assume that each integer is equal to the sum of the integers immediately above and immediately to the left. Assume that there exists a row $R_0$ such that all the number in the row are positive. Denote by $R_1$ the row below row $R_0$, by $R_2$ the row below row $R_1$, and so on. Show that for each positive integer $n$, row $R_n$ cannot contain more than $n$ zeros.