cutting off parts that overlap from paper-made disks on a table
Source: Spanish Mathematical Olympiad 1995 P2
July 31, 2018
combinatoricsalgebra
Problem Statement
Several paper-made disks (not necessarily equal) are put on the table so that there is some overlapping, but no disk is entirely inside another. The parts that overlap are cut off and removed. Show that the remaining parts cannot be assembled so as to form different disks.