Skip to main content
OlympiadHQ

Browse · MathNet

Print

Kanada 2011

Canada 2011 geometry

Problem

Amy has divided a square into finitely many white and red rectangles, each with sides parallel to the sides of the square. Within each white rectangle, she writes down its width divided by its height. Within each red rectangle, she writes down its height divided by its width. Finally, she calculates , the sum of these numbers. If the total area of the white rectangles equals the total area of the red rectangles, what is the smallest possible value of ?
Solution
Let and denote the width and height of each white rectangle, and let and denote the width and height of each red rectangle. Also, let denote the side length of the original square.

Lemma: Either or .

Proof of lemma: Suppose there exists a horizontal line across the square that is covered entirely with white rectangles. Then, the total width of these rectangles is at least , and the claim is proven. Otherwise, there is a red rectangle intersecting every horizontal line, and hence the total height of these rectangles is at least . □

Now, let us assume without loss of generality that . By the Cauchy-Schwarz inequality, But we know , so it follows that . Furthermore, each , so Therefore, is at least . Conversely, can be achieved by making the top half of the square one colour, and the bottom half the other colour. □
Final answer
2.5

Techniques

Optimization in geometryCauchy-Schwarz