Two players take turns breaking a chacolate bar (rectangle-shaped consist of squares). The last to break a piece wins the game.
Design the strategy.
Each time the bar is broken, total number of pieces increase by 1. Suppose there’re even number of squares, 1st player wins regardless of breaking strategy. And vice versa.
75 teams took part in a competition where teams met 1-on-1. Each time the defeated team drops out.
How many meets are needed to before one team is declared a winner?
Each game will eliminate 1 game, so it needs 74 games.
Given a random number of items in a pile. Ask an audience to split a pile into two piles, multiply the numbers of items in the two new piles and keep adding the results. The process stops when there is no pile with more than 1 chip.
For example, let start with 9 chips:
|Piles||Which is broken||What's added||Total|
Before the audience told the final number, you immediately guess it’s 36. How did you do it?
The result does not depend on how the piles are split; but only on the initial size of the very first pile. Answer is always N(N - 1)/2.
This can be proved by mathematical induction.