PLEASE do not copy an already posted answer!
4. Suppose southerly routes through Pascal's Triangle are forbidden to use the location (4,2), which is where there is normally a 6. Call paths that avoid this location allowable paths. (a). How many such allowable paths are there from the top down to the location (7,3), where the first 35 is normally written? (b). Give an expression for the number of allowable paths from the top (0,0) to any location (x, y).
PLEASE do not copy an already posted answer!
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
PLEASE do not copy an already posted answer!
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!