A rectangular city is divided by streets into squares. There are n such squares from north to south and k squares from east to west. Find the number of shortest walks from the north-eastern end of the city to the south-western end.
Sayantan Garai , 4 Years ago
Grade 10
3 Answers
Arun
Last Activity: 4 Years ago
Dear student
As there are n squares from North to south
And k squsres from East to west.
Hence there are n+1 and k+1 lines respectively.
Hence total required ways = (n+k+2)! /( n+1)! (k+1)!