On the normal chess board as shown, \( I_{1} \) and \( I_{2} \) are two insects which start moving towards each other; insect \(I_{1}\) at the bottom left corner and \(I_{2}\) at the top right corner. Each insect moves with the same constant speed. Insect \( I_{1} \) can move only to the right or upward along he lines while the insect \( I_{2} \) can move only to the left or downward along the lines of the chess board. the total number of ways the two insects can meet at same point during their trip is?
Problem Loading...
Note Loading...
Set Loading...
Easy Math Editor
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Sort by:
Top Newest12870
Log in to reply