The Pigeonhole Principle - Disk Coverings

In 1834, Johann Dirichlet noted that if there are five objects in four drawers then there is a drawer with two or more objects. The Schubfachprinzip, or drawer principle, got renamed as the pigeonhole principle, and became a powerful tool in mathematical proofs.
In this Demonstration, pigeons land in a park. If unit disks completely cover the park, then there must be a disk with two or more pigeons. These two pigeons must be within 2 units of each other. Move the disks to complete the proof.

Based in part on Erich's Packing Center: Covering
http://www.stetson.edu/~efriedma/packing.html.
comments
 
Powered by Wolfram Mathematica
Give us your feedback
Give us your feedback

Source page:




 often  occasionally  never

Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed.
Privacy Policy »

Note: To run this Demonstration you need the free
Mathematica Player
or Mathematica 7+
Download or upgrade to Mathematica Player 7
I already have Mathematica Player or Mathematica 7+