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?
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.
The only place they can meet is the 9 points along the top-left to bottom-right diagonal. It takes 8 steps for both of them. [ ( 8 0 ) 2 + ( 8 1 ) 2 + ( 8 2 ) 2 + ( 8 3 ) 2 ] × 2 + ( 8 4 ) 2 = 1 2 8 7 0
Using concept of relative motion, the top insect would have to cover (8,8) distance . Therefore ,arranging VVVVVVVV HHHHHHHH
where v=vertical step and h = horizontal step . The arrangement can be done in 16C8 ways ie 12870.
Problem Loading...
Note Loading...
Set Loading...
Reverse the path of the second ant. Now the two paths together form a path from I1 to I2 where you only move up or right. This is a standard problem; 8 steps up and 8 steps right gives ( 8 8 + 8 ) = 1 2 8 7 0 paths.