All Questions
1 question
3
votes
2
answers
106
views
Counting $10$ length paths in a $2 \times 4$ rectangle with distance $6$ units from start to end meaning negative moves allowed?
How many different routes of length 10 units (each side is 1 unit) are there to traverse from lower left corner (point A) to top right corner (point B) in a rectangle with 2 rows and 4 column cells ...