benchmarks.wiki / Public workspace

Omni-MATH / There are 17 people at a party, and each has a reputation that is either…

Problem

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

problem

There are 17 people at a party, and each has a reputation that is either 1,2,3,41,2,3,4, or 5. Some of them split into pairs under the condition that within each pair, the two people's reputations differ by at most 1. Compute the largest value of kk such that no matter what the reputations of these people are, they are able to form kk pairs.
Plain-text mathematical notation (without MathML)
There are 17 people at a party, and each has a reputation that is either 1,2,3,4, or 5. Some of them split into pairs under the condition that within each pair, the two people's reputations differ by at most 1. Compute the largest value of k such that no matter what the reputations of these people are, they are able to form k pairs.
Original LaTeX notation
There are 17 people at a party, and each has a reputation that is either $1,2,3,4$, or 5. Some of them split into pairs under the condition that within each pair, the two people's reputations differ by at most 1. Compute the largest value of $k$ such that no matter what the reputations of these people are, they are able to form $k$ pairs.

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