Given an acute triangle $ABC$. $\Gamma _{B}$ is a circle that passes through $AB$, tangent to $AC$ at $A$ and centered at $O_{B}$. Define $\Gamma_C$ and $O_C$ the same way. Let the altitudes of $\triangle ABC$ from $B$ and $C$ meets the circumcircle of $\triangle ABC$ at $X$ and $Y$, respectively. Prove that $A$, the midpoint of $XY$ and the midpoint of $O_{B}O_{C}$ is collinear.

We match sets $ M$ of points in the coordinate plane to sets $ M*$ according to the rule that $ (x*,y*) \in M*$ if and only if $ x \cdot x* \plus{} y \cdot y* \leq 1$ whenever $ (x,y) \in M.$ Find all triangles $ Q$ such that $ Q*$ is the reflection of $ Q$ in the origin.

It is known that at least one coordinate of the center $(x_0, y_0)$ of the circle $(x -x_0)^2+ (y -y_0)^2 = R^2$ is irrational. Prove that on the circle itself there are at most two points with rational coordinates.

In acute triangle $ABC$ ($AB \neq AC$), $I$ is its incenter and $J$ is the $A$-excenter. $X, Y$ are on minor arcs $\widehat{AB}$ and $\widehat{AC}$ respectively such that $\angle{AXI}=\angle{AYJ}=90^{\circ}$. $K$ is on line $BC$ such that $KI=KJ$. Proof that line $AK$ bisects $\overline{XY}$.

Find all positive integers $n$ for which $2^n + 2021n$ is a perfect square.

Let $ABC$ be a scalene triangle and let $P$ and $Q$ be two distinct points in its interior. Suppose that the angle bisectors of $\angle PAQ,\,\angle PBQ,$ and $\angle PCQ$ are the altitudes of triangle $ABC$. Prove that the midpoint of $\overline{PQ}$ lies on the Euler line of $ABC$. (The Euler line is the line through the circumcenter and orthocenter of a triangle.) [i]Proposed by Holden Mui[/i]

Rhombus $ABCD$ has $\angle BAD<90^{\circ}$. There is a point $P$ on the incircle of the rhombus such that the distances from $P$ to lines $DA$, $AB$, and $BC$ are $9$, $5$, and $16$, respectively. Find the perimeter of $ABCD$.

Let $M$ be a set of six distinct positive integers whose sum is $60$. These numbers are written on the faces of a cube, one number to each face. A [i]move[/i] consists of choosing three faces of the cube that share a common vertex and adding $1$ to the numbers on those faces. Determine the number of sets $M$ for which it’s possible, after a finite number of moves, to produce a cube all of whose sides have the same number.

Two ants sit at the vertex of the parabola $y = x^2$. One starts walking northeast (i.e., upward along the line $y = x$ and the other starts walking northwest (i.e., upward along the line $y = -x$). Each time they reach the parabola again, they swap directions and continue walking. Both ants walk at the same speed. When the ants meet for the eleventh time (including the time at the origin), their paths will enclose 10 squares. What is the total area of these squares?

If the sum of any $10$ of $21$ real numbers is less than the sum of remaining $11$ of them, at least how many of these $21$ numbers are positive? $ \textbf{(A)}\ 18 \qquad\textbf{(B)}\ 19 \qquad\textbf{(C)}\ 20 \qquad\textbf{(D)}\ 21 \qquad\textbf{(E)}\ \text{None of the preceding} $

Show that there are no 2-tuples $ (x,y)$ of positive integers satisfying the equation $ (x+1) (x+2)\cdots (x+2014)= (y+1) (y+2)\cdots (y+4028).$

a) Let $n$ be a positive integer. Prove that $ n\sqrt {x-n^2}\leq \frac {x}{2}$ , for $x\geq n^2$. b) Find real $x,y,z$ such that: $ 2\sqrt {x-1} +4\sqrt {y-4} + 6\sqrt {z-9} = x+y+z$

The lengths of the sides $a, b$ and $c$ of a right triangle satisfy the relations $a <b <c$, and $\alpha$ is the measure of the smallest angle of the triangle. For which real values $k$ the equation $ax^2 + bx + kc = 0$ has real solutions for any measure of the angle $\alpha$ not exceeding $18^o$

Let $S$ be a shape in the plane which is obtained as a union of finitely many unit squares. Prove that the ratio of the perimeter and the area of $S$ is at most $8$.

Let's call the positive integer $x$ interesting, if there exists integer $y$ such that the following equation holds: $(x + y)^y = (x - y)^x.$ Suppose we list all interesting integers in increasing order. An interesting integer is considered very interesting if it is not relatively prime with any other interesting integer preceding it. Find the second very interesting integer. [i]Note: It is assumed that the first interesting integer is not very interesting.[/i] [i]Proposed by Zurab Aghdgomelashvili, Georgia[/i]

There is a game. The magician let the participant think up a positive integer (at least two digits). For example, an integer $ \displaystyle\overline{a_1a_2 \cdots a_n}$ is rearranged as $ \overline{a_{i_1}a_{i_2} \cdots a_{i_n}}$, that is, $ i_1, i_2, \cdots, i_n$ is a permutation of $ 1,2, \cdots, n$. Then we get $ n!\minus{}1$ integers. The participant is asked to calculate the sum of the $ n!\minus{}1$ numbers, then tell the magician the sum $ S$. The magician claims to be able to know the original number when he is told the sum $ S$. Try to decide whether the magician can be successful or not.

[asy] size(140); import geometry; dot((0,0));label("$(0,0)$",(0,0),SW); dot((4,3)); dot((5,4));label("$(5,4)$",(5,4),NE); draw((0,0)--(7,0), EndArrow); draw((0,0)--(0,6), EndArrow); add(grid(5,4)); [/asy] A leprechaun wishes to travel from the origin to a pot of gold located at the coordinate point $(5,4)$. If she can only move upwards and rightwards along the unit grid, must pass a checkpoint at $(1,2)$, and must avoid an evil thief at $(4,3)$, how many distinct paths can she take? $\textbf{(A) }7\qquad\textbf{(B) }15\qquad\textbf{(C) }21\qquad\textbf{(D) }45\qquad\textbf{(E) }126$

Jenn randomly chooses a number $J$ from $1, 2, 3,\ldots, 19, 20$. Bela then randomly chooses a number $B$ from $1, 2, 3,\ldots, 19, 20$ distinct from $J$. The value of $B - J$ is at least $2$ with a probability that can be expressed in the form $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

The sum of the angles on the bigger base of a trapezoid is $90^o$. Prove that the line segment whose ends are the midpoints of the bases, is equal to the line segment whose ends are the midpoints of the diagonals.

Find all positive integers $n\geq1$ such that there exists a pair $(a,b)$ of positive integers, such that $a^2+b+3$ is not divisible by the cube of any prime, and $$n=\frac{ab+3b+8}{a^2+b+3}.$$

Let $n$ be a positive integer, and $x$ be a positive real number. Prove that $$\sum_{k=1}^{n} \left( x \left[\frac{k}{x}\right] - (x+1)\left[\frac{k}{x+1}\right]\right) \leq n,$$ where $[x]$ denotes the largest integer not exceeding $x$.

(A.Zaslavsky) Given two triangles $ ABC$, $ A'B'C'$. Denote by $ \alpha$ the angle between the altitude and the median from vertex $ A$ of triangle $ ABC$. Angles $ \beta$, $ \gamma$, $ \alpha'$, $ \beta'$, $ \gamma'$ are defined similarly. It is known that $ \alpha \equal{} \alpha'$, $ \beta \equal{} \beta'$, $ \gamma \equal{} \gamma'$. Can we conclude that the triangles are similar?

Given a sequence $a_1,a_2,\ldots $ of non-negative real numbers satisfying the conditions: 1. $a_n + a_{2n} \geq 3n$; 2. $a_{n+1}+n \leq 2\sqrt{a_n \left(n+1\right)}$ for all $n\in\mathbb N$ (where $\mathbb N=\left\{1,2,3,...\right\}$). (1) Prove that the inequality $a_n \geq n$ holds for every $n \in \mathbb N$. (2) Give an example of such a sequence.

Six different-sized cubes are glued together, one on top of the other. The bottom cube has edge length $8$. Each of the other cubes has four vertices at the midpoints of the edges of the cube below it as shown. The entire solid is then dipped in red paint. What is the total area of the red-painted surface on the solid? (will insert image here later) $\text{(A) }630\qquad\text{(B) }632\qquad\text{(C) }648\qquad\text{(D) }694\qquad\text{(E) }756$

Let $ A_0 \equal{} (a_1,\dots,a_n)$ be a finite sequence of real numbers. For each $ k\geq 0$, from the sequence $ A_k \equal{} (x_1,\dots,x_k)$ we construct a new sequence $ A_{k \plus{} 1}$ in the following way. 1. We choose a partition $ \{1,\dots,n\} \equal{} I\cup J$, where $ I$ and $ J$ are two disjoint sets, such that the expression \[ \left|\sum_{i\in I}x_i \minus{} \sum_{j\in J}x_j\right| \] attains the smallest value. (We allow $ I$ or $ J$ to be empty; in this case the corresponding sum is 0.) If there are several such partitions, one is chosen arbitrarily. 2. We set $ A_{k \plus{} 1} \equal{} (y_1,\dots,y_n)$ where $ y_i \equal{} x_i \plus{} 1$ if $ i\in I$, and $ y_i \equal{} x_i \minus{} 1$ if $ i\in J$. Prove that for some $ k$, the sequence $ A_k$ contains an element $ x$ such that $ |x|\geq\frac n2$. [i]Author: Omid Hatami, Iran[/i]