Sure, when you word it like that, it doesn’t sound very impressive, but you know how tricky these counting questions can be.

- Video Course
- Video Course Overview - READ FIRST
- General GMAT Strategies - 7 videos (all free)
- Data Sufficiency - 16 videos (all free)
- Arithmetic - 38 videos (some free)
- Powers and Roots - 36 videos (some free)
- Algebra and Equation Solving - 73 videos (some free)
- Word Problems - 48 videos (some free)
- Geometry - 42 videos (some free)
- Integer Properties - 38 videos (some free)
- Statistics - 20 videos (some free)
- Counting - 27 videos (some free)
- Probability - 23 videos (some free)
- Analytical Writing Assessment - 5 videos (all free)
- Reading Comprehension - 10 videos (all free)
- Critical Reasoning - 38 videos (some free)
- Sentence Correction - 70 videos (some free)
- Integrated Reasoning - 17 videos (some free)

- Study Guide
- Your Instructor
- Office Hours
- Extras
- Prices

## Comment on

Number of Routes## Is this kind of question

## This would be a valid GMAT

This would be a valid GMAT question on test day, although I wouldn't say that it's a "common" question type.

I should also note that this is a 700+ level question so, given the adaptive nature of the GMAT, the only students who would see a question like this would be those who are doing really well on the quant section.

## Hey Bret,

I dont quite understand why to use the Mississippi rule.

I thought in this question its about finding unique ways to arrange the letters and RRRRDDD is not the same as DDDRRRR for example. with using the mississippi rule, wouldnt be make them the same ?

## The MISSISSIPPI rule doesn't

The MISSISSIPPI rule doesn't treat RRRRDDD as the same as DDDRRRR.

## I tried solving a different

## If you try using that

If you try using that technique with a 2 by 2 grid, you'll find that it doesn't yield the correct answer either.

The problem is that each intersection isn't equal. For example, there's only 1 way to reach the intersection that's 1 block to the right of point A. However, there are 2 ways to reach the intersection that's diagonal from point A.

## Dear Brent, I solved this

- We have 7 spots of movement from A to B

- We only can use 2 movements (either right or down) in each spot.

- Therefore, we use FCP : 2 X 2 X 2 X 2 X 2 X 2 X 2, which is 128.

Can you please elaborate what is wrong with this approach?

## The problem with that

The problem with that solution is that there are situations in which we DON'T have two options (right or down)

To see what I mean, let's start at point A.

We have two directions to go (right or down).

Let's go DOWN

From here, we have two directions to go (right or down).

Let's go DOWN again

From here, we have two directions to go (right or down).

Let's go DOWN again

Now we're at the bottom left corner.

From here, we can go in only ONE direction: right

In fact, every move from that point on must be right.

## Ahhh I see. Well noted then.

## Add a comment