olymmath

EGMO 2017 Problem 4

  • Day 2

Let n≥1n \geq 1 be an integer and let t1<t2<…<tnt_{1}<t_{2}<\ldots<t_{n} be positive integers. In a group of tn+1t_{n}+1 people, some games of chess are played. Two people can play each other at most once. Prove that it is possible for the following conditions to hold at the same time: i) The number of games played by each person is one of t1,t2,…,tnt_{1}, t_{2}, \ldots, t_{n}, ii) For every ii with 1≤i≤n1 \leq i \leq n, there is someone who has played exactly tit_{i} games of chess.

Gerhard Wöginger, Luxembourg

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 egmo/2017/p4 · Tag JEW1TFMX6X · Edit this page on GitHub · Keys: j next, k previous