If a finite number of rectangles, every one of which has at least one integer side, perfectly tile a big rectangle, then the big rectangle also has at least one integer side. I present two proofs of this theorem, both accessible to a ten-year-old. The proofs generalize to other situations.
[Also, a one-page introduction to this problem is here: (pdf) (postscript)]
All postscript files are compressed with gzip - see this page for advice about gzip, if needed.