Found problems: 85335
1999 Spain Mathematical Olympiad, 4
A box contains $900$ cards, labeled from $100$ to $999$. Cards are removed one at a time without replacement. What is the smallest number of cards that must be removed to guarantee that the labels of at least three removed cards have equal sums of digits?
2002 BAMO, 1
Let $ABC$ be a right triangle with right angle at $B$. Let $ACDE$ be a square drawn exterior to triangle $ABC$. If $M$ is the center of this square, find the measure of $\angle MBC$.
2016 IFYM, Sozopol, 4
A plane is cut into unit squares, which are then colored in $n$ colors. A polygon $P$ is created from $n$ unit squares that are connected by their sides. It is known that any cell polygon created by $P$ with translation, covers $n$ unit squares in different colors. Prove that the plane can be covered with copies of $P$ so that each cell is covered exactly once.
2017 BMT Spring, 3
Suppose we have $w < x < y < z$, and each of the $6$ pairwise sums are distinct. The $4$ greatest sums are $4, 3, 2, 1$. What is the sum of all possible values of $w$?
2011 District Olympiad, 3
Let be two complex numbers $ a,b. $ Show that the following affirmations are equivalent:
$ \text{(i)} $ there are four numbers $ x_1,x_2,x_3,x_4\in\mathbb{C} $ such that $ \big| x_1 \big| =\big| x_3 \big|, \big| x_2 \big| =\big| x_4 \big|, $ and
$$ x_{j_1}^2-ax_{j_1}+b=0=x_{j_2}^2-bx_{j_2}+a,\quad\forall j_1\in\{ 1,2\} ,\quad\forall j_2\in\{ 3,4\} . $$
$ \text{(ii)} a^3=b^3 $ or $ b=\overline{a} $ (the conjugate of a).
2022 Moscow Mathematical Olympiad, 3
Bisector $AL$ is drawn in an acute triangle $ABC$. On the line $LA$ beyond the point $A$, the point K is chosen with $AK = AL$. Circumcirles of triangles $BLK$ and $CLK$ intersect segments $AC$ and $AB$ at points $P$ and $Q$
respectively. Prove that lines $PQ$ and $BC$ are parallel.
2025 Malaysian IMO Training Camp, 7
Let $n$ be a positive integer and $a_1\le a_2\le\ldots\le a_{n+1}$ and $b_1\le b_2\le\ldots\le b_n$ be real numbers such that for all $k\le n$, \[\binom nk\sum_{\substack{1\le i_1<i_2<\ldots<i_k\le n+1,\\i_1,i_2,\ldots,i_k\in\mathbb N}}a_{i_1}a_{i_2}\ldots a_{i_k} = \binom{n+1}k\sum_{\substack{1\le j_1<j_2<\ldots<j_k\le n,\\j_1,j_2,\ldots,j_k\in\mathbb N}}b_{j_1}b_{j_2}\ldots b_{j_k}.\] Show that \[a_1\le b_1\le a_2\le b_2\le \ldots \le a_n\le b_n\le a_{n+1}.\]
[i](Proposed by Ivan Chan Guan Yu)[/i]
PEN J Problems, 2
Show that for all $n \in \mathbb{N}$, \[n = \sum^{}_{d \vert n}\phi(d).\]
2018 China Team Selection Test, 4
Suppose $A_1,A_2,\cdots ,A_n \subseteq \left \{ 1,2,\cdots ,2018 \right \}$ and $\left | A_i \right |=2, i=1,2,\cdots ,n$, satisfying that $$A_i + A_j, \; 1 \le i \le j \le n ,$$ are distinct from each other. $A + B = \left \{ a+b|a\in A,\,b\in B \right \}$. Determine the maximal value of $n$.
2015 USA TSTST, 1
Let $a_1, a_2, \dots, a_n$ be a sequence of real numbers, and let $m$ be a fixed positive integer less than $n$. We say an index $k$ with $1\le k\le n$ is good if there exists some $\ell$ with $1\le \ell \le m$ such that $a_k+a_{k+1}+...+a_{k+\ell-1}\ge0$, where the indices are taken modulo $n$. Let $T$ be the set of all good indices. Prove that $\sum\limits_{k \in T}a_k \ge 0$.
[i]Proposed by Mark Sellke[/i]
2017 Ukraine Team Selection Test, 9
There're two positive inegers $a_1<a_2$. For every positive integer $n \geq 3$ let $a_n$ be the smallest integer that bigger than $a_{n-1}$ and such that there's unique pair $1\leq i< j\leq n-1$ such that this number equals to $a_i+a_j$. Given that there're finitely many even numbers in this sequence. Prove that sequence $\{a_{n+1}-a_n \}$ is periodic starting from some element.
2012 Romania Team Selection Test, 3
Let $A$ and $B$ be finite sets of real numbers and let $x$ be an element of $A+B$. Prove that \[|A\cap (x-B)|\leq \frac{|A-B|^2}{|A+B|}\] where $A+B=\{a+b: a\in A, b\in B\}$, $x-B=\{x-b: b\in B\}$ and $A-B=\{a-b: a\in A, b\in B\}$.
2012 Grigore Moisil Intercounty, 3
Solve in the real numbers the equation $ (n+1)^x+(n+3)^x+\left( n^2+2n\right)^x=n^x+(n+2)^x+\left( n^2+4n+3\right)^x, $ wher $ n\ge 2 $ is a fixed natural number.
2022 Israel TST, 3
In triangle $ABC$, the angle bisectors are $BE$ and $CF$ (where $E, F$ are on the sides of the triangle), and their intersection point is $I$. Point $N$ lies on the circumcircle of $AEF$, and the angle $\angle IAN$ is right. The circumcircle of $AEF$ meets the line $NI$ a second time at the point $L$. Show that the circumcenter of $AIL$ lies on line $BC$.
1999 Mongolian Mathematical Olympiad, Problem 2
Can a square be divided into $10$ pairwise non-congruent triangles with the same area?
2011 Junior Balkan Team Selection Tests - Romania, 5
Consider $n$ persons, each of them speaking at most $3$ languages. From any $3$ persons there are at least two which speak a common language.
i) For $n \le 8$, exhibit an example in which no language is spoken by more than two persons.
ii) For $n \ge 9$, prove that there exists a language which is spoken by at least three persons
1966 IMO, 1
In a mathematical contest, three problems, $A,B,C$ were posed. Among the participants ther were 25 students who solved at least one problem each. Of all the contestants who did not solve problem $A$, the number who solved $B$ was twice the number who solved $C$. The number of students who solved only problem $A$ was one more than the number of students who solved $A$ and at least one other problem. Of all students who solved just one problem, half did not solve problem $A$. How many students solved only problem $B$?
2002 IMO, 1
Let $n$ be a positive integer. Each point $(x,y)$ in the plane, where $x$ and $y$ are non-negative integers with $x+y<n$, is coloured red or blue, subject to the following condition: if a point $(x,y)$ is red, then so are all points $(x',y')$ with $x'\leq x$ and $y'\leq y$. Let $A$ be the number of ways to choose $n$ blue points with distinct $x$-coordinates, and let $B$ be the number of ways to choose $n$ blue points with distinct $y$-coordinates. Prove that $A=B$.
2023 MMATHS, 2
$20$ players enter a chess tournament in which each player will play every other player exactly once. Some competitors are cheaters and will cheat in every game they play, but the rest of the competitors are not cheaters. A game is cheating if both players cheat, and a game is half-cheating if one player cheats and one player does not. If there were $68$ more half-cheating games than cheating games, how many of the players are cheaters?
2003 BAMO, 5
Let $ABCD$ be a square, and let $E$ be an internal point on side $AD$. Let $F$ be the foot of the perpendicular from $B$ to $CE$. Suppose $G$ is a point such that $BG = FG$, and the line through $G$ parallel to $BC$ passes through the midpoint of $EF$. Prove that $AC < 2 \cdot FG$.
2020 Caucasus Mathematical Olympiad, 2
Let $\omega_1$ and $\omega_2$ be two non-intersecting circles. Let one of its internal tangents touches $\omega_1$ and $\omega_2$ at $A_1$ and $A_2$, respectively, and let one of its external tangents touches $\omega_1$ and $\omega_2$ at $B_1$ and $B_2$, respectively. Prove that if $A_1B_2 = A_2B_1$, then $A_1B_2 \perp A_2B_1$.
MOAA Gunga Bowls, 2023.21
In obtuse triangle $ABC$ where $\angle B > 90^\circ$ let $H$ and $O$ be its orthocenter and circumcenter respectively. Let $D$ be the foot of the altitude from $A$ to $HC$ and $E$ be the foot of the altitude from $B$ to $AC$ such that $O,E,D$ lie on a line. If $OC=8$ and $OE=4$, find the area of triangle $HAB$.
[i]Proposed by Harry Kim[/i]
1997 China National Olympiad, 3
Prove that there are infinitely many natural numbers $n$ such that we can divide $1,2,\ldots ,3n$ into three sequences $(a_n),(b_n)$ and $(c_n)$, with $n$ terms in each, satisfying the following conditions:
i) $a_1+b_1+c_1= a_2+b_2+c_2=\ldots =a_n+b_n+c_n$ and $a_1+b_1+c_1$ is divisible by $6$;
ii) $a_1+a_2+\ldots +a_n= b_1+b_2+\ldots +b_n=c_1+c_2+\ldots +c_n,$ and $a_1+a_2+\ldots +a_n$ is divisible by $6$.
2010 Lithuania National Olympiad, 1
$a,b$ are real numbers such that:
\[ a^3+b^3=8-6ab. \]
Find the maximal and minimal value of $a+b$.
2010 Indonesia TST, 4
Prove that for all integers $ m$ and $ n$, the inequality
\[ \dfrac{\phi(\gcd(2^m \plus{} 1,2^n \plus{} 1))}{\gcd(\phi(2^m \plus{} 1),\phi(2^n \plus{} 1))} \ge \dfrac{2\gcd(m,n)}{2^{\gcd(m,n)}}\]
holds.
[i]Nanang Susyanto, Jogjakarta [/i]