$\textbf{Tiger and Sheep}$
One hundred tigers and one sheep are put on a magic island where there is only grass. Tigers on this magic land can eat grass, but they would rather eat the sheep. However, upon having eaten the sheep, the tiger will become a sheep itself. If only one tiger can eat the sheep at any moment, what will happen? The assumption is that all the tigers are intelligent enough to secure their survival first and, if possible, eat the sheep.
$\textbf{Answer}$
Nothing will happen. The sheep will not be eaten.
$\textbf{Analysis}$
Let's, again, start with simpler situations.
Now, it is clear that the sheep is safe when the number of tigers is even and will be eaten when there are odd number of tigers.
$\textbf{Note}$
From the analysis, we can see that the simplest case of just $1$ tiger is easy to analyze. Then the case of $n \ge 2$ tigers can be derived from the previous case of $(n-1)$ tigers. By this way, we can find the answer for any number of tigers. This method is called induction which is a very important proof method in mathematics.