Problem: A given rectangle is tiled by smaller rectangles, and each of the smaller rectangles has a side of integer length. Show that the big rectangle has a side of integer length. I will discuss several elegant solutions to this problem and some generalizations. This talk is based on the paper 'Fourteen Proofs of a Result About Tiling a Rectangle' by Stan Wagon.