Maria Ivanovna drew on the blackboard a right triangle $ABC$ with a right angle $B$. Three students looked at her and said: $\bullet$ Yura said: "The hypotenuse of this triangle is $10$ cm." $\bullet$ Roma said: "The altitude drawn from the vertex $B$ on the side $AC$ is $6$ cm." $\bullet$ Seva said: "The area of the triangle $ABC$ is $25$ cm$^2$." Determine which of the students was mistaken if it is known that there is exactly one such person.

Let $P(x)=x^3-\tfrac{3}{2}x^2+x+\tfrac{1}{4}$. Let $P^{[1]}(x)=P(x)$, and for $n\ge1$, let $P^{n+1}(x)=P^{[n]}(P(x))$. Evaluate: \[ \displaystyle\int_{0}^{1} P^{[2004]} (x) \ \mathrm{d}x. \]

Given that \[ \frac{\cos(x) \plus{} \cos(y) \plus{} \cos(z)}{\cos(x\plus{}y\plus{}z)} \equal{} \frac{\sin(x)\plus{} \sin(y) \plus{} \sin(z)}{\sin(x \plus{} y \plus{} z)} \equal{} a,\] show that \[ \cos(y\plus{}z) \plus{} \cos(z\plus{}x) \plus{} \cos(x\plus{}y) \equal{} a.\]

$300$ couples (one man, one woman) are invited to a party. Everyone at the party either always tells the truth or always lies. Exactly $2/3$ of the men say their partner always tells the truth and the remaining $1/3$ say their partner always lies. Exactly $2/3$ of the women say their partner is the same type as themselves and the remaining $1/3$ say their partner is different. Find $a$, the maximum possible number of people who tell the truth, and $b$, the minimum possible number of people who tell the truth. Express your answer as $(a,b)$.

Quadrilateral $ABCD$ is inscribed inside a circle with $\angle BAC= 70^{\circ}, \angle ADB= 40^{\circ}, AD=4$, and $BC=6$. What is $AC$? $\textbf{(A) }3+\sqrt{5}\qquad\textbf{(B) }6\qquad\textbf{(C) }\frac{9}{2}\sqrt{2}\qquad\textbf{(D) }8-\sqrt{2}\qquad\textbf{(E) }7$

If $ (a,b)$ and $ (c,d)$ are two points on the line whose equation is $ y\equal{}mx\plus{}k$, then the distance between $ (a,b)$ and $ (c,d)$, in terms of $ a$, $ c$, and $ m$, is $ \textbf{(A)}\ |a\minus{}c|\sqrt{1\plus{}m^2} \qquad \textbf{(B)}\ |a\plus{}c|\sqrt{1\plus{}m^2} \qquad \textbf{(C)}\ \frac{|a\minus{}c|}{\sqrt{1\plus{}m^2}} \qquad$ $ \textbf{(D)}\ |a\minus{}c|(1\plus{}m^2) \qquad \textbf{(E)}\ |a\minus{}c|$ $ |m|$

$1$ cow can produce $3$ gallons of milk each day. How many cows would it take to produce $210$ gallons of milk in a week? $\textbf{(A) } 3\qquad\textbf{(B) } 7\qquad\textbf{(C) } 10\qquad\textbf{(D) } 30\qquad\textbf{(E) } 70$

Let $ABC$ be a triangle with $AB=26$, $AC=28$, $BC=30$. Let $X$, $Y$, $Z$ be the midpoints of arcs $BC$, $CA$, $AB$ (not containing the opposite vertices) respectively on the circumcircle of $ABC$. Let $P$ be the midpoint of arc $BC$ containing point $A$. Suppose lines $BP$ and $XZ$ meet at $M$ , while lines $CP$ and $XY$ meet at $N$. Find the square of the distance from $X$ to $MN$. [i]Proposed by Michael Kural[/i]

In maths class Albrecht had to compute $(a+2b-3)^2$ . His result was $a^2 +4b^2-9$ . ‘This is not correct’ said his teacher, ‘try substituting positive integers for $a$ and $b$.’ Albrecht did so, but his result proved to be correct. What numbers could he substitute? a) Show a good substitution. b) Give all the pairs that Albrecht could substitute and prove that there are no more.

The incircle of the triangle $ABC$ is tangent to sides $AC$ and $BC$ at $M$ and $N$, respectively. The bisectors of the angles at $A$ and $B$ intersect $MN$ at points $P$ and $Q$, respectively. Let $O$ be the incentre of $\triangle ABC$. Prove that $MP\cdot OA=BC\cdot OQ$.

No two of $20$ students in a class have the same scores on both written and oral examinations in mathematics. We say that student $A$ is better than $B$ if his two scores are greater than or equal to the corresponding scores of $B$. The scores are integers between $1$ and $10$. (a) Show that there exist three students $A,B,C$ such that $A$ is better than $B$ and $B$ is better than $C$. (b) Would the same be true for a class of $19$ students?

Let $n$ be a positive integer with $d$ digits, all different from zero. For $k = 0,. . . , d - 1$, we define $n_k$ as the number obtained by moving the last $k$ digits of $n$ to the beginning. For example, if $n = 2184$ then $n_0 = 2184, n_1 = 4218, n_2 = 8421, n_3 = 1842$. For $m$ a positive integer, define $s_m(n)$ as the number of values $k$ ​​such that $n_k$ is a multiple of $m.$ Finally, define $a_d$ as the number of integers $n$ with $d$ digits all nonzero, for which $s_2 (n) + s_3 (n) + s_5 (n) = 2d.$ Find \[\lim_{d \to \infty} \frac{a_d}{5^d}.\]

Let $P(x)=a_nx^n+a_{n-1}x^{n-1}+\cdots+a_0$ and $Q(x)=b_nx^n+b_{n-1}x^{n-1}+\cdots+b_0$ be two polynomials with integral coefficients such that $a_n-b_n$ is a prime and $a_nb_0-a_0b_n\neq 0,$ and $a_{n-1}=b_{n-1}.$ Suppose that there exists a rational number $r$ such that $P(r)=Q(r)=0.$ Prove that $r\in\mathbb Z.$

A function $f(x)$ is such that for any integer $x$, $f(x)+xf(2-x)=6$. Compute $-2019f(2020)$.

A cat is tied to one corner of the base of a tower. The base forms an equilateral triangle of side length $4$ m, and the cat is tied with a leash of length $8$ m. Let $A$ be the area of the region accessible to the cat. If we write $A = \frac{m}{n} k - \sqrt{\ell}$, where $m,n, k, \ell$ are positive integers such that $m$ and $n$ are relatively prime, and $\ell$ is squarefree, what is the value of $m + n + k + \ell$ ?

Find the largest $r$ such that $4$ balls each of radius $r$ can be packed into a regular tetrahedron with side length $1$. In a packing, each ball lies outside every other ball, and every ball lies inside the boundaries of the tetrahedron. If $r$ can be expressed in the form $\frac{\sqrt{a}+b}{c}$ where $a, b, c$ are integers such that $\gcd(b, c) = 1$, what is $a + b + c$?

Determine if there is an infinite sequence $a_1,a_2,a_3,...,a_n$ of positive integers such that for all $n\ge 1$ the sum $a_1^2+a_2^2+a_3^2+...^2+a_n^2$ is a perfect square

Let $a, b, c, d$ be four positive real numbers. Prove that $$\frac{(a + b + c)^2}{a^2+b^2+c^2}+\frac{(b + c + d)^3}{b^3+c^3+d^3}+\frac{(c+d+a)^4}{c^4+d^4+a^4}+\frac{(d+a+b)^5}{d^5+a^5+b^5}\le 120$$

A hunter and an invisible rabbit play a game in the Euclidean plane. The rabbit's starting point, $A_0,$ and the hunter's starting point, $B_0$ are the same. After $n-1$ rounds of the game, the rabbit is at point $A_{n-1}$ and the hunter is at point $B_{n-1}.$ In the $n^{\text{th}}$ round of the game, three things occur in order: [list=i] [*]The rabbit moves invisibly to a point $A_n$ such that the distance between $A_{n-1}$ and $A_n$ is exactly $1.$ [*]A tracking device reports a point $P_n$ to the hunter. The only guarantee provided by the tracking device to the hunter is that the distance between $P_n$ and $A_n$ is at most $1.$ [*]The hunter moves visibly to a point $B_n$ such that the distance between $B_{n-1}$ and $B_n$ is exactly $1.$ [/list] Is it always possible, no matter how the rabbit moves, and no matter what points are reported by the tracking device, for the hunter to choose her moves so that after $10^9$ rounds, she can ensure that the distance between her and the rabbit is at most $100?$ [i]Proposed by Gerhard Woeginger, Austria[/i]

In a group of kids there are $2022$ boys and $2023$ girls. Every girl is a friend with exactly $2021$ boys. Friendship is a symmetric relation: if A is a friend of B, then B is also a friend of A. Prove that it is not possible that all boys have the same number of girl friends. [i]Proposed by the JMMO Problem Selection Committee[/i]

Let $m$ and $n$ be positive integers. A child walks the Cartesian plane taking a few steps. The child begins its journey at the point $(0, n)$ and ends at the point $(m, 0)$ in such a way that: $\bullet$ Each step has length $1$ and is parallel to either the $X$ or $Y$ axis. $\bullet$ For each point $(x, y)$ of its path it is true that $x\ge 0$ and $y\ge 0$. For each step of the child, the distance between the child and the axis to which said step is parallel is calculated. If the step causes the child to be further from the point $(0, 0)$ than before, we consider that distance as positive, otherwise, we consider that distance as negative. Prove that at the end of the boy's journey, the sum of all the distances is $0$.

Let $x, y, z$ be positive real numbers. Prove that: $\frac{x + 2y}{z + 2x + 3y}+\frac{y + 2z}{x + 2y + 3z}+\frac{z + 2x}{y + 2z + 3x} \le \frac{3}{2}$

The venusian prophet Zabruberson sent to his pupils a $ 10000$-letter word, each letter being $ A$ or $ E$: the [i]Zabrubic word[/i]. Their pupils consider then that for $ 1 \leq k \leq 10000$, each word comprised of $ k$ consecutive letters of the Zabrubic word is a [i]prophetic word[/i] of length $ k$. It is known that there are at most $ 7$ prophetic words of lenght $ 3$. Find the maximum number of prophetic words of length $ 10$.

Let $ a$, $ b$, and $ c$ be non-negative real numbers and let $ x$, $ y$, and $ z$ be positive real numbers such that $ a\plus{}b\plus{}c\equal{}x\plus{}y\plus{}z$. Prove that \[ \dfrac{a^3}{x^2}\plus{}\dfrac{b^3}{y^2}\plus{}\dfrac{c^3}{z^2} \ge a\plus{}b\plus{}c.\] [i]Hery Susanto, Malang[/i]

At the $69$ Thailand-Yaranaikian meeting attended by $96$ Thai delegates and a number (unknown) from the Yaranakian country. Some time after the meeting took place, the meeting also discovered something amazing that happened in this meeting!! That is, regardless of whether we select at least $69$ of Thai participants and select all the Yaranikian country participants who are known to Thais in the initial selection group, there is at least $1$ person fo form a minority. They found in that minority, there was always $1$ more Yaranikhians than Thais. Prove that there must be at least $28$ of the Yaranaikian attendees who know the Thai delegates. (Note: In this meeting, none of the attendees were half-breeds. Thai-Yara Nikian) [i](tatari/nightmare)[/i]