Prove that the number $99999+111111\sqrt{3}$ cannot be written in the form $(A+B\sqrt{3})^2$, where $A$ and $B$ are integers.

In convex quadrilateral $ ABCD$, $ CB,DA$ are external angle bisectors of $ \angle DCA,\angle CDB$, respectively. Points $ E,F$ lie on the rays $ AC,BD$ respectively such that $ CEFD$ is cyclic quadrilateral. Point $ P$ lie in the plane of quadrilateral $ ABCD$ such that $ DA,CB$ are external angle bisectors of $ \angle PDE,\angle PCF$ respectively. $ AD$ intersects $ BC$ at $ Q.$ Prove that $ P$ lies on $ AB$ if and only if $ Q$ lies on segment $ EF$.

Show that the equation $x^2 \cdot (x - 1)^2 \cdot (x - 2)^2 \cdot ... \cdot (x - 1008)^2 \cdot (x- 1009)^2 = c$ has $2020$ real solutions, provided $0 < c <\frac{(1009 \cdot1007 \cdot ... \cdot 3\cdot 1)^4}{2^{2020}}$ .

What is the least number of rooks that can be placed on a standard $8 \times 8$ chessboard so that all the white squares are attacked? (A rook also attacks the square it is on, in addition to every other square in the same row or column.)

A frog is hopping from $(0,0)$ to $(8,8)$. The frog can hop from $(x,y)$ to either $(x+1,y)$ or $(x,y+1)$. The frog is only allowed to hop to point $(x,y)$ if $|y-x|\leq1$. Compute the number of distinct valid paths the frog can take.

Let $n$ be the smallest integer such that the sum of digits of $n$ is divisible by $5$ as well as the sum of digits of $(n+1)$ is divisible by $5$. What are the first two digits of $n$ in the same order.

Given a positive integer $n$, it can be shown that every complex number of the form $r+si$, where $r$ and $s$ are integers, can be uniquely expressed in the base $-n+i$ using the integers $1,2,\ldots,n^2$ as digits. That is, the equation\[ r+si=a_m(-n+i)^m+a_{m-1}(-n+i)^{m-1}+\cdots +a_1(-n+i)+a_0 \]is true for a unique choice of non-negative integer $m$ and digits $a_0,a_1,\ldots,a_m$ chosen from the set $\{0,1,2,\ldots,n^2\}$, with $a_m\ne 0$. We write \[ r+si=(a_ma_{m-1}\ldots a_1a_0)_{-n+i} \]to denote the base $-n+i$ expansion of $r+si$. There are only finitely many integers $k+0i$ that have four-digit expansions \[ k=(a_3a_2a_1a_0)_{-3+i}~~~~a_3\ne 0. \]Find the sum of all such $k$.

In triangle $ABC$ points $M$ and $N$ are the midpoints of sides $AC$ and $AB$, respectively and $D$ is the projection of $A$ into $BC$. Point $O$ is the circumcenter of $ABC$ and circumcircles of $BOC$, $DMN$ intersect at points $R, T$. Lines $DT$, $DR$ intersect line $MN$ at $E$ and $F$, respectively. Lines $CT$, $BR$ intersect at $K$. A point $P$ lies on $KD$ such that $PK$ is the angle bisector of $\angle BPC$. Prove that the circumcircles of $ART$ and $PEF$ are tangent. [i]Proposed by Mehran Talaei - Iran[/i]

Find the minimal positive integer $n$ such that no matter what $n$ distinct numbers from $1$ to $1000$ you choose, such that no two are divisible by a square of the same prime, one of the chosen numbers is a square of prime. [i]D. Zmiaikou[/i]

There are $n$ assassins numbered from $1$ to $n,$ and all assasins are initially alive. The assassins play a game in which they take turns in increasing order of number, with assassin $1$ getting the first turn, then assassin $2$, etc., with the order repeating after assassin $n$ has gone; if an assassin is dead when their turn comes up, then their turn is skipped and it goes to the next assassin in line. On each assassin’s turn, they can choose to either kill the assassin who would otherwise move next or to do nothing. Each assassin will kill on their turn unless the only option for guaranteeing their own survival is to do nothing. If there are $2023$ assassins at the start of the game, after an entire round of turns in which no one kills, how many assassins must remain?

The number $2019$ is written on a blackboard. Every minute, if the number $a$ is written on the board, Evan erases it and replaces it with a number chosen from the set $$ \left\{ 0, 1, 2, \ldots, \left\lceil 2.01 a \right\rceil \right\} $$ uniformly at random. Is there an integer $N$ such that the board reads $0$ after $N$ steps with at least $99\%$ probability?

A chocolate bar in the shape of an equilateral triangle with side of the length $n$, consists of triangular chips with sides of the length $1$, parallel to sides of the bar. Two players take turns eating up the chocolate. Each player breaks off a triangular piece (along one of the lines), eats it up and passes leftovers to the other player (as long as bar contains more than one chip, the player is not allowed to eat it completely). A player who has no move or leaves exactly one chip to the opponent, loses. For each $n$, find who has a winning strategy.

Triangle $ ABC$ has side lengths $ AB \equal{} 5$, $ BC \equal{} 6$, and $ AC \equal{} 7$. Two bugs start simultaneously from $ A$ and crawl along the sides of the triangle in opposite directions at the same speed. They meet at point $ D$. What is $ BD$? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$

Serena has written 20 copies of the number 1 on a board. In a move, she is allowed to $\quad *$ erase two of the numbers and replace them with their sum, or $\quad *$ erase one number and replace it with its reciprocal. Whenever a fraction appears on the board, Serena writes it in simplest form. Prove that Serena can never write a fraction less than 1 whose numerator is over 9000, regardless of the number of moves she makes.

For $x,y,z > 0$ and $xyz=1$, prove that \[\frac{x^{9}+y^{9}}{x^{6}+x^{3}y^{3}+y^{6}}+\frac{x^{9}+z^{9}}{x^{6}+x^{3}z^{3}+z^{6}}+\frac{y^{9}+z^{9}}{y^{6}+y^{3}z^{3}+z^{6}}\geq 2\]

Define mutually externally tangent circles $\omega_1$, $\omega_2$, and $\omega_3$. Let $\omega_1$ and $\omega_2$ be tangent at $P$. The common external tangents of $\omega_1$ and $\omega_2$ meet at $Q$. Let $O$ be the center of $\omega_3$. If $QP = 420$ and $QO = 427$, find the radius of $\omega_3$. [i]Proposed by Tanishq Pauskar and Mahith Gottipati[/i]

Find the maximum number of points on a sphere of radius $1$ in $\mathbb{R}^n$ such that the distance between any two of these points is strictly greater than $\sqrt{2}$.

A regular hexagon is inscribed in a circle of radius $ 10$ inches. Its area is: $ \textbf{(A)}\ 150\sqrt{3} \text{ sq. in.} \qquad \textbf{(B)}\ \text{150 sq. in.} \qquad \textbf{(C)}\ 25\sqrt{3} \text{ sq. in.} \qquad \textbf{(D)}\ \text{600 sq. in.} \qquad \textbf{(E)}\ 300\sqrt{3} \text{ sq. in.}$

Let ${n}$ be a fixed positive integer. ${A}$ and ${B}$ play the following game: $2023$ coins marked $1, 2, \dots, 2023$ lie on a circle (the marks are considered in module $2023$) and each coin has two sides. Initially, all coins are head up and ${A}$'s goal is to make as many coins with tail up. In each operation, ${A}$ choose two coins marked ${k}$ and $k+3$ with head up (if ${A}$ can't choose, the game ends) and ${B}$ choose a coin marked $k+1$ or $k+2$ and flip it. If at some moment there are ${n}$ coins with tail up, ${A}$ wins. Find the largest ${n}$ such that ${A}$ has a winning strategy.

Let $\{a_n\}$ be a nonnegative real sequence. Define $$X_k = \sum_{i=1}^{2^k}a_i, Y_k = \sum_{i=1}^{2^k}\left\lfloor \frac{2^k}{i}\right\rfloor a_i, k=0,1,2,...$$ Prove that $X_n\le Y_n - \sum_{i=0}^{n-1} Y_i \le \sum_{i=0}^n X_i$ for all positive integer $n$. Here $\lfloor\alpha\rfloor$ denotes the largest integer that does not exceed $\alpha$.

Determine the maximal value of $k$ such that the inequality $$\left(k +\frac{a}{b}\right) \left(k + \frac{b}{c}\right)\left(k + \frac{c}{a}\right) \le \left( \frac{a}{b}+ \frac{b}{c}+ \frac{c}{a}\right) \left( \frac{b}{a}+ \frac{c}{b}+ \frac{a}{c}\right)$$ holds for all positive reals $a, b, c$.

In a non-isosceles triangle $ABC$,$O$ and $I$ are circumcenter and incenter,respectively.$B^\prime$ is reflection of $B$ with respect to $OI$ and lies inside the angle $ABI$.Prove that the tangents to circumcirle of $\triangle BB^\prime I$ at $B^\prime$,$I$ intersect on $AC$. (A. Kuznetsov)

Let $z_1,z_2,...,z_n$ be complex numbers satisfying $|z_i - 1| \leq r$ for some $r$ in $(0,1)$. Show that \[ \left | \sum_{i=1}^n z_i \right | \cdot \left | \sum_{i=1}^n \frac{1}{z_i} \right | \geq n^2(1-r^2).\]

An arbitrary point $D$ is marked on the hypotenuse $AB$ of a right triangle $ABC$. The circle circumscribed around the triangle $ACD$ intersects the line $BC$ at the point $E$ for the second time, and the circle circumscribed around the triangle $BCD$ intersects the line $AC$ for the second time at the point $F$. Prove that the line $EF$ passes through the point $D$.

Given the circumradius $R$ of a triangle, a side length $c$, and the ratio $a/b$ of the other two side lengths, determine all three sides and angles of this triangle.