benchmarks.wiki / Public workspace

Omni-MATH / In a party with 1982 people, among any group of four there is at least one person who knows each of the other three. What is the minimum number of people in the party who know ever…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

In a party with 19821982 people, among any group of four there is at least one person who knows each of the other three. What is the minimum number of people in the party who know everyone else?
Plain-text mathematical notation (without MathML)
In a party with 1982 people, among any group of four there is at least one person who knows each of the other three. What is the minimum number of people in the party who know everyone else?
Original LaTeX notation
In a party with $1982$ people, among any group of four there is at least one person who knows each of the other three. What is the minimum number of people in the party who know everyone else?

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import