Olympiad problems

2015 JBMO TST - Turkey, 3

In a country consisting of $2015$ cities, between any two cities there is exactly one direct round flight operated by some air company. Find the minimal possible number of air companies if direct flights between any three cities are operated by three different air companies.

2018 Turkey Junior National Olympiad, 1

Tags: Turkey , Divisors , number theory

Let $s(n)$ be the number of positive integer divisors of $n$. Find the all positive values of $k$ that is providing $k=s(a)=s(b)=s(2a+3b)$.

2015 Turkey Team Selection Test, 3

Tags: Turkey , TST , combinatorics , algebra , Set partition

Let $m, n$ be positive integers. Let $S(n,m)$ be the number of sequences of length $n$ and consisting of $0$ and $1$ in which there exists a $0$ in any consecutive $m$ digits. Prove that \[S(2015n,n).S(2015m,m)\ge S(2015n,m).S(2015m,n)\]

2017 Turkey EGMO TST, 6

Tags: Turkey , EGMO , TST , number theory , contest problem , order of an element

Find all pairs of prime numbers $(p,q)$, such that $\frac{(2p^2-1)^q+1}{p+q}$ and $\frac{(2q^2-1)^p+1}{p+q}$ are both integers.

2021 JBMO TST - Turkey, 1

Tags: geometry , circles , perpendicular lines , Turkey , Junior

In an acute-angled triangle $ABC$, the circle with diameter $[AB]$ intersects the altitude drawn from vertex $C$ at a point $D$ and the circle with diameter $[AC]$ intersects the altitude drawn from vertex $B$ at a point $E$. Let the lines $BD$ and $CE$ intersect at $F$. Prove that $$AF\perp DE$$

2025 Turkey Team Selection Test, 3

Tags: functional equation , Turkey , algebra

Find all $f: \mathbb{R} \rightarrow \mathbb{R}$ such that, for all $x,y \in \mathbb{R}-\{0\}$, $$ f(x) \neq 0 \text{ and } \frac{f(x)}{f(y)} + \frac{f(y)}{f(x)} - f \left( \frac{x}{y}-\frac{y}{x} \right) =2 $$

2017 Turkey EGMO TST, 2

Tags: Turkey , EGMO , TST , combinatorics , contest problem

At the beginning there are $2017$ marbles in each of $1000$ boxes. On each move Aybike chooses a box, grabs some of the marbles from that box and delivers them one for each to the boxes she wishes. At least how many moves does Aybike have to make to have different number of marbles in each box?

2015 Turkey Team Selection Test, 7

Tags: Turkey , TST , 2015 , functional equation , algebra , function , Sophie Germain identity

Find all the functions $f:R\to R$ such that \[f(x^2) + 4y^2f(y) = (f(x-y) + y^2)(f(x+y) + f(y))\] for every real $x,y$.

2014 Turkey Junior National Olympiad, 3

Tags: pigeonhole principle , combinatorics , Turkey

There are $2014$ balls with $106$ different colors, $19$ of each color. Determine the least possible value of $n$ so that no matter how these balls are arranged around a circle, one can choose $n$ consecutive balls so that amongst them, there are $53$ balls with different colors.

2014 Contests, 3

Tags: pigeonhole principle , combinatorics , Turkey

There are $2014$ balls with $106$ different colors, $19$ of each color. Determine the least possible value of $n$ so that no matter how these balls are arranged around a circle, one can choose $n$ consecutive balls so that amongst them, there are $53$ balls with different colors.

2021 Turkey Team Selection Test, 4

Tags: Turkey , combinatorics

In a fish shop with 28 kinds of fish, there are 28 fish sellers. In every seller, there exists only one type of each fish kind, depending on where it comes, Mediterranean or Black Sea. Each of the $k$ people gets exactly one fish from each seller and exactly one fish of each kind. For any two people, there exists a fish kind which they have different types of it (one Mediterranean, one Black Sea). What is the maximum possible number of $k$?

2017 Morocco TST-, 1

Tags: inequalities , Turkey

Let $a,b,c$ be non-negative real numbers such that $a^2+b^2+c^2 \le 3$ then prove that; $$(a+b+c)(a+b+c-abc)\ge2(a^2b+b^2c+c^2a)$$

2017 Turkey Team Selection Test, 9

Tags: Turkey , TST , combinatorics

Let $S$ be a set of finite number of points in the plane any 3 of which are not linear and any 4 of which are not concyclic. A coloring of all the points in $S$ to red and white is called [i]discrete coloring[/i] if there exists a circle which encloses all red points and excludes all white points. Determine the number of [i]discrete colorings[/i] for each set $S$.

2017 Turkey EGMO TST, 3

Tags: Turkey , EGMO , TST , algebra , inequalities , contest problem

For all positive real numbers $x,y,z$ satisfying the inequality $$\frac{xy}{z}+\frac{yz}{x}+\frac{zx}{y}\leq 3,$$ prove that $$\frac{x^2}{y^3}+\frac{y^2}{z^3}+\frac{z^2}{x^3}\geq \frac{x}{y}+\frac{y}{z}+\frac{z}{x}.$$

2017 Turkey EGMO TST, 1

Tags: Turkey , EGMO , TST , number theory , contest problem

Let $m,k,n$ be positive integers. Determine all triples $(m,k,n)$ satisfying the following equation: $3^m5^k=n^3+125$

2021 Turkey Team Selection Test, 9

Tags: Turkey , number theory , GCD

For which positive integer couples $(k,n)$, the equality $\Bigg|\Bigg\{{a \in \mathbb{Z}^+: 1\leq a\leq(nk)!, gcd \left(\binom{a}{k},n\right)=1}\Bigg\}\Bigg|=\frac{(nk)!}{6}$ holds?

2017 Turkey EGMO TST, 5

Tags: Turkey , EGMO , TST , combinatorics , contest problem

In a $12\times 12$ square table some stones are placed in the cells with at most one stone per cell. If the number of stones on each line, column, and diagonal is even, what is the maximum number of the stones? [b]Note[/b]. Each diagonal is parallel to one of two main diagonals of the table and consists of $1,2\ldots,11$ or $12$ cells.

2020 Turkey EGMO TST, 6

Tags: inequalities , algebra , Turkey , High school olympiad , inequalities proposed

$x,y,z$ are positive real numbers such that: $$xyz+x+y+z=6$$ $$xyz+2xy+yz+zx+z=10$$ Find the maximum value of: $$(xy+1)(yz+1)(zx+1)$$

2017 Turkey Team Selection Test, 8

Tags: Turkey , TST , geometry

In a triangle $ABC$ the bisectors through vertices $B$ and $C$ meet the sides $\left [ AC \right ]$ and $\left [ AB \right ]$ at $D$ and $E$ respectively. Let $I_{c}$ be the center of the excircle which is tangent to the side $\left [ AB \right ]$ and $F$ the midpoint of $\left [ BI_{c} \right ]$. If $\left | CF \right |^2=\left | CE \right |^2+\left | DF \right |^2$, show that $ABC$ is an equilateral triangle.

2018 Turkey Team Selection Test, 2

Tags: functional equation , TST , Turkey , 2018 , Hi

Find all $f:\mathbb{R}\to\mathbb{R}$ surjective functions such that $$f(xf(y)+y^2)=f((x+y)^2)-xf(x) $$ for all real numbers $x,y$.

2015 Turkey Team Selection Test, 9

Tags: Turkey , TST , 2015 , combinatorics , graph theory

In a country with $2015$ cities there is exactly one two-way flight between each city. The three flights made between three cities belong to at most two different airline companies. No matter how the flights are shared between some number of companies, if there is always a city in which $k$ flights belong to the same airline, what is the maximum value of $k$?

2011 Turkey Junior National Olympiad, 1

Tags: inequalities , inequalities proposed , algebra , Turkey

Show that \[1 \leq \frac{(x+y)(x^3+y^3)}{(x^2+y^2)^2} \leq \frac98\] holds for all positive real numbers $x,y$.

2021 Turkey Team Selection Test, 5

Tags: Turkey , geometry , perpendicular bisector , menelaus theorem

In a non isoceles triangle $ABC$, let the perpendicular bisector of $[BC]$ intersect $(ABC)$ at $M$ and $N$ respectively. Let the midpoints of $[AM]$ and $[AN]$ be $K$ and $L$ respectively. Let $(ABK)$ and $(ABL)$ intersect $AC$ again at $D$ and $E$ respectively, let $(ACK)$ and $(ACL)$ intersect $AB$ again at $F$ and $G$ respectively. Prove that the lines $DF$, $EG$ and $MN$ are concurrent.

2022 Dutch BxMO TST, 5

Tags: Turkey , combinatorics

In a fish shop with 28 kinds of fish, there are 28 fish sellers. In every seller, there exists only one type of each fish kind, depending on where it comes, Mediterranean or Black Sea. Each of the $k$ people gets exactly one fish from each seller and exactly one fish of each kind. For any two people, there exists a fish kind which they have different types of it (one Mediterranean, one Black Sea). What is the maximum possible number of $k$?

2015 Turkey Team Selection Test, 5

Tags: Turkey , TST , 2015 , combinatorics

We are going to colour the cells of a $2015 \times 2015$ board such that there are none of the following: $1)$ Three cells with the same colour where two of them are in the same column, and the third is in the same row and to the right of the upper cell, $2)$ Three cells with the same colour where two of them are in the same column, and the third is in the same row and to the left of the lower cell. What is the minimum number of colours $k$ required to make such a colouring possible?