A discrete mathematics problem by Mihir Mistry

On a normal chess board as shown, 'I1' and 'I2' are two ants which starts moving towards each other. Each ant moves with a constant speed. Insect 'I1' can move only to the right or upward along the lines while 'I2' can move only to the left or downwards along the lines of the chess board. What is the total number of ways the two ants can meet at same point during their trip?

×

Problem Loading...

Note Loading...

Set Loading...