Problem

Source: Tournament of Towns 2016 Fall Tour, A Senior, Problem #5

Tags: combinatorial geometry, geometry, combinatorics



Is it possible to cut a square of side $1$ into two parts and rearrange them so that one can cover a circle having diameter greater than $1$? (Note: any circle with diameter greater than $1$ suffices) (A. Shapovalov) (Translated from here.)