Found problems: 85335
2021 Israel TST, 3
In an inscribed quadrilateral $ABCD$, we have $BC=CD$ but $AB\neq AD$. Points $I$ and $J$ are the incenters of triangles $ABC$ and $ACD$ respectively. Point $K$ was chosen on segment $AC$ so that $IK=JK$. Points $M$ and $N$ are the incenters of triangles $AIK$ and $AJK$. Prove that the perpendicular to $CD$ at $D$ and the perpendicular to $KI$ at $I$ intersect on the circumcircle of $MAN$.
2010 CIIM, Problem 4
Let $f:[0,1] \to [0,1]$ a increasing continuous function, diferentiable in $(0,1)$ and with derivative smaller than 1 in every point. The sequence of sets $A_1,A_2,A_3,\dots$ is define as: $A_1 = f([0,1])$, and for $n \geq 2, A_n = f(A_{n-1}).$ Prove that $\displaystyle \lim_{n\to+\infty} d(A_n) = 0$, where $d(A)$ is the diameter of the set $A$.
Note: The diameter of a set $X$ is define as $d(X) = \sup_{x,y\in X} |x-y|.$
2022 CCA Math Bonanza, I13
Let triangle $A_1BC$ have sides $A_1B=5$, $A_1C=12$, and $BC=13$. For all natural numbers $i$, let $B_i$ be the foot of the altitude from $A_i$ to $BC$, let $A_{2i}$ be the foot of the altitude from $B_i$ to $A_1B$, and let $A_{2i+1}$ be the foot of the altitude from $B_i$ to $A_1C$.
\[ \sum_{i=1}^{7}A_iB_i = \frac{p}{q}\]
Find $p+q$.
[i]2022 CCA Math Bonanza Individual Round #13[/i]
2005 Denmark MO - Mohr Contest, 3
The point $P$ lies inside $\vartriangle ABC$ so that $\vartriangle BPC$ is isosceles, and angle $P$ is a right angle. Furthermore both $\vartriangle BAN$ and $\vartriangle CAM$ are isosceles with a right angle at $A$, and both are outside $\vartriangle ABC$. Show that $\vartriangle MNP$ is isosceles and right-angled.
[img]https://1.bp.blogspot.com/-i9twOChu774/XzcBLP-RIXI/AAAAAAAAMXA/n5TJCOJypeMVW28-9GDG4st5C47yhvTCgCLcBGAsYHQ/s0/2005%2BMohr%2Bp3.png[/img]
2021 Indonesia MO, 7
Given $\triangle ABC$ with circumcircle $\ell$. Point $M$ in $\triangle ABC$ such that $AM$ is the angle bisector of $\angle BAC$. Circle with center $M$ and radius $MB$ intersects $\ell$ and $BC$ at $D$ and $E$ respectively, $(B \not= D, B \not= E)$. Let $P$ be the midpoint of arc $BC$ in $\ell$ that didn't have $A$. Prove that $AP$ angle bisector of $\angle DPE$ if and only if $\angle B = 90^{\circ}$.
1994 AMC 8, 10
For how many positive integer values of $N$ is the expression $\dfrac{36}{N+2}$ an integer?
$\text{(A)}\ 7 \qquad \text{(B)}\ 8 \qquad \text{(C)}\ 9 \qquad \text{(D)}\ 10 \qquad \text{(E)}\ 12$
2009 China Western Mathematical Olympiad, 3
A total of $n$ people compete in a mathematical match which contains $15$ problems where $n>12$. For each problem, $1$ point is given for a right answer and $0$ is given for a wrong answer. Analysing each possible situation, we find that if the sum of points every group of $12$ people get is no less than $36$, then there are at least $3$ people that got the right answer of a certain problem, among the $n$ people. Find the least possible $n$.
2005 Regional Competition For Advanced Students, 4
Prove: if an infinte arithmetic sequence ($ a_n\equal{}a_0\plus{}nd$) of positive real numbers contains two different powers of an integer $ a>1$, then the sequence contains an infinite geometric sequence ($ b_n\equal{}b_0q^n$) of real numbers.
VII Soros Olympiad 2000 - 01, 10.6
A circle is inscribed in triangle $ABC$. $M$ and $N$ are the points of its tangency with the sides $BC$ and $CA$, respectively. The segment $AM$ intersects $BN$ at point $P$ and the inscribed circle at point $Q$. It is known that $MP = a$, $PQ = b$. Find $AQ$.
2018 Taiwan TST Round 3, 6
For any finite sets $X$ and $Y$ of positive integers, denote by $f_X(k)$ the $k^{\text{th}}$ smallest positive integer not in $X$, and let $$X*Y=X\cup \{ f_X(y):y\in Y\}.$$Let $A$ be a set of $a>0$ positive integers and let $B$ be a set of $b>0$ positive integers. Prove that if $A*B=B*A$, then $$\underbrace{A*(A*\cdots (A*(A*A))\cdots )}_{\text{ A appears $b$ times}}=\underbrace{B*(B*\cdots (B*(B*B))\cdots )}_{\text{ B appears $a$ times}}.$$
[i]Proposed by Alex Zhai, United States[/i]
2006 Tournament of Towns, 1
There is a billiard table in shape of rectangle $2 \times 1$, with pockets at its corners and at midpoints of its two largest sizes. Find the minimal number of balls one has to place on the table interior so that any pocket is on a straight line with some two balls. (Assume that pockets and balls are points).
[i](4 points)[/i]
1998 Korea - Final Round, 2
Let $I$ be the incenter of triangle $ABC$, $O_1$ a circle through $B$ tangent to $CI$, and $O_2$ a circle through $C$ tangent to $BI$. Prove that $O_1$,$O_2$ and the circumcircle of $ABC$ have a common point.
2010 LMT, 2
J has $53$ cheetahs in his hair, which he will put in $10$ cages. Let $A$ be the number of cheetahs in the cage with the largest number of cheetahs (there could be a tie, but in this case take the number of cheetahs in one of the cages involved in the tie). Find the least possible value of $A.$
2022 BMT, 8
Seven equally-spaced points are drawn on a circle of radius $1$. Three distinct points are chosen uniformly at random. What is the probability that the center of the circle lies in the triangle formed by the three points?
2006 Kyiv Mathematical Festival, 4
See all the problems from 5-th Kyiv math festival [url=http://www.mathlinks.ro/Forum/viewtopic.php?p=506789#p506789]here[/url]
Let $a, b, c, d$ be positive integers and $p$ be prime number such that $a^2+b^2=p$ and $c^2+d^2$ is divisible by $p.$ Prove that there exist positive integers $e$ and $f$ such that $e^2+f^2=\frac{c^2+d^2}{p}.$
1992 IMO Longlists, 33
Let $a, b, c$ be positive real numbers and $p, q, r$ complex numbers. Let $S$ be the set of all solutions $(x, y, z)$ in $\mathbb C$ of the system of simultaneous equations
\[ax + by + cz = p,\]\[ax2 + by2 + cz2 = q,\]\[ax3 + bx3 + cx3 = r.\]
Prove that $S$ has at most six elements.
Math Hour Olympiad, Grades 8-10, 2019
[u]Round 1[/u]
[b]p1.[/b] The alphabet of the Aau-Bau language consists of two letters: A and B. Two words have the same meaning if one of them can be constructed from the other by replacing any AA with A, replacing any BB with B, or by replacing any ABA with BAB. For example, the word AABA means the same thing as ABA, and AABA also means the same thing as ABAB. In this language, is it possible to name all seven days of the week?
[b]p2.[/b] A museum has a $4\times 4$ grid of rooms. Every two rooms that share a wall are connected by a door. Each room contains some paintings. The total number of paintings along any path of $7$ rooms from the lower left to the upper right room is always the same. Furthermore, the total number of paintings along any path of $7$ rooms from the lower right to the upper left room is always the same. The guide states that the museum has exactly $500$ paintings. Show that the guide is mistaken.
[img]https://cdn.artofproblemsolving.com/attachments/7/6/0fd93a0deaa71a5bb1599d2488f8b4eac5d0eb.jpg[/img]
[b]p3.[/b] A playground has a swing-set with exactly three swings. When 3rd and 4th graders from Dr. Anna’s math class play during recess, she has a rule that if a $3^{rd}$ grader is in the middle swing there must be $4^{th}$ graders on that person’s left and right. And if there is a $4^{th}$ grader in the middle, there must be $3^{rd}$ graders on that person’s left and right. Dr. Anna calculates that there are $350$ different ways her students can arrange themselves on the three swings with no empty seats. How many students are in her class?
[img]https://cdn.artofproblemsolving.com/attachments/5/9/4c402d143646582376d09ebbe54816b8799311.jpg[/img]
[b]p4.[/b] The archipelago Artinagos has $19$ islands. Each island has toll bridges to at least $3$ other islands. An unsuspecting driver used a bad mapping app to plan a route from North Noether Island to South Noether Island, which involved crossing $12$ bridges. Show that there must be a route with fewer bridges.
[img]https://cdn.artofproblemsolving.com/attachments/e/3/4eea2c16b201ff2ac732788fe9b78025004853.jpg[/img]
[b]p5.[/b] Is it possible to place the numbers from $1$ to $121$ in an $11\times 11$ table so that numbers that differ by $1$ are in horizontally or vertically adjacent cells and all the perfect squares $(1, 4, 9, ... , 121)$ are in one column?
[u]Round 2[/u]
[b]p6.[/b] Hungry and Sneaky have opened a rectangular box of chocolates and are going to take turns eating them. The chocolates are arranged in a $2m \times 2n$ grid. Hungry can take any two chocolates that are side-by-side, but Sneaky can take only one at a time. If there are no more chocolates located side-by-side, all remaining chocolates go to Sneaky. Hungry goes first. Each player wants to eat as many chocolates as possible. What is the maximum number of chocolates Sneaky can get, no matter how Hungry picks his?
[img]https://cdn.artofproblemsolving.com/attachments/b/4/26d7156ca6248385cb46c6e8054773592b24a3.jpg[/img]
[b]p7.[/b] There is a thief hiding in the sultan’s palace. The palace contains $2019$ rooms connected by doors. One can walk from any room to any other room, possibly through other rooms, and there is only one way to do this. That is, one cannot walk in a loop in the palace. To catch the thief, a guard must be in the same room as the thief at the same time. Prove that $11$ guards can always find and catch the thief, no matter how the thief moves around during the search.
[img]https://cdn.artofproblemsolving.com/attachments/a/b/9728ac271e84c4954935553c4d58b3ff4b194d.jpg[/img]
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
2006 Romania Team Selection Test, 3
Let $\gamma$ be the incircle in the triangle $A_0A_1A_2$. For all $i\in\{0,1,2\}$ we make the following constructions (all indices are considered modulo 3): $\gamma_i$ is the circle tangent to $\gamma$ which passes through the points $A_{i+1}$ and $A_{i+2}$; $T_i$ is the point of tangency between $\gamma_i$ and $\gamma$; finally, the common tangent in $T_i$ of $\gamma_i$ and $\gamma$ intersects the line $A_{i+1}A_{i+2}$ in the point $P_i$. Prove that
a) the points $P_0$, $P_1$ and $P_2$ are collinear;
b) the lines $A_0T_0$, $A_1T_1$ and $A_2T_2$ are concurrent.
2007 Stanford Mathematics Tournament, 1
Find all real roots of $f$ if $f(x^{1/9})=x^2-3x-4$.
2019 Jozsef Wildt International Math Competition, W. 58
In the $[ABCD]$ tetrahedron having all the faces acute angled triangles, is denoted by $r_X$, $R_X$ the radius lengths of the circle inscribed and circumscribed respectively on the face opposite to the $X \in \{A,B,C,D\}$ peak, and with $R$ the length of the radius of the sphere circumscribed to the tetrahedron. Show that inequality occurs$$8R^2 \geq (r_A + R_A)^2 + (r_B + R_B)^2 + (r_C + R_C)^2 + (r_D + R_D)^2$$
2009 All-Russian Olympiad, 5
Given strictly increasing sequence $ a_1<a_2<\dots$ of positive integers such that each its term $ a_k$ is divisible either by 1005 or 1006, but neither term is divisible by $ 97$. Find the least possible value of maximal difference of consecutive terms $ a_{i\plus{}1}\minus{}a_i$.
2020-2021 OMMC, 15
A point $X$ exactly $\sqrt{2}-\frac{\sqrt{6}}{3}$ away from the origin is chosen randomly. A point $Y$ less than $4$ away from the origin is chosen randomly. The probability that a point $Z$ less than $2$ away from the origin exists such that $\triangle XYZ$ is an equilateral triangle can be expressed as $\frac{a\pi + b}{c \pi}$ for some positive integers $a, b, c$ with $a$ and $c$ relatively prime. Find $a+b+c$.
2002 Vietnam Team Selection Test, 1
Let $n\geq 2$ be an integer and consider an array composed of $n$ rows and $2n$ columns. Half of the elements in the array are colored in red. Prove that for each integer $k$, $1<k\leq \dsp \left\lfloor \frac n2\right\rfloor+1$, there exist $k$ rows such that the array of size $k\times 2n$ formed with these $k$ rows has at least
\[ \frac { k! (n-2k+2) } {(n-k+1)(n-k+2)\cdots (n-1)} \] columns which contain only red cells.
2014 Contests, 3
Let $n$ be an even positive integer, and let $G$ be an $n$-vertex graph with exactly $\tfrac{n^2}{4}$ edges, where there are no loops or multiple edges (each unordered pair of distinct vertices is joined by either 0 or 1 edge). An unordered pair of distinct vertices $\{x,y\}$ is said to be [i]amicable[/i] if they have a common neighbor (there is a vertex $z$ such that $xz$ and $yz$ are both edges). Prove that $G$ has at least $2\textstyle\binom{n/2}{2}$ pairs of vertices which are amicable.
[i]Zoltán Füredi (suggested by Po-Shen Loh)[/i]
2004 USAMO, 2
Suppose $a_1, \dots, a_n$ are integers whose greatest common divisor is 1. Let $S$ be a set of integers with the following properties:
(a) For $i=1, \dots, n$, $a_i \in S$.
(b) For $i,j = 1, \dots, n$ (not necessarily distinct), $a_i - a_j \in S$.
(c) For any integers $x,y \in S$, if $x+y \in S$, then $x-y \in S$.
Prove that $S$ must be equal to the set of all integers.