If Anna only moves right or up or down, and isn't allowed to retrace her steps, how many ways does she have to get to Ben?
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.
I feel like this problems difficulty increased because of the orientation of the grid. the easy solution exists when you consider the problem as her moving left to right, opposed to up and down. if it was oriented as anna could move left and right and only down with the grid flipped into a 3X2 the answer would be more apparent
Log in to reply
However, the answers would be different in that case.
Log in to reply
the block arranged 3 long by 2 wide, the only difference would be the orientation. (at least my intent)
It's not a 3 by 4 block
I create my own formula:
(i=row; j=coloumn)
If the tiles are 1 x j then,
2 j
If the tiles are 2 x j then,
3 j
the conclusion is if the tiles are i x j so
( i + 1 ) j
So, 3 3 = 2 7
Can you explain how you arrived at that formula? Is there a simple way of reaching that conclusion?
It's incorrect....son numeros combinatorios (5 2)=5!/2!*(5-2)!=10
Problem Loading...
Note Loading...
Set Loading...
Consider the last three vertical roads. Anna can choose to enter each vertical road through one of three choices: either the top, middle, or bottom horizontal road.
So the answer is just 3 3 = 2 7 .