Olympiad problems

1980 IMO, 1

Given three infinite arithmetic progressions of natural numbers such that each of the numbers 1,2,3,4,5,6,7 and 8 belongs to at least one of them, prove that the number 1980 also belongs to at least one of them.

2016 Harvard-MIT Mathematics Tournament, 10

Tags:

Let $a,b$ and $c$ be real numbers such that \begin{align*} a^2+ab+b^2&=9 \\ b^2+bc+c^2&=52 \\ c^2+ca+a^2&=49. \end{align*} Compute the value of $\dfrac{49b^2+39bc+9c^2}{a^2}$.

2011 Laurențiu Duican, 3

Tags: function , real analysis , continuity , fractional part

Let be two continuous functions $ f:[0,\infty )\longrightarrow\mathbb{R} $ satisfying the following equations: $$ \lim_{x\to\infty } f(x) =\infty =\lim_{x\to\infty } g(x) $$ Prove that there exists a divergent sequence $ \left( k_n \right)_{n\ge 1} $ of nonnegative integers which has the property that each term (function) of the sequence of functions $ \left( h_{n} \right)_{n\ge 1} :[0,\infty )\longrightarrow\mathbb{R} $ defined as $$ h_{n} (x) =f\left( k_n+g(x) -\left\lfloor g(x) \right\rfloor \right) , $$ doesn't have limit at $ \infty . $ [i]Romeo Ilie[/i]

1990 IMO Shortlist, 5

Tags: geometry , incenter , vector , euler , trigonometry , orthocenter

Given a triangle $ ABC$. Let $ G$, $ I$, $ H$ be the centroid, the incenter and the orthocenter of triangle $ ABC$, respectively. Prove that $ \angle GIH > 90^{\circ}$.

2004 Flanders Math Olympiad, 1

Tags: perimeter , incenter , ratio , circumcircle , geometry

[u][b]The author of this posting is : Peter VDD[/b][/u] ____________________________________________________________________ most of us didn't really expect to get this, but here it goes (flanders mathematical olympiad 2004, today) triangle with sides 501m, 668m, 835m how many lines can be draws so that the line halves both area and circumference?

2005 iTest, 18

Tags: geometry , triangle inequality

If the four sides of a quadrilateral are $2, 3, 6$, and $x$, find the sum of all possible integral values for $x$.

2022 APMO, 4

Tags: combinatorics

Let $n$ and $k$ be positive integers. Cathy is playing the following game. There are $n$ marbles and $k$ boxes, with the marbles labelled $1$ to $n$. Initially, all marbles are placed inside one box. Each turn, Cathy chooses a box and then moves the marbles with the smallest label, say $i$, to either any empty box or the box containing marble $i+1$. Cathy wins if at any point there is a box containing only marble $n$. Determine all pairs of integers $(n,k)$ such that Cathy can win this game.

2017 Saudi Arabia JBMO TST, 5

Tags: algebra , inequality

Let $a,b,c>0$ and $a+b+c=6$ . Prove that $$ \frac{1}{a^2b+16}+\frac{1}{b^2c+16}+\frac{1}{c^2a+16} \ge \frac{1}{8}.$$

2020 Purple Comet Problems, 10

Tags: number theory

Given that $a, b$, and $c$ are distinct positive integers such that $a \cdot b \cdot c = 2020$, the minimum possible positive value of $\frac{1}{a}-\frac{1}{b}-\frac{1}{c}$, is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

2008 Princeton University Math Competition, B1

Tags: number theory

What is the remainder, in base $10$, when $24_7 + 364_7 + 43_7 + 12_7 + 3_7 + 1_7$ is divided by $6$?

2025 Malaysian APMO Camp Selection Test, 5

Tags: combinatorics , geometry , combinatorial geometry

Fix a positive integer $n\ge 2$. For any cyclic $2n$-gon $P_1 P_2\cdots P_{2n}$ in this order, define its score as the maximal possible value of $$\angle P_iXP_{i+1} + \angle P_{i+n}XP_{i+n+1}$$ across all $1\le i\le n$ (indices modulo $n$), and over all points $X$ inside the $2n$-gon including its boundary. Prove that there exist a real number $r$ such that a cyclic $2n$-gon is regular if and only if it has score $r$. [i]Proposed by Wong Jer Ren[/i]

2014 Czech-Polish-Slovak Junior Match, 5

Tags: polygon , square , sum , combinatorial geometry , combinatorics , angle

A square is given. Lines divide it into $n$ polygons. What is he the largest possible sum of the internal angles of all polygons?

2015 BMT Spring, P2

Tags: polynomial , algebra

Let $f(x)$ be a nonconstant monic polynomial of degree $n$ with rational coefficents that is irreducible, meaning it cannot be factored into two nonconstant rational polynomials. Find and prove a formula for the number of monic complex polynomials that divide $f$.

2021 Irish Math Olympiad, 6

Tags: geometry , equilateral , algebra , arithmetic progression

A sequence whose first term is positive has the property that any given term is the area of an equilateral triangle whose perimeter is the preceding term. If the first three terms form an arithmetic progression, determine all possible values of the first term.

2022 Indonesia TST, C

Tags: counting , combinatorics

Let $A$ be a subset of $\{1,2,\ldots,2020\}$ such that the difference of any two distinct elements in $A$ is not prime. Determine the maximum number of elements in set $A$.

2024 Israel TST, P3

Tags: distance , combinatorial geometry , combinatorics , geometry , set

For a set $S$ of at least $3$ points in the plane, let $d_{\text{min}}$ denote the minimal distance between two different points in $S$ and $d_{\text{max}}$ the maximal distance between two different points in $S$. For a real $c>0$, a set $S$ will be called $c$-[i]balanced[/i] if \[\frac{d_{\text{max}}}{d_{\text{min}}}\leq c|S|\] Prove that there exists a real $c>0$ so that for every $c$-balanced set of points $S$, there exists a triangle with vertices in $S$ that contains at least $\sqrt{|S|}$ elements of $S$ in its interior or on its boundary.

2018 USAMTS Problems, 3:

Tags:

Alice, Bob, and Chebyshev play a game. Alice puts six red chips into a bag, Bob puts seven blue chips into the bag, and Chebyshev puts eight green chips into the bag. Then, the almighty Zan randomly removes chips from the bag one at a time and gives them back to the corresponding player. The winner of the game is the first player to get all of their chips back. Find, with proof, the probability that Bob wins the game.

2009 Croatia Team Selection Test, 1

Tags: polynomial , absolute value , algebra

Determine the lowest positive integer n such that following statement is true: If polynomial with integer coefficients gets value 2 for n different integers, then it can't take value 4 for any integer.

2000 Cono Sur Olympiad, 1

Tags: number theory

Call a positive integer [i]descending[/i] if, reading left to right, each of its digits (other than its leftmost) is less than or equal to the previous digit. For example, $4221$ and $751$ are descending while $476$ and $455$ are not descending. Determine whether there exists a positive integer $n$ for which $16^n$ is descending.

2009 Cuba MO, 2

Tags: combinatorics

In Hidro planet were living $2008^2$ hydras some time ago. One of them had 1 tentacle, other 2 and so on to the last with $2008^2$ tentacles. Let $t(H)$ be the number of tentacles of hydra $H$. The pairing of $H_1$ and $H_2$ (where $t(H_1) < t(H_2)$) is a new hydra with $t(H_2)-t(H_1)+8$ tentacles, in case of $t(H_1)=t(H_2)$ they die. An expedition found in Hidro the last hydra with 23 tentacles. That could be true ?

2010 Bosnia And Herzegovina - Regional Olympiad, 1

Tags: algebra

For real numbers $a$, $b$, $c$ and $d$ holds: $$ a+b+c+d=0$$ $$a^3+b^3+c^3+d^3=0$$ Prove that sum of some two numbers $a$, $b$, $c$ and $d$ is equal to zero

1979 Canada National Olympiad, 3

Tags: least common multiple , number theory

Let $a$, $b$, $c$, $d$, $e$ be integers such that $1 \le a < b < c < d < e$. Prove that \[\frac{1}{[a,b]} + \frac{1}{[b,c]} + \frac{1}{[c,d]} + \frac{1}{[d,e]} \le \frac{15}{16},\] where $[m,n]$ denotes the least common multiple of $m$ and $n$ (e.g. $[4,6] = 12$).

1979 IMO Longlists, 30

Tags: symmetry , geometric transformation , reflection , rotation , invariant , geometry

Let $M$ be a set of points in a plane with at least two elements. Prove that if $M$ has two axes of symmetry $g_1$ and $g_2$ intersecting at an angle $\alpha = q\pi$, where $q$ is irrational, then $M$ must be infinite.

2004 China Team Selection Test, 2

Tags: inequalities , combinatorics

Let $ k$ be a positive integer. Set $ A \subseteq \mathbb{Z}$ is called a $ \textbf{k \minus{} set}$ if there exists $ x_1, x_2, \cdots, x_k \in \mathbb{Z}$ such that for any $ i \neq j$, $ (x_i \plus{} A) \cap (x_j \plus{} A) \equal{} \emptyset$, where $ x \plus{} A \equal{} \{ x \plus{} a \mid a \in A \}$. Prove that if $ A_i$ is $ \textbf{k}_i\textbf{ \minus{} set}$($ i \equal{} 1,2, \cdots, t$), and $ A_1 \cup A_2 \cup \cdots \cup A_t \equal{} \mathbb{Z}$, then $ \displaystyle \frac {1}{k_1} \plus{} \frac {1}{k_2} \plus{} \cdots \plus{} \frac {1}{k_t} \geq 1$.

2017 Auckland Mathematical Olympiad, 1

Tags: combinatorics

In an apartment block there live only couples of parents with children. It is known that every couple has at least one child, that every child has exactly two parents, that every little boy in this building has a sister, and that among the children there are more boys than girls. You may also assume that there are no grandparents living in the building. Is it possible that there are more parents than children in the building? Explain your reasoning.