0

Guest

Courses New

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.

Grade:10

3 Answers

Arun
25750 Points
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)!
Sayantan Garai
117 Points
4 years ago
But the answer given is (n+k) Ck.
 
 
 
...................??..??....?.???!! /?.................).. C...... 
Arun
25750 Points
4 years ago
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

Think You Can Provide A Better Answer ?

Other Related Questions on Discuss with Askiitians Tutors

View all Questions »

ASK QUESTION

Get your questions answered by the expert for free

Answer and earn gift vouchers

Win Gift vouchers upto Rs 500/-

View courses by askIITians

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

Click Here Know More

Complete Self Study Package designed by Industry Leading Experts

Click Here Know More

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

Click Here Know More

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

Click Here Know More