Join the USAMO Guide Discord Server. Regular updates are posted there!

Let me Join!
Dismiss

Berkeley Math Circle #0ht6

Berkeley Math CircleHard

From module Advanced Counting

Community difficultyNo ratings yetBe the first to rate this problem.
Understand the scale
Scale 0.5: Easiest math competition problems, often solvable even for early middle school students without experience. 1: Problems strictly for beginners, often at a moderate middle school level. 1.5: Problems for stronger beginner students, on the level of the middling problems in most middle school contests. 2: For motivated beginners, harder questions from the previous categories. 2.5: More advanced beginner problems, hardest questions from previous categories. 3: Early intermediate problems that require more creative thinking. 3.5: Tougher early intermediate problems that consistently stretch into higher-level creative thinking or conceptual knowledge. 4: Intermediate-level problems. 4.5: Upper intermediate problems approaching the upper bound for non-invitational sprint math competitions. 5: More difficult AIME problems or simple proof-based Olympiad-style problems. 6: High-level AIME-styled questions or introductory Olympiad-level questions. 7: Tougher Olympiad-level questions, may require more technical knowledge. 8: High-level Olympiad-level questions. 9: Expert Olympiad-level questions. 9.5: The hardest problems appearing on Olympiads which the strongest students could reasonably solve. 10: Historically notorious problems, generally unsuitable for even very hard competitions because they are exceedingly tedious, long, and difficult.
Counting two waysCauchy-Schwarz

Problem

Problem:

Every two members of a certain society are either friends or enemies. Suppose that there are nn members of the society, that there are exactly qq pairs of friends, and that in every set of three persons there are two who are enemies to each other. Prove that there is at least one member of the society among whose enemies there are at most q⋅(1−4qn2)q \cdot\left(1-\frac{4 q}{n^{2}}\right) pairs of friends.

← Back to all problems