olymmath

CMO 2021 Problem 3

  • Paper

At a dinner party there are NN hosts and NN guests, seated around a circular table, where N≥4N \geq 4. 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 NN 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.

Add a solution

Locator ca-cmo/2021/p3 · Tag 6QCYS6J45V · Edit this page on GitHub · Keys: j next, k previous