Given is a regular polygon. Volodya wants to mark $k$ points on its perimeter so that any another regular polygon (maybe having a different number of sides) doesn’t contain all marked points on its perimeter. Find the minimal $k$ sufficient for any given polygon.
Problem
Source: Sharygin 2010 Final 9.8
Tags: geometry, combinatorics, polygon, regular polygon, points, perimeter, minimum