The cells of a $5\times5$ grid are each colored red, white, or blue. Sam starts at the bottom-left cell of the grid and walks to the top-right cell by taking steps one cell either up or to the right. Thus, he passes through $9$ cells on his path, including the start and end cells. Compute the number of colorings for which Sam is guaranteed to pass through a total of exactly $3$ red cells, exactly $3$ white cells, and exactly $3$ blue cells no matter which route he takes.

Find all real polynomials that \[p(x+p(x))=p(x)+p(p(x))\]

Let $ABCD$ be a convex quadrilateral such that the triangle $ABD$ is equilateral and the triangle $BCD$ is isosceles, with $\angle C = 90^o$. If $E$ is the midpoint of the side $AD$, determine the measure of the angle $\angle CED$.

Let $a, b$, and $n$ be integers such that $a + b$ is divisible by $n$ and $a^2 + b^2$ is divisible by $n^2$. Prove that $a^m + b^m$ is divisible by $n^m$ for all positive integers $m$.

How many (possibly empty) sets of lattice points $\{P_1, P_2, ... , P_M\}$, where each point $P_i =(x_i, y_i)$ for $x_i , y_i \in \{0, 1, 2, 3, 4, 5, 6\}$, satisfy that the slope of the line $P_iP_j$ is positive for each $1 \le i < j \le M$ ? An infinite slope, e.g. $P_i$ is vertically above $P_j$ , does not count as positive.

Let $ABC$ be a triangle with circumcenter $O$. Let $P$ be a point inside $ABC$, so let the points $D, E, F$ be on $BC, AC, AB$ respectively so that the Miquel point of $DEF$ with respect to $ABC$ is $P$. Let the reflections of $D, E, F$ over the midpoints of the sides that they lie on be $R, S, T$. Let the Miquel point of $RST$ with respect to the triangle $ABC$ be $Q$. Show that $OP = OQ$. [i]Proposed by Yang Liu[/i]

Let $n$ be an integer greater than $1$. Define \[x_1 = n, y_1 = 1, x_{i+1} =\left[ \frac{x_i+y_i}{2}\right] , y_{i+1} = \left[ \frac{n}{x_{i+1}}\right], \qquad \text{for }i = 1, 2, \ldots\ ,\] where $[z]$ denotes the largest integer less than or equal to $z$. Prove that \[ \min \{x_1, x_2, \ldots, x_n \} =[ \sqrt n ]\]

Let $N=111...1222...2$, where there are $1999$ digits of $1$ followed by $1999$ digits of $2$. Express $N$ as the product of four integers, each of them greater than $1$.

Find all integers $n$ for which $(n-1)\cdot 2^n + 1$ is a perfect square.

The inscribed circle of an acute $\Delta ABC$ is tangent to $AB$ and $AC$ in $K$ and $L$ respectively. The altitude $AH$ intersects the angle bisectors of $\angle ABC$ and $\angle ACB$ in $P$ and $Q$ respectively. Prove that the middle point $M$ of $AH$ lies on the radical axis of the circumscribed circles of $\Delta KPB$ and $\Delta LQC$.

Let $\triangle ABC$ be a triangle. Let points $D$ and $E$ be on segment $BC$ in the order $B, D, E, C$ such that $\angle BAD =$ $\angle DAE = \angle EAC.$ Suppose also that $BD = F_{2024}, DE = F_{2025}, EC = F_{2027},$ where $F_k$ is the $k$th Fibonacci number where $F_1 = F_2 = 1.$ To the nearest degree, $\angle BAC$ is $n^\circ.$ Find $n.$

Prove that every rational number is representable as $x^4+y^4-z^4-t^4$ with rational $x,y,z,t$.

Find the smallest positive real $k$ satisfying the following condition: for any given four DIFFERENT real numbers $a,b,c,d$, which are not less than $k$, there exists a permutation $(p,q,r,s)$ of $(a,b,c,d)$, such that the equation $(x^{2}+px+q)(x^{2}+rx+s)=0$ has four different real roots.

Let $[r,s]$ denote the least common multiple of positive integers $r$ and $s$. Find the number of ordered triples $(a,b,c)$ of positive integers for which $[a,b] = 1000$, $[b,c] = 2000$, and $[c,a] = 2000$

Let $L,E,T,M,$ and $O$ be digits that satisfy $LEET+LMT=TOOL.$ Given that $O$ has the value of $0,$ digits may be repeated, and $L\neq0,$ what is the value of the $4$-digit integer $ELMO?$

Find all real constants c for which there exist strictly increasing sequence $a$ of positive integers such that $(a_{2n-1}+a_{2n})/{a_n}=c$ for all positive intеgers n.

Let $N = 15! = 15\cdot 14\cdot 13 ... 3\cdot 2\cdot 1$. Prove that $N$ can be written as a product of nine different integers all between $16$ and $30$ inclusive.

For any positive integer $n$ and real numbers $a_i>0$ ($i=1,2,...,n$), prove that \[\sum_{k=1}^n \frac{k}{a_1^{-1}+a_2^{-1}+...+a_k^{-1}}\leq 2\sum_{k=1}^n a_k.\] Discuss if the "$2$" at the right hand side of the inequality can or cannot be replaced by a smaller real number.

Circles $ \omega_{1}$ and $ \omega_{2}$ intersect at points $ A$ and $ B.$ Points $ C$ and $ D$ are on circles $ \omega_{1}$ and $ \omega_{2},$ respectively, such that lines $ AC$ and $ AD$ are tangent to circles $ \omega_{2}$ and $ \omega_{1},$ respectively. Let $ I_{1}$ and $ I_{2}$ be the incenters of triangles $ ABC$ and $ ABD,$ respectively. Segments $ I_{1}I_{2}$ and $ AB$ intersect at $ E$. Prove that: $ \frac {1}{AE} \equal{} \frac {1}{AC} \plus{} \frac {1}{AD}$

A sphere rolls along two intersecting straight lines. Find the locus of its center.

2. Positive integer will be called white, if it is equal to $1$ or is a product of even number of primes (not necessarily distinct). Rest of the positive integers will be called black. Determine whether there exists a positive integer which sum of white divisors is equal to sum of black divisors

Let $a_1,a_2 \dots a_n$ and $x_1, x_2 \dots x_n$ be integers and $r\geq 2$ be an integer. It is known that \[\sum_{j=0}^{n} a_j x_j^k =0 \qquad \text{for} \quad k=1,2, \dots r.\] Prove that \[\sum_{j=0}^{n} a_j x_j^m \equiv 0 \pmod m, \qquad \text{for all}\quad m \in \{ r+1, r+2, \cdots, 2r+1 \}.\]

The following is the construction of the [I]twindragon[/I] fractal. $I_0$ is the solid square region with vertices $(0,0),$ $ (\tfrac{1}{2}, \tfrac{1}{2}),$ $(1,0), (\tfrac{1}{2}, -\tfrac{1}{2}).$ Recursively, the region $I_{n+1}$ is consists of two copies of $I_n:$ one copy which is rotated $45^\circ$ counterclockwise around the origin and scaled by a factor of $\tfrac{1}{\sqrt{2}},$ and another copy which is also rotated $45^\circ$ counterclockwise around the origin and scaled by a factor of $\tfrac{1}{\sqrt{2}}$ and translated by $(\tfrac{1}{2}, -\tfrac{1}{2}).$ We have displayed $I_0$ and $I_1$ below. Let $I_{\infty}$ be the limiting region of $I_0, I_1, \ldots.$ The area of the smallest convex polygon which encloses $I_{\infty}$ can be written as $\tfrac{a}{b}$ for relatively prime positive integers $a$ and $b.$ Find $a+b.$ [center] [img]https://cdn.artofproblemsolving.com/attachments/b/c/50b5d5a70c293329cf693bfaef823fb2813b07.png[/img] [/center]

Let $ABC$ be a scalene triangle and $\omega$ is your incircle. The sides $BC,CA$ and $AB$ are tangents to $\omega$ in $X,Y,Z$ respectively. Let $M$ be the midpoint of $BC$ and $D$ is the intersection point of $BC$ with the angle bisector of $\angle BAC$. Prove that $\angle BAX=\angle MAC$ if and only if $YZ$ passes by the midpoint of $AD$.

Let $n$ be a positive integer. $1369^n$ positive rational numbers are given with this property: if we remove one of the numbers, then we can divide remain numbers into $1368$ sets with equal number of elements such that the product of the numbers of the sets be equal. Prove that all of the numbers are equal.