Problem #PRU-98016

Problems Methods Integer lattices Integer lattices (other) Order relations Pigeonhole principle Pigeonhole principle (other) Discrete Mathematics Combinatorics Set theory and logic

Problem

We are given 101 rectangles with integer-length sides that do not exceed 100.

Prove that amongst them there will be three rectangles \(A, B, C\), which will fit completely inside one another so that \(A \subset B \subset C\).