This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: back, or there is another player thatis even farther away. In the first case, a tea party ensues, so consider the second case. Let us not the distance by d 1 . It is obvious that d < d 1 . The game continues in the same way, the distance reaching the value of d n . We can write d < d 1 < d 2 < . .. < d n . Imagine that this person throws the disk back to the King, then that person is at disance less than d from the King, since that is the distance to the farthest person from the King. But each new distance must be strictly greater than the last! So the King can never get the disk back again....
View Full Document
This note was uploaded on 03/01/2010 for the course MATH 301 taught by Professor Albertodelgado during the Spring '10 term at Bradley.
- Spring '10