Problem

Source: 2011 Saudi Arabia Pre-TST November 3.2 https://artofproblemsolving.com/community/c2745403_2011_

Tags: combinatorial geometry, geometry, cyclic quadrilateral



Prove that for each $n \ge 4$ a parallelogram can be dissected in $n$ cyclic quadrilaterals.