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.

Question

Arun · Answer

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)!

Sayantan Garai · Answer

But the answer given is (n+k) C k. ...................??..??....?.???!! /?.................).. C......

Arun · Answer

Oh sorry We count from 0. Hence (n+k)!/ n! k! Or we can also say n+k C k or n+k Cn. Hope now you understand

Thank you for registering.

Register Now and Win Upto 25% Scholorship for a Full Academic Year !

Enter Your Details

Registration done!

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.

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.

3 Answers

Think You Can Provide A Better Answer ?

Provide a better Answer & Earn Cool Goodies See our forum point policy

Other Related Questions on Discuss with Askiitians Tutors

ASK QUESTION

Answer and earn gift vouchers

View courses by askIITians

Design classes One-on-One in your own way with Top IITians/Medical Professionals

Complete Self Study Package designed by Industry Leading Experts

Live 1-1 coding classes to unleash the Creator in your Child

a Complete All-in-One Study package Fully Loaded inside a Tablet!

Register Now & Win Upto 25% Scholorship