8.3

Part of 2000 All-Russian Olympiad Regional Round

Problems(1)

min n for n-gon, be cut into #s - All-Russian MO 2000 Regional (R4) 8.3

Source:

What is the smallest number of sides that an polygon can have (not necessarily convex), which can be cut into parallelograms?

combinatoricsgeometrycombinatorial geometry