Recently, while playing with an integral of a probabilistic function possibly inspired by the binomial trees I’ve been reading about in financial mathematics books, I was attempting to find a closed form expression for the following recurrence relation:
Let ck(n), k, n = 0, 1, 2, …, satisfy
ck(n) = ck-1(n) + ck-1(n-k)
subject to the boundary conditions
c0(0) = 1 and c0(n) = 0 for all n=1, 2, … Read the rest of this entry »
Posted by Sacha