Olympiad problems

2015 Postal Coaching, Problem 4

For an integer $n \geq 5,$ two players play the following game on a regular $n$-gon. Initially, three consecutive vertices are chosen, and one counter is placed on each. A move consists of one player sliding one counter along any number of edges to another vertex of the $n$-gon without jumping over another counter. A move is legal if the area of the triangle formed by the counters is strictly greater after the move than before. The players take turns to make legal moves, and if a player cannot make a legal move, that player loses. For which values of $n$ does the player making the first move have a winning strategy?

2015 Romanian Master of Mathematics, 6

Tags: RMM , rectangle , combinatorial geometry , combinatorics , RMM 2015

Given a positive integer $n$, determine the largest real number $\mu$ satisfying the following condition: for every set $C$ of $4n$ points in the interior of the unit square $U$, there exists a rectangle $T$ contained in $U$ such that $\bullet$ the sides of $T$ are parallel to the sides of $U$; $\bullet$ the interior of $T$ contains exactly one point of $C$; $\bullet$ the area of $T$ is at least $\mu$.

2015 Romania Masters in Mathematics, 1

Tags: number theory , relatively prime , RMM , RMM 2015

Does there exist an infinite sequence of positive integers $a_1, a_2, a_3, . . .$ such that $a_m$ and $a_n$ are coprime if and only if $|m - n| = 1$?

2015 Romanian Master of Mathematics, 1

Tags: number theory , relatively prime , RMM , RMM 2015

Does there exist an infinite sequence of positive integers $a_1, a_2, a_3, . . .$ such that $a_m$ and $a_n$ are coprime if and only if $|m - n| = 1$?

2015 Romania Masters in Mathematics, 6

Tags: RMM , rectangle , combinatorial geometry , combinatorics , RMM 2015

Given a positive integer $n$, determine the largest real number $\mu$ satisfying the following condition: for every set $C$ of $4n$ points in the interior of the unit square $U$, there exists a rectangle $T$ contained in $U$ such that $\bullet$ the sides of $T$ are parallel to the sides of $U$; $\bullet$ the interior of $T$ contains exactly one point of $C$; $\bullet$ the area of $T$ is at least $\mu$.

2015 Romania Masters in Mathematics, 2

Tags: combinatorics , RMM , combinatorial geometry , RMM 2015

For an integer $n \geq 5,$ two players play the following game on a regular $n$-gon. Initially, three consecutive vertices are chosen, and one counter is placed on each. A move consists of one player sliding one counter along any number of edges to another vertex of the $n$-gon without jumping over another counter. A move is legal if the area of the triangle formed by the counters is strictly greater after the move than before. The players take turns to make legal moves, and if a player cannot make a legal move, that player loses. For which values of $n$ does the player making the first move have a winning strategy?

2015 Romanian Master of Mathematics, 2

Tags: combinatorics , RMM , combinatorial geometry , RMM 2015

For an integer $n \geq 5,$ two players play the following game on a regular $n$-gon. Initially, three consecutive vertices are chosen, and one counter is placed on each. A move consists of one player sliding one counter along any number of edges to another vertex of the $n$-gon without jumping over another counter. A move is legal if the area of the triangle formed by the counters is strictly greater after the move than before. The players take turns to make legal moves, and if a player cannot make a legal move, that player loses. For which values of $n$ does the player making the first move have a winning strategy?

2015 Postal Coaching, Problem 3

Tags: number theory , relatively prime , RMM , RMM 2015

Does there exist an infinite sequence of positive integers $a_1, a_2, a_3, . . .$ such that $a_m$ and $a_n$ are coprime if and only if $|m - n| = 1$?