MathDB
Partition of rectangle

Source: 2016 All-Russian Olympiad,Problem 9.6

June 7, 2016
rectanglecombinatorics

Problem Statement

A square is partitioned in n24n^2\geq 4 rectanles using 2(n1)2(n-1) lines,n1n-1 of which,are parallel to the one side of the square,n1n-1 are parallel to the other side.Prove that we can choose 2n2n rectangles of the partition,such that,for each two of them,we can place the one inside the other (possibly with rotation).