Number of Pathways

How many distinct paths consisting of steps only right or down are possible from P P to Q Q ?

3360 440 100 20

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

3 solutions

Tanay Gaurav
Dec 10, 2015

Solution:

Here we see that by travelling through any way, we have to take 3 horizontal and 3 vertical steps. So no of ways of arranging hhhvvv = (6!/3!3!) = 20 ways

But why did you take factorials?

jaskaran singh sodhi - 5 years, 5 months ago

Log in to reply

By the rule of permutation, number of ways of arranging n items out of which k and x items are similar is given by (n!/k!*x!). Please refer to 'pnc' for further reference.

tanay gaurav - 5 years, 5 months ago

thats right

Tanvir Mitul - 5 years, 4 months ago
Vijay Simha
Jan 14, 2016

What if this problem was modified to : How many distinct paths consisting of steps only right or down are possible from P to Q which are always below the diagonal PQ

In that case Catalan numbers come into play.

There are ( 6 3 ) = 20 \binom{6}{3} = 20 ways to arrive to Q from P ( just right and down steps)

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...