0 votes 0 votes Use question $33$ to prove Pascal’s identity. [Hint: Show that a path of the type described in question $33$ from $(0, 0)\: \text{to}\: (n + 1 − k, k)$ passes through either $(n + 1 − k, k − 1)\: \text{or} \:(n − k, k),$ but not through both.] Combinatory kenneth-rosen discrete-mathematics counting binomial-theorem descriptive + – admin asked Apr 30, 2020 admin 218 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.