Problem

Source: Tournament of Towns 2007 - Fall - Senior O-Level - P1

Tags: combinatorics proposed, combinatorics



Pictures are taken of $100$ adults and $100$ children, with one adult and one child in each, the adult being the taller of the two. Each picture is reduced to $\frac 1k$ of its original size, where $k$ is a positive integer which may vary from picture to picture. Prove that it is possible to have the reduced image of each adult taller than the reduced image of every child.