in Combinatory
97 views
0 votes
0 votes
Use question $33$ to prove Theorem $4.$ [Hint: Count the number of paths with n steps of the type described in question $33.$ Every such path must end at one of the points $(n − k, k)\:\text{for}\: k = 0, 1, 2,\dots,n.]$
in Combinatory

Please log in or register to answer this question.

Related questions