Y by Eliot
We say two vertices of a simple polygon are visible from each other if either they are adjacent, or the segment joining them is completely inside the polygon (except two endpoints that lie on the boundary). Find all positive integers
such that there exists a simple polygon with
vertices in which every vertex is visible from exactly
other vertices.
(A simple polygon is a polygon without hole that does not intersect itself.)
Proposed by Morteza Saghafian



(A simple polygon is a polygon without hole that does not intersect itself.)
Proposed by Morteza Saghafian
This post has been edited 1 time. Last edited by Gaussian_cyber, Nov 4, 2020, 6:30 PM