CMO 2021 Problem 3
- Paper
At a dinner party there are hosts and guests, seated around a circular table, where . A pair of two guests will chat with one another if either there is at most one person seated between them or if there are exactly two people between them, at least one of whom is a host. Prove that no matter how the 2 N people are seated at the dinner party, at least pairs of guests will chat with one another.
Dataset text NuminaMath olympiads. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.