100 players take part in a chess tournament where each player plays every other player exactly once. Each win is worth 1 point, each draw point and each loss 0 point. At the conclusion of the tournament, each player who scores at least 80 points is given a medal.
What is the maximum number of medals that can be awarded? Give proof.
Bonus: Generalise this for people who have to score at least points, where and are positive integers such that .
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
No. of total points=No. of matches=4950... Max. no. of people wining the medal=[4950/80]=61 This can be generalized to k people scoring atleast n points...