2000 OIM Problems/Problem 1

Problem

A regular polygon with $n$ sides ( $n \ge 3$ ) is constructed and its vertices are numbered from 1 to $n$ . All diagonals of the polygon are drawn. Show that if $n$ is odd, each side and each diagonal can be assigned an integer from 1 to $n$ , such that the following conditions are simultaneously met:

1. The number assigned to each side or diagonal is different from those assigned to the vertices it joins.

2. For each vertex, all sides and diagonals that share that vertex have different numbers.

~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

Page

Toolbox

Search

2000 OIM Problems/Problem 1

Problem

Solution

See also