A probability problem by Felipe Sadoyama
Jonh has to go from point A to point B. How many possible ways he could get to point B knowing that he can only go right and up?
Note: he can only move through the back lines.
Note²: Every square counts as 1 move
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.
0 solutions
No explanations have been posted yet. Check back later!