Click to Chat
1800-1023-196
+91-120-4616500
CART 0
Use Coupon: CART20 and get 20% off on all online Study Material
Welcome User
OR
LOGIN
Complete Your Registration (Step 2 of 2 )
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.
Dear student As there are n squares from North to southAnd 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)!
But the answer given is (n+k) Ck. ...................??..??....?.???!! /?.................).. C......
Oh sorry We count from 0.Hence (n+k)!/ n! k!Or we can also say n+kCk or n+kCn. Hope now you understand
Post Question
Dear , Preparing for entrance exams? Register yourself for the free demo class from askiitians.
points won -