Number of paths
Consider an equilateral triangle of side units, which is divided into unit triangles . Let be the number of paths from the triangle in the top row to the middle triangle in the bottom row such that adjacent triangles in the path share a common edge and the path never travels from a lower row to higher row or revisit a triangle . Then determine the value of .
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!