An ant starts moving on the mesh shown below along the wires towards a food particle.If the ant is at the bottom-left corner of cell A and the food is at the top-right corner of cell F, then find the number of optimal routes for the ant.
(a) 13884156 (b) 3465280 (c) 4368 (d) 6748

• Its solution is 3465280.
  because the formula for this kind of problem is (m+n)!/m!*n!
  where m is the no of row and n is the no of column.
  Hence there are two diagram , 1st one have 12row and 5 column, so it is arranged 17!/(12!*5!)=6188
  but in 2nd diagram it is 13row and 3 column which is arranged 16!/(13!*3!)=560
  so total way is 6188*560=3465280
• 9 years agoHelpfull: Yes(19) No(1)
• diagram of mesh is not visible
• 9 years agoHelpfull: Yes(5) No(2)