MathDB
Combo problem about regular polygons

Source: 1st TASIMO, Day1 Problem3

May 18, 2024
combinatoricsregular polygon

Problem Statement

AbdulqodirAbdulqodir cut out 20242024 congruent regular n−n-gons from a sheet of paper and placed these n−n-gons on the table such that some parts of each of these n−n-gons may be covered by others. We say that a vertex of one of the afore-mentioned n−n-gons is visiblevisible if it is not in the interior of another n−n-gon that is placed on top of it. For any n>2n>2 determine the minimum possible number of visible vertices. \\ Proposed by David Hrushka, Slovakia
Back to ProblemsView on AoPS