This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 1

2023 Euler Olympiad, Round 2, 2
Tags: Euler , combinatorics , costruction , Georgia
Let $n$ be a positive integer. The Georgian folk dance team consists of $2n$ dancers, with $n$ males and $n$ females. Each dancer, both male and female, is assigned a number from 1 to $n$. During one of their dances, all the dancers line up in a single line. Their wish is that, for every integer $k$ from 1 to $n$, there are exactly $k$ dancers positioned between the $k$th numbered male and the $k$th numbered female. Prove the following statements: a) If $n \equiv 1 \text{ or } 2 \mod{4}$, then the dancers cannot fulfill their wish. b) If $n \equiv 0 \text{ or } 3 \mod{4}$, then the dancers can fulfill their wish. [i]Proposed by Giorgi Arabidze, Georgia[/i]