Olympiad problems

2018 Iran Team Selection Test, 4

Call a positive integer "useful but not optimized " (!), if it can be written as a sum of distinct powers of $3$ and powers of $5$. Prove that there exist infinitely many positive integers which they are not "useful but not optimized". (e.g. $37=(3^0+3^1+3^3)+(5^0+5^1)$ is a " useful but not optimized" number) [i]Proposed by Mohsen Jamali[/i]

2018 Serbia JBMO TST, 3

Tags: number theory , TST

Solve the equation in positive integers: $2^x-3^y 5^z=1009$.

2015 Turkey Team Selection Test, 2

Tags: Turkey , TST , 2015 , combinatorics

There are $2015$ points on a plane and no two distances between them are equal. We call the closest $22$ points to a point its $neighbours$. If $k$ points share the same neighbour, what is the maximum value of $k$?

2023 Belarus Team Selection Test, 1.2

Tags: combinatorics , IMO Shortlist , AZE IMO TST , TST

In each square of a garden shaped like a $2022 \times 2022$ board, there is initially a tree of height $0$. A gardener and a lumberjack alternate turns playing the following game, with the gardener taking the first turn: [list] [*] The gardener chooses a square in the garden. Each tree on that square and all the surrounding squares (of which there are at most eight) then becomes one unit taller. [*] The lumberjack then chooses four different squares on the board. Each tree of positive height on those squares then becomes one unit shorter. [/list] We say that a tree is [i]majestic[/i] if its height is at least $10^6$. Determine the largest $K$ such that the gardener can ensure there are eventually $K$ majestic trees on the board, no matter how the lumberjack plays.

2023 Israel TST, P2

Tags: TST , geometry , areas , 3D geometry , pyramid

Let $SABCDE$ be a pyramid whose base $ABCDE$ is a regular pentagon and whose other faces are acute triangles. The altitudes from $S$ to the base sides dissect them into ten triangles, colored red and blue alternatingly. Prove that the sum of the squared areas of the red triangles is equal to the sum of the squared areas of the blue triangles.

2023 Israel TST, P2

Tags: TST , combinatorics , Coloring

In an $8 \times 8$ grid of squares, each square was colored black or white so that no $2\times 2$ square has all its squares in the same color. A sequence of distinct squares $x_1,\dots, x_m$ is called a [b]snake of length $m$[/b] if for each $1\leq i <m$ the squares $x_i, x_{i+1}$ are adjacent and are of different colors. What is the maximum $m$ for which there must exist a snake of length $m$?

2022 Bolivia IMO TST, P3

Tags: geometry , circumcircle , Bolivia , TST , midpoints

On $\triangle ABC$, let $M$ the midpoint of $AB$ and $N$ the midpoint of $CM$. Let $X$ a point such that $\angle XMC=\angle MBC$ and $\angle XCM=\angle MCB$ with $X,B$ in opposite sides of line $CM$. Let $\Omega$ the circumcircle of triangle $\triangle AMX$ [b]a)[/b] Show that $CM$ is tangent to $\Omega$ [b]b)[/b] Show that the lines $NX$ and $AC$ meet at $\Omega$

2011 Junior Macedonian Mathematical Olympiad, 4

Tags: number theory , TST

Find all integers $ m $ such that $ m^3+m^2+7 $ is divisible by $ m^2-m+1 $.

2019 India IMO Training Camp, P1

Tags: inequalities , india , TST , 2019 , number theory

Let $a_1,a_2,\ldots, a_m$ be a set of $m$ distinct positive even numbers and $b_1,b_2,\ldots,b_n$ be a set of $n$ distinct positive odd numbers such that \[a_1+a_2+\cdots+a_m+b_1+b_2+\cdots+b_n=2019\] Prove that \[5m+12n\le 581.\]

2023 ISL, A4

Tags: algebra , Functional inequality , IMO Shortlist , AZE IMO TST , TST

Let $\mathbb R_{>0}$ be the set of positive real numbers. Determine all functions $f \colon \mathbb R_{>0} \to \mathbb R_{>0}$ such that \[x \big(f(x) + f(y)\big) \geqslant \big(f(f(x)) + y\big) f(y)\] for every $x, y \in \mathbb R_{>0}$.

2021 Bolivia Ibero TST, 3

Tags: number theory , modular arithmetic , Bolivia , TST , prime numbers

Let $p=ab+bc+ac$ be a prime number where $a,b,c$ are different two by two, show that $a^3,b^3,c^3$ gives different residues modulo $p$

1995 China Team Selection Test, 2

Tags: geometry , geometric transformation , geometry unsolved , Tangents , Locus problems , China , TST

Given a fixed acute angle $\theta$ and a pair of internally tangent circles, let the line $l$ which passes through the point of tangency, $A$, cut the larger circle again at $B$ ($l$ does not pass through the centers of the circles). Let $M$ be a point on the major arc $AB$ of the larger circle, $N$ the point where $AM$ intersects the smaller circle, and $P$ the point on ray $MB$ such that $\angle MPN = \theta$. Find the locus of $P$ as $M$ moves on major arc $AB$ of the larger circle.

2023 Hong Kong Team Selection Test, Problem 6

Tags: combinatorics , TST

(a) Find the smallest number of lines drawn on the plane so that they produce exactly 2022 points of intersection. (Note: For 1 point of intersection, the minimum is 2; for 2 points, minimum is 3; for 3 points, minimum is 3; for 4 points, minimum is 4; for 5 points, the minimum is 4, etc.) (b) What happens if the lines produce exactly 2023 intersections?

2024 Switzerland - Final Round, 8

Tags: geometry , AZE IMO TST , IMO Shortlist , TST

Let $ABCD$ be a cyclic quadrilateral with $\angle BAD < \angle ADC$. Let $M$ be the midpoint of the arc $CD$ not containing $A$. Suppose there is a point $P$ inside $ABCD$ such that $\angle ADB = \angle CPD$ and $\angle ADP = \angle PCB$. Prove that lines $AD, PM$, and $BC$ are concurrent.

2015 Serbia National Math Olympiad, 2

Tags: number theory , TST

Let $k$ be fixed positive integer . Let $Fk(n)$ be smallest positive integer bigger than $kn$ such that $Fk(n)*n$ is a perfect square . Prove that if $Fk(n)=Fk(m)$ than $m=n$.

2013 USA Team Selection Test, 1

Tags: combinatorics , USA , TST , 2013 , graph theory

A social club has $2k+1$ members, each of whom is fluent in the same $k$ languages. Any pair of members always talk to each other in only one language. Suppose that there were no three members such that they use only one language among them. Let $A$ be the number of three-member subsets such that the three distinct pairs among them use different languages. Find the maximum possible value of $A$.

2019 Iran Team Selection Test, 2

Tags: TST , Iranian TST , geometry , Iran

In a triangle $ABC$, $\angle A$ is $60^\circ$. On sides $AB$ and $AC$ we make two equilateral triangles (outside the triangle $ABC$) $ABK$ and $ACL$. $CK$ and $AB$ intersect at $S$ , $AC$ and $BL$ intersect at $R$ , $BL$ and $CK$ intersect at $T$. Prove the radical centre of circumcircle of triangles $BSK, CLR$ and $BTC$ is on the median of vertex $A$ in triangle $ABC$. [i]Proposed by Ali Zamani[/i]

2021 Romania Team Selection Test, 3

Tags: geometry , quadrilateral , romania , Romanian TST , TST

Let $\mathcal{P}$ be a convex quadrilateral. Consider a point $X$ inside $\mathcal{P}.$ Let $M,N,P,Q$ be the projections of $X$ on the sides of $\mathcal{P}.$ We know that $M,N,P,Q$ all sit on a circle of center $L.$ Let $J$ and $K$ be the midpoints of the diagonals of $\mathcal{P}.$ Prove that $J,K$ and $L$ lie on a line.

2023 Estonia Team Selection Test, 6

Tags: combinatorics , IMO Shortlist , AZE IMO TST , TST

In each square of a garden shaped like a $2022 \times 2022$ board, there is initially a tree of height $0$. A gardener and a lumberjack alternate turns playing the following game, with the gardener taking the first turn: [list] [*] The gardener chooses a square in the garden. Each tree on that square and all the surrounding squares (of which there are at most eight) then becomes one unit taller. [*] The lumberjack then chooses four different squares on the board. Each tree of positive height on those squares then becomes one unit shorter. [/list] We say that a tree is [i]majestic[/i] if its height is at least $10^6$. Determine the largest $K$ such that the gardener can ensure there are eventually $K$ majestic trees on the board, no matter how the lumberjack plays.

2024 Germany Team Selection Test, 1

Tags: IMO Shortlist , number theory , AZE BMO TST , AZE EGMO TST , TST , BRA Cono Sur TST

For positive integers $n$ and $k \geq 2$, define $E_k(n)$ as the greatest exponent $r$ such that $k^r$ divides $n!$. Prove that there are infinitely many $n$ such that $E_{10}(n) > E_9(n)$ and infinitely many $m$ such that $E_{10}(m) < E_9(m)$.

2024 Chile TST Ibero., 3

Tags: TST , Chile , combinatorics

Find all natural numbers $ n $ for which it is possible to construct an $ n \times n $ square using only tetrominoes like the one below:

2023 Chile TST Ibero., 1

Tags: TST , Chile , number theory

Given a non-negative integer $ n $, determine the values of $ c $ for which the sequence of numbers \[ a_n = 4^n c + \frac{4^n - (-1)^n}{5} \] contains at least one perfect square.

2018 USA Team Selection Test, 3

Tags: graph theory , combinatorics , TST , USA , Extremal Graph Theory

At a university dinner, there are 2017 mathematicians who each order two distinct entrées, with no two mathematicians ordering the same pair of entrées. The cost of each entrée is equal to the number of mathematicians who ordered it, and the university pays for each mathematician's less expensive entrée (ties broken arbitrarily). Over all possible sets of orders, what is the maximum total amount the university could have paid? [i]Proposed by Evan Chen[/i]

2023 Hong Kong Team Selection Test, Problem 2

Tags: coordinate geometry , geometry , TST

Giiven $\Delta ABC$, $\angle CAB=75^{\circ}$ and $\angle ACB=45^{\circ}$. $BC$ is extended to $T$ so that $BC=CT$. Let $M$ be the midpoint of the segment $AT$. Find $\angle BMC$.

2015 Chile TST Ibero, 2

Tags: combinatorics , TST , Chile

In the country of Muilejistan, there exists a network of roads connecting all its cities. The network has the particular property that for any two cities, there is a unique path without backtracking (i.e., a path where the traveler never returns along the same road). The longest possible path between two cities is 600 kilometers. For instance, the path from the city of Mlar to the city of Nlar is 600 kilometers. Similarly, the path from the city of Klar to the city of Glar is also 600 kilometers. 1. If Jalim departs from Mlar towards Nlar at noon and Kalim departs from Klar towards Glar also at noon, both traveling at the same speed, prove that they meet at some point on their journey. 2. If the distance in kilometers between any two cities is an integer, prove that the distance from Glar to Mlar is even.