26. (4%) Use generating functions to prove Pascal's identity:C(n,r)=C(n-1,r)+C(n-1,r-1) when na
問題詳情
26. (4%) Use generating functions to prove Pascal's identity:C(n,r)=C(n-1,r)+C(n-1,r-1) when nand r are positive integers with r < n.(Hint: Use the identity (1 +x)n=