MathDB
m people have exactly one common friend

Source: China TST 1990, problem 1

June 27, 2005
inductioncombinatorics unsolvedcombinatorics

Problem Statement

In a wagon, every m≥3m \geq 3 people have exactly one common friend. (When AA is BB's friend, BB is also AA's friend. No one was considered as his own friend.) Find the number of friends of the person who has the most friends.
Back to ProblemsView on AoPS