IIT JEE , AIEEE Forum - Mathematics , Algebra

Mr.IITIAN007

There are n₁streets in a city running N-S and n₂ streets running E-W.Then

what is the number of ways in which a person can travel from one corner to the diagonally opposite corner through the

i)shortest possible distance ?

ii)longest possible distance?

avinash.sharma

Hello Mr.IITIAN007,

This question is same as http://www.goiit.com/posts/list/8316.htm

Please see the solution at the link provided above.