Want to take part in these discussions? Sign in if you have an account, or apply for one below
Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.
Created binomial theorem, and added a relevant lemma to freshman’s dream.
For the Pascal triangle recurrence to determine the binomial coefficients (nk) where n and k are integers, do we also need, for n a positive integer, the boundary condition (nn)=1?
Oh yes, that’s true, we do need another boundary condition to determine (xk), which can be expressed in any one of various ways, e.g., as (0k)=0 whenever k≠0. This is for both positive and negative integers k. Thanks.
1 to 3 of 3