# Chess Tournament

A short while ago I came across this quite famous Russian problem which has a very intriguing result, but I myself have made little headway on it thus far:

In a chess tournament there are $$2n+3$$ competitors. Every competitor plays every other competitor precisely once. No 2 matches can be played simultaneously, and after a competitor plays a match he can not play in any of the next n matches. Show that one of the competitors who plays in the opening match will also play in the closing match.

Note by Josh Rowley
4 years, 4 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$

Sort by:

Here's an initial thought. The first 2 players cannot play in the next $$n$$ games, which involve $$2n$$ more people. Hence, the next game after that must involve the last person, and one of the first 2 players.

Can we continue from here?

Staff - 4 years, 4 months ago

×