MathDB
lines and numbers

Source: Baltic Way 1994-18

March 21, 2005
modular arithmeticgraph theorycombinatorics proposedcombinatorics

Problem Statement

There are n>2n>2 lines given in the plane. No two of the lines are parallel and no three of them intersect at one point. Every point of intersection of these lines is labelled with a natural number between 11 and n1n-1. Prove that, if and only if nn is even, it is possible to assign the labels in such a way that every line has all the numbers from 11 to n1n-1 at its points of intersection with the other n1n-1 lines.