MathDB
13rd ibmo - rep. dominicana 1998/q4.

Source: Spanish Communities

April 16, 2006
pigeonhole principleinductioncombinatorics unsolvedcombinatorics

Problem Statement

There are representants from nn different countries sit around a circular table (n2n\geq2), in such way that if two representants are from the same country, then, their neighbors to the right are not from the same country. Find, for every nn, the maximal number of people that can be sit around the table.