Found problems: 85335
2009 QEDMO 6th, 11
The inscribed circle of a triangle $ABC$ has the center $O$ and touches the triangle sides $BC, CA$ and $AB$ at points $X, Y$ and $Z$, respectively. The parallels to the straight lines $ZX, XY$ and $YZ$ the straight lines $BC, CA$ and $AB$ (in this order!) intersect through the point $O$. Points $K, L$ and $M$. Then the parallels to the straight lines $CA, AB$ and $BC$ intersect through the points $K, L$ and $M$ in one point.
2022 Thailand Mathematical Olympiad, 5
Determine all functions $f:\mathbb{R}\times\mathbb{R}\to\mathbb{R}$ that satisfies the equation
$$f\left(\frac{x+y+z}{3},\frac{a+b+c}{3}\right)=f(x,a)f(y,b)f(z,c)$$
for any real numbers $x,y,z,a,b,c$ such that $az+bx+cy\neq ay+bz+cx$.
2023 South East Mathematical Olympiad, 1
The positive sequence $\{a_n\}$ satisfies:$a_1=1$ and $$a_n=2+\sqrt{a_{n-1}}-2 \sqrt{1+\sqrt{a_{n-1}}}(n\geq 2)$$
Let $S_n=\sum\limits_{k=1}^{n}{2^ka_k}$. Find the value of $S_{2023}$.
1969 Canada National Olympiad, 8
Let $f$ be a function with the following properties:
1) $f(n)$ is defined for every positive integer $n$;
2) $f(n)$ is an integer;
3) $f(2)=2$;
4) $f(mn)=f(m)f(n)$ for all $m$ and $n$;
5) $f(m)>f(n)$ whenever $m>n$.
Prove that $f(n)=n$.
KoMaL A Problems 2022/2023, A. 831
In triangle $ABC$ let $F$ denote the midpoint of side $BC$. Let the circle passing through point $A$ and tangent to side $BC$ at point $F$ intersect sides $AB$ and $AC$ at points $M$ and $N$, respectively. Let the line segments $CM$ and $BN$ intersect in point $X$. Let $P$ be the second point of intersection of the circumcircles of triangles $BMX$ and $CNX$. Prove that points $A, F$ and $P$ are collinear.
Proposed by Imolay András, Budapest
2010 Romania Team Selection Test, 3
Two rectangles of unit area overlap to form a convex octagon. Show that the area of the octagon is at least $\dfrac {1} {2}$.
[i]Kvant Magazine [/i]
2007 Princeton University Math Competition, 2
Find the largest integer $n$ which equals the product of its leading digit and the sum of its digits.
2022 Bosnia and Herzegovina Junior BMO TST, 2
Let $a,b,c$ be positive integers greater than $1$ such that $$p=ab+bc+ac$$ is prime.
A) Prove that $a^2, b^2, c^2$ all have different reminder $mod\ p$.
B) Prove that $a^3, b^3, c^3$ all have different reminder $mod\ p$.
2023 BAMO, 4
Zaineb makes a large necklace from beads labeled $290, 291, \ldots, 2023$. She uses each bead exactly once, arranging the beads in the necklace any order she likes. Prove that no matter how the beads are arranged, there must be three beads in a row whose labels are the side lengths of a triangle.
2022/2023 Tournament of Towns, P3
A pentagon $ABCDE$ is circumscribed about a circle. The angles at the vertices $A{}$, $C{}$ and $E{}$ of the pentagon are equal to $100^\circ$. Find the measure of the angle $\angle ACE$.
2004 Postal Coaching, 10
A convex quadrilateral $ABCD$ has an incircle. In each corner a circle is inscribed that also externally touches the two circles inscribed in the adjacent corners. Show that at least two circles have the same size.
2014 ELMO Shortlist, 1
You have some cyan, magenta, and yellow beads on a non-reorientable circle, and you can perform only the following operations:
1. Move a cyan bead right (clockwise) past a yellow bead, and turn the yellow bead magenta.
2. Move a magenta bead left of a cyan bead, and insert a yellow bead left of where the magenta bead ends up.
3. Do either of the above, switching the roles of the words ``magenta'' and ``left'' with those of ``yellow'' and ``right'', respectively.
4. Pick any two disjoint consecutive pairs of beads, each either yellow-magenta or magenta-yellow, appearing somewhere in the circle, and swap the orders of each pair.
5. Remove four consecutive beads of one color.
Starting with the circle: ``yellow, yellow, magenta, magenta, cyan, cyan, cyan'', determine whether or not you can reach
a) ``yellow, magenta, yellow, magenta, cyan, cyan, cyan'',
b) ``cyan, yellow, cyan, magenta, cyan'',
c) ``magenta, magenta, cyan, cyan, cyan'',
d) ``yellow, cyan, cyan, cyan''.
[i]Proposed by Sammy Luo[/i]
2012 ELMO Shortlist, 4
Let $a_0,b_0$ be positive integers, and define $a_{i+1}=a_i+\lfloor\sqrt{b_i}\rfloor$ and $b_{i+1}=b_i+\lfloor\sqrt{a_i}\rfloor$ for all $i\ge0$. Show that there exists a positive integer $n$ such that $a_n=b_n$.
[i]David Yang.[/i]
I Soros Olympiad 1994-95 (Rus + Ukr), 11.1
Prove that for real $x\ge 1$, holds the inequality
$$\frac{2^x +3^x }{3^x +4^x} \le \frac57$$
2015 China Northern MO, 7
It is known that odd prime numbers $x, y z$ satisfy $$x|(y^5+1),y|(z^5+1),z|(x^5+1).$$ Find the minimum value of the product $xyz$.
2003 National Olympiad First Round, 11
What is the probability of having no $B$ before the first $A$ in a random permutation of the word $\text{ABRAKADABRA}$?
$
\textbf{(A)}\ \dfrac 23
\qquad\textbf{(B)}\ \dfrac 57
\qquad\textbf{(C)}\ \dfrac 56
\qquad\textbf{(D)}\ \dfrac 67
\qquad\textbf{(E)}\ \text{None of the preceding}
$
1976 IMO Longlists, 18
Prove that the number $19^{1976} + 76^{1976}$:
$(a)$ is divisible by the (Fermat) prime number $F_4 = 2^{2^4} + 1$;
$(b)$ is divisible by at least four distinct primes other than $F_4$.
2011 Harvard-MIT Mathematics Tournament, 6
Let $ABCD$ be a cyclic quadrilateral, and suppose that $BC = CD = 2$. Let $I$ be the incenter of triangle $ABD$. If $AI = 2$ as well, find the minimum value of the length of diagonal $BD$.
2012 IMAR Test, 1
Let $K$ be a convex planar set, symmetric about a point $O$, and let $X, Y , Z$ be three points in $K$. Show that $K$ contains the head of one of the vectors $\overrightarrow{OX} \pm \overrightarrow{OY} , \overrightarrow{OX} \pm \overrightarrow{OZ}, \overrightarrow{OY} \pm \overrightarrow{OZ}$.
1970 Poland - Second Round, 5
Given the polynomial $ P(x) = \frac{1}{2} - \frac{1}{3}x + \frac{1}{6}x^2 $. Let $ Q(x) = \sum_{k=0}^{m} b_k x^k $ be a polynomial given by $$ Q(x) = P(x) \cdot P(x^3) \cdot P(x^9) \cdot P(x^{27}) \cdot P(x^{81}).
$$
Calculate $ \sum_{k=0}^m |b_k| $.
2023 Moldova Team Selection Test, 8
Let $ABC$ be an acute triangle with orthocenter $ H $ and $AB<AC.$ Let $\Omega_1$ be a circle with diameter $AC$ and $\Omega_2$ a circle with diameter $ AB.$ Line $BH$ intersects $\Omega_1$ in points $ D $ and $E$ such that $E$ is not on segment $BH.$ Line $ CH $ intersects $\Omega_2$ in points $ F $ and $G$ such that $G$ is not on segment $CH.$ Prove that the lines $EG, DF$ and $BC$ are concurrent.
2001 Argentina National Olympiad, 4
Find all positive integers $k$ that can be expressed as the sum of $50$ fractions such that the numerators are the $50$ natural numbers from $1$ to $50$ and the denominators are positive integers, that is, $k = \dfrac{1}{a_1} + \dfrac{2}{a_2} + \ldots + \dfrac{50}{a_{50}}$ with a$_1 , a_2 , \ldots , a_n$ positive integers.
2014 Junior Balkan Team Selection Tests - Romania, 4
In the acute triangle $ABC$, with $AB \ne BC$, let $T$ denote the midpoint of the side $[AC], A_1$ and $C_1$ denote the feet of the altitudes drawn from $A$ and $C$, respectively. Let $Z$ be the intersection point of the tangents in $A$ and $C $ to the circumcircle of triangle $ABC, X$ be the intersection point of lines $ZA$ and $A_1C_1$ and $Y$ be the intersection point of lines $ZC$ and $A_1C_1$.
a) Prove that $T$ is the incircle of triangle $XYZ$.
b) The circumcircles of triangles $ABC$ and $A_1BC_1$ meet again at $D$. Prove that the orthocenter $H$ of triangle $ABC$ is on the line $TD$.
c) Prove that the point $D$ lies on the circumcircle of triangle $XYZ$.
2021 Czech-Polish-Slovak Junior Match, 5
A regular heptagon $ABCDEFG$ is given. The lines $AB$ and $CE$ intersect at $ P$. Find the measure of the angle $\angle PDG$.
KoMaL A Problems 2023/2024, A. 875
$ a)$ Two players play a cooperative game. They can discuss a strategy prior to the game, however, they cannot communicate and have no information about the other player during the game. The game master chooses one of the players in each round. The player on turn has to guess the number of the current round. Players keep note of the number of rounds they were chosen, however, they have no information about the other player's rounds. If the player's guess is correct, the players are awarded a point. Player's are not notified whether they've scored or not. The players win the game upon collecting 100 points. Does there exist a strategy with which they can surely win the game in a finite number of rounds?
$b)$ How does this game change, if in each round the player on turn has two guesses instead of one, and they are awarded a point if one of the guesses is correct (while keeping all the other rules of the game the same)?
[i]Proposed by Gábor Szűcs, Budapest[/i]