The fig shows an equilateral triangle of side length 5,which is divided into unit triangle. a valid path is a path from d triangle in d top row to the middle triangle in the bottom row, such that adjacent triangles in our path share a common edge and d path never travels up (from a lower row to a higher row) or revisites a triangle. An example of one such path is illustrated below……

How many valid path are there?
a)23
b)16
c)120
d)24

• there is a short trick for that always look in how many row the triangle has been cut off say "n" then the no. of ways=(n-1)! that why answer =(5-1)!=4!=24
  **note this trick work only when row are equidistant okay..
• 11 years agoHelpfull: Yes(9) No(0)
• Good job, anurag.
  u solved the puzzle without figure also.
• 11 years agoHelpfull: Yes(5) No(0)
• Ans. 24
  
  map the route from one triangle to other triangles .
  
• 11 years agoHelpfull: Yes(4) No(2)
• Anurag did u solve it before??? In this site their is some problem to provide fig..
• 11 years agoHelpfull: Yes(1) No(1)
• LENGTH=5
  VALID PATHS AVAILABLE = 1*2*3*4
  =24
• 8 years agoHelpfull: Yes(0) No(0)