MathDB
2020 PUMaC Team 5

Source:

January 1, 2022
combinatoricscombinatorial geometry

Problem Statement

Suppose two polygons may be glued together at an edge if and only if corresponding edges of the same length are made to coincide. A 3×43\times 4 rectangle is cut into nn pieces by making straight line cuts. What is the minimum value of nn so that it’s possible to cut the pieces in such a way that they may be glued together two at a time into a polygon with perimeter at least 20212021?
Back to ProblemsView on AoPS