+0  
 
0
31
1
avatar

How many paths of minimum length are there from A to B in the grid below?
 

[asy] draw((3,3)--(0,0)--(3,-3));draw((5,3)--(8,0)--(5,-3));for(int i=0; i<3; i+=1){ draw((i+1,i+1)--(i+5,i-3));draw((i+1,-i-1)--(i+5,3-i));};dot((0,0)); dot((8,0));label(

 Dec 29, 2021
 #1
avatar
0

The number of minimal paths is \(\displaystyle \binom{4}{1} + \binom{4}{2} + \binom{4}{3} = 14\)

 Dec 30, 2021

14 Online Users

avatar