Let $ABC$ be a triangle and let $O$ be the centre of its circumscribed circle. Points $X, Y$ which are neither of the points $A, B$ or $C$, lie on the circumscribed circle and are so that the angles $XOY$ and $BAC$ are equal (with the same orientation). Show that the orthocentre of the triangle that is formed by the lines $BY, CX$ and $XY$ is a fixed point.

Find all infinite sequences of real numbers $ \left( a_n \right)_{n\ge 1} $ that verify, for any natural number $ n, $ the inequalities $$ \frac{1}{2\sqrt{a_{n+1}}} <\sqrt{n+1} -\sqrt{n} <\frac{1}{ 2\sqrt{a_n}} . $$

In chess, a knight placed on a chess board can move by jumping to an adjacent square in one direction (up, down, left, or right) then jumping to the next two squares in a perpendicular direction. We then say that a square in a chess board can be attacked by a knight if the knight can end up on that square after a move. Thus, depending on where a knight is placed, it can attack as many as eight squares, or maybe even less. In a $10 \times 10$ chess board, what is the maximum number of knights that can be placed such that each square on the board can be attacked by at most one knight?

There are $n$ players in a round-robin ping-pong tournament (i.e. every two persons will play exactly one game). After some matches have been played, it is known that the total number of matches that have been played among any $n-2$ people is equal to $3^k$ (where $k$ is a fixed integer). Find the sum of all possible values of $n$.

Prove the equality $$\frac{a_1}{a_2(a_1+a_2)}+\frac{a_2}{a_3(a_2+a_3)}+...+\frac{a_n}{a_1(a_n+a_1)}=\frac{a_2}{a_1(a_1+a_2)}+\frac{a_3}{a_2(a_2+a_3)}+...+\frac{a_1}{a_n(a_n+a_1)} $$ (R. Zhenodarov)

Let $ABC$ be an acute triangle. Define $A_1$ the midpoint of the largest arc $BC$ of the circumcircle of $ABC$ . Let $A_2$ and $A_3$ be the feet of the perpendiculars from $A_1$ on the lines $AB$ and $AC$ , respectively. Define $B_1$, $B_2$, $B_3$, $C_1$, $C_2$, and $C_3$ analogously. Show that the lines $A_2A_3$, $B_2B_3$, $C_2C_3$ are concurrent.

Let $ABC$ be a non isosceles triangle inscribed in a circle $(O)$ and $BE, CF$ are two angle bisectors intersect at $I$ with $E$ belongs to segment $AC$ and $F$ belongs to segment $AB$. Suppose that $BE, CF$ intersect $(O)$ at $M,N$ respectively. The line $d_1$ passes through $M$ and perpendicular to $BM$ intersects $(O)$ at the second point $P,$ the line $d_2$ passes through $N$ and perpendicular to $CN$ intersect $(O)$ at the second point $Q$. Denote $H, K$ are two midpoints of $MP$ and $NQ$ respectively. 1. Prove that triangles $IEF$ and $OKH$ are similar. 2. Suppose that S is the intersection of two lines $d_1$ and $d_2$. Prove that $SO$ is perpendicular to $EF$.

Let $\mathbb{R}[x,y]$ denote the set of two-variable polynomials with real coefficients. We say that the pair $(a,b)$ is a [i]zero[/i] of the polynomial $f \in \mathbb{R}[x,y]$ if $f(a,b)=0$. If polynomials $p,q \in \mathbb{R}[x,y]$ have infinitely many common zeros, does it follow that there exists a non-constant polynomial $r \in \mathbb{R}[x,y]$ which is a factor of both $p$ and $q$?

Let $a$, $b$, $c$ be positive reals such that $a+b+c=3$. Show that $$\sqrt{\frac{a}{b+c}} + \sqrt{\frac{b}{c+a}} + \sqrt{\frac{c}{a+b}} \leq \frac{6}{\sqrt(a+b)(b+c)(c+a)}$$

This figure is cut out from a sheet of paper. Folding the sides upwards along the dashed lines, one gets a (non-equilateral) pyramid with a square base. Calculate the area of the base. [img]https://1.bp.blogspot.com/-lPpfHqfMMRY/XzcBIiF-n2I/AAAAAAAAMW8/nPs_mLe5C8srcxNz45Wg-_SqHlRAsAmigCLcBGAsYHQ/s0/2005%2BMohr%2Bp1.png[/img]

On a bookcase there are $ n \geq 3$ books side by side by different authors. A librarian considers the first and second book from left and exchanges them iff they are not alphabetically sorted. Then he is doing the same operation with the second and third book from left etc. Using this procedure he iterates through the bookcase three times from left to right. Considering all possible initial book configurations how many of them will then be alphabetically sorted?

What is the area of a triangle with side lengths $17$, $25$, and $26$? [i]2019 CCA Math Bonanza Lightning Round #3.2[/i]

$(BEL 2) (a)$ Find the equations of regular hyperbolas passing through the points $A(\alpha, 0), B(\beta, 0),$ and $C(0, \gamma).$ $(b)$ Prove that all such hyperbolas pass through the orthocenter $H$ of the triangle $ABC.$ $(c)$ Find the locus of the centers of these hyperbolas. $(d)$ Check whether this locus coincides with the nine-point circle of the triangle $ABC.$

Let $ABC$ be a triangle such that the angular bisector of $\angle BAC$, the $B$-median and the perpendicular bisector of $AB$ intersect at a single point $X$. Let $H$ be the orthocenter of $ABC$. Show that $\angle BXH = 90^{\circ}$. [i]Proposed by usjl[/i]

Let $n \geq 2$ be an integer. A lead soldier is moving across the unit squares of a $n \times n$ grid, starting from the corner square. Before each move to the neighboring square, the lead soldier can (but doesn't need to) turn left or right. Determine the smallest number of turns, which it needs to do, to visit every square of the grid at least once. At the beginning the soldier's back is faced at the edge of the grid.

A circle with radius $5$ is inscribed in a right triangle with hypotenuse $34$ as shown below. What is the area of the triangle? Note that the diagram is not to scale.

Let a neighborhood basis of a point $ x$ of the real line consist of all Lebesgue-measurable sets containing $ x$ whose density at $ x$ equals $ 1$. Show that this requirement defines a topology that is regular but not normal. [i]A. Csaszar[/i]

(V.Protasov, 10--11) In the space, given two intersecting spheres of different radii and a point $ A$ belonging to both spheres. Prove that there is a point $ B$ in the space with the following property: if an arbitrary circle passes through points $ A$ and $ B$ then the second points of its meet with the given spheres are equidistant from $ B$.

Let $p > 10^9$ be a prime number such that $4p + 1$ is also prime. Prove that the decimal expansion of $\frac{1}{4p+1}$ contains all the digits $0,1, \ldots, 9$.

Let $x_1, \ldots , x_{100}$ be nonnegative real numbers such that $x_i + x_{i+1} + x_{i+2} \leq 1$ for all $i = 1, \ldots , 100$ (we put $x_{101 } = x_1, x_{102} = x_2).$ Find the maximal possible value of the sum $S = \sum^{100}_{i=1} x_i x_{i+2}.$ [i]Proposed by Sergei Berlov, Ilya Bogdanov, Russia[/i]

The Bank of Bath issues coins with an $H$ on one side and a $T$ on the other. Harry has $n$ of these coins arranged in a line from left to right. He repeatedly performs the following operation: if there are exactly $k>0$ coins showing $H$, then he turns over the $k$th coin from the left; otherwise, all coins show $T$ and he stops. For example, if $n=3$ the process starting with the configuration $THT$ would be $THT \to HHT \to HTT \to TTT$, which stops after three operations. (a) Show that, for each initial configuration, Harry stops after a finite number of operations. (b) For each initial configuration $C$, let $L(C)$ be the number of operations before Harry stops. For example, $L(THT) = 3$ and $L(TTT) = 0$. Determine the average value of $L(C)$ over all $2^n$ possible initial configurations $C$. [i]Proposed by David Altizio, USA[/i]

Given a $n\times n$ table with non-negative real entries such that the sums of entries in each column and row are equal, a player plays the following game: The step of the game consists of choosing $n$ cells, no two of which share a column or a row, and subtracting the same number from each of the entries of the $n$ cells, provided that the resulting table has all non-negative entries. Prove that the player can change all entries to zeros.

Prove that a convex polyhedron all of whose faces are equilateral triangles has at most $30$ edges.

$p$ and $q$ are distinct prime numbers. Prove that the number \[\frac {(pq-1)!} {p^{q-1}q^{p-1}(p-1)!(q-1)!}\] is an integer.

A ladder is a non-decreasing sequence $a_1, a_2, \dots, a_{2020}$ of non-negative integers. Diego and Pablo play by turns with the ladder $1, 2, \dots, 2020$, starting with Diego. In each turn, the player replaces an entry $a_i$ by $a_i'<a_i$, with the condition that the sequence remains a ladder. The player who gets $(0, 0, \dots, 0)$ wins. Who has a winning strategy? [i]Proposed by Violeta Hernández[/i]