every synogon can be broken down into a finite number of rhombuses
Source: 8th QEDMO problem 6 (15. 1. 2011) https://artofproblemsolving.com/community/c1512515_qedmo_200507
May 15, 2021
combinatorial geometrygeometrycombinatorics
Problem Statement
A synogon is a convex -gon with all sides of the same length and all opposite sides are parallel. Show that every synogon can be broken down into a finite number of rhombuses.