Consider an \(m\times n\) rectangular grid . Find the total number of paths one can reach from lower left corner to upper right corner .

Plz post ur method and other variations possible in such questions,

For example the number of shortest path possible from one corner to opposite corner is \(\frac{(m+n)!}{m!\times n!}\)

I dont know how to solve if its asked number of paths possible to reach from one corner to the corner above it.

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestAssume person starts from lower left corner. To take the shortest path, one can travel

only up or rightin each step. And there are of course, \(m+n\) steps to take. In the end, the person is at the top right corner, this means that he/she has traveled \(m\) units up and \(n\) units right. The order in which these steps were arranged is the thing that matters here and is the thing we have to count. Basically you need the coefficient of \(x^ny^m\) in \((x+y)^{m+n}\).Log in to reply

if total number of possible paths are asked then??

Log in to reply

Then the answer is infinite, as one can keep going in loops around the grid.

Log in to reply

Log in to reply

Log in to reply

Log in to reply

eg: if there are thirty vertical blocks and person can take three steps only, this is same as 10 vertical blocks when the person is taking one step each.

Log in to reply

Log in to reply

well this set helps a lot

Log in to reply

Yes, I saw that set.. My friend gave me similar qs.. so I din't go for solving them again.

Log in to reply

Can you add your explanation to Rectangular Grid Paths wiki? Thanks!

Log in to reply

it's infinite if you said all path. Obviously, because you told all possible paths, and you can return to a point you started, that makes number of possible paths infinite. What's wrong?

Log in to reply

I think this problem would be more interesting if it asked for the number of ways to reach the opposite square,

not being able to retrace your path, i.e. go on squares you have already been on.Log in to reply

right. I guess that's what meant

Log in to reply