MathDB

Given an integer

n \ge 2

and a regular

2n

-polygon at each vertex of which sitting on an ant. At some points in time, each ant creeps into one of two adjacent peaks (some peaks may have several ants at a time). Through

k

such operations, it turned out to be an arbitrary line connecting two different ones the vertices of a polygon with ants do not pass through its center. For given

n

find the lowest possible value of

k

Problem Statement