MathDB
International meeting

Source: French TST 2005 - pb 3

May 26, 2005
combinatorics unsolvedcombinatorics

Problem Statement

In an international meeting of n3n \geq 3 participants, 14 languages are spoken. We know that: - Any 3 participants speak a common language. - No language is spoken more that by the half of the participants. What is the least value of nn?