$A(1,1)$ is a point on parabola $y=x^2$. Draw the tangent line of the parabola that passes $A$, the line intersects $x$-axis at $D$, intersects $y$-axis at $B$. $C$ is a point on the parabola, and $E$ is a point on segment $AC$, such that $\frac{AE}{EC}=\lambda_1$, $F$ is a point on segment $BC$, such that $\frac{BF}{FC}=\lambda_2$. If $\lambda_1+\lambda_2=1$, $CD$ and $EF$ intersect at $P$. When $C$ moves, find the path equation of $P$.

Recall that the conjugate of the complex number $w = a + bi$, where $a$ and $b$ are real numbers and $i = \sqrt{-1}$, is the complex number $\overline{w} = a - bi$. For any complex number $z$, let $f(z) = 4i\hspace{1pt}\overline{z}$. The polynomial $P(z) = z^4 + 4z^3 + 3z^2 + 2z + 1$ has four complex roots: $z_1$, $z_2$, $z_3$, and $z_4$. Let $Q(z) = z^4 + Az^3 + Bz^2 + Cz + D$ be the polynomial whose roots are $f(z_1)$, $f(z_2)$, $f(z_3)$, and $f(z_4)$, where the coefficients $A,$ $B,$ $C,$ and $D$ are complex numbers. What is $B + D?$ $(\textbf{A})\: {-}304\qquad(\textbf{B}) \: {-}208\qquad(\textbf{C}) \: 12i\qquad(\textbf{D}) \: 208\qquad(\textbf{E}) \: 304$

Prove that the number of ordered triples $(x, y, z)$ such that $(x+y+z)^2 \equiv axyz \mod{p}$, where $gcd(a, p) = 1$ and $p$ is prime is $p^2 + 1$.

All positive integers from \( 1 \) to \( 2025 \) are written on a board. Mykhailo and Oleksii play the following game. They take turns, starting with Mykhailo, erasing one of the numbers written on the board. The game ends when exactly two numbers remain on the board. If their sum is a perfect square of an integer, Mykhailo wins; otherwise, Oleksii wins. Who wins if both players play optimally? [i]Proposed by Fedir Yudin[/i]

In trapezoid $ABCD$, the diagonals intersect at $E$, the area of $\triangle ABE$ is 72 and the area of $\triangle CDE$ is 50. What is the area of trapezoid $ABCD$?

The first four digits of a certain positive integer $n$ are $1137$. Prove that the digits of $n$ can be shuffled in such a way that the new number is divisible by 7.

A permutation $a_1, a_2, ..., a_{13}$ of the numbers from $1$ to $13$ is given such that $a_i > 5$ for $i=1,2,3,4,5$. Determine the maximum possible value of \[ a_{a_1} + a_{a_2} + a_{a_3} + a_{a_4} + a_{a_5}. \][i]Evan Chen[/i]

Whichever $3$ odd numbers is given. Prove that we can find a $4.$ odd number such that, sum of squares of the these numbers is a perfect square.

Let $\triangle ABC$ be a triangle with incentre $I$. Points $E$ and $F$ are the tangency points of the incircle and the sides $AC$ and $AB$, respectively. Suppose that the lines $BI$ and $CI$ intersect the line $EF$ at $Y$ and $Z$, respectively. Let $M$ denote the midpoint of the segment $BC$, and $N$ denote the midpoint of the segment $YZ$. Prove that $AI \parallel MN$.

The numbers $1, 2, \dots, 1999$ are written on the board. Two players take turn choosing $a,b$ from the board and erasing them then writing one of $ab$, $a+b$, $a-b$. The first player wants the last number on the board to be divisible by $1999$, the second player want to stop him. Determine the winner.

Let $x_1,x_2,\ldots ,x_n$ be real numbers, where $n\ge 2$, satisfying $\sum_{i=1}^{n}x^2_i+ \sum_{i=1}^{n-1}x_ix_{i+1}=1$ . For each $k$, find the maximal value of $|x_k|$.

A classroom has a row of $35$ coat hooks. Paulina likes coats to be equally spaced, so that there is the same number of empty hooks before the first coat, after the last coat, and between every coat and the next one. Suppose there is at least $1$ coat and at least $1$ empty hook. How many different numbers of coats can satisfy Paulina's pattern? $\textbf{(A)}\ 2\qquad \textbf{(B)}\ 4\qquad \textbf{(C)}\ 5\qquad \textbf{(D)}\ 7\qquad \textbf{(E)}\ 9$\\ (need visuals)

Let $m,n$ be natural numbers. Prove that $$m^{m^{m^m}}+n^{n^{n^n}}\geq m^{n^{n^n}}+ n^{m^{m^m}}$$ [i](nooonuii)[/i]

A circle of radius $4$ is inscribed in a triangle $ABC$. We call $D$ the touchpoint between the circle and side BC. Let $CD =8$, $DB= 10$. What is the length of the sides $AB$ and $AC$?

Complex numbers $\omega_1, \ldots, \omega_n$ each have magnitude $1.$ Let $z$ be a complex number distinct from $\omega_1, \ldots, \omega_n$ such that $$\frac{z+\omega_1}{z-\omega_1}+\ldots+\frac{z+\omega_n}{z-\omega_n}=0.$$ Prove that $|z|=1.$

The management of a secret society is made up of $4$ people. To admit new partners they use the following criteria: $\bullet$ Only the $4$ members of the directory vote, being able to do it in $3$ ways: in favor, against or abstaining. $\bullet$ Each aspiring partner must obtain at least $2$ votes in favor and none against. At the last management meeting, $8$ requests for admission were examined. Of the total votes cast, there were $23$ votes in favor, $2$ votes against and $7$ abstaining. What is the highest and what is the lowest value that the number of approved admission requests can have on that occasion?

Let $x_n=\binom{2n}{n}$ for all $n\in\mathbb{Z}^+$. Prove there exist infinitely many finite sets $A,B$ of positive integers, satisfying $A \cap B = \emptyset $, and \[\frac{{\prod\limits_{i \in A} {{x_i}} }}{{\prod\limits_{j\in B}{{x_j}} }}=2012.\]

Adam, Bendeguz, Cathy, and Dennis all see a positive integer $n$. Adam says, "$n$ leaves a remainder of $2$ when divided by $3$." Bendeguz says, "For some $k$, $n$ is the sum of the first $k$ positive integers." Cathy says, "Let $s$ be the largest perfect square that is less than $2n$. Then $2n - s = 20$." Dennis says, "For some $m$, if I have $m$ marbles, there are $n$ ways to choose two of them." If exactly one of them is lying, what is $n$?

In the set $A$ with $n$ elements, $[\sqrt{2n}]+2$ subsets are chosen such that the union of any three of them is equal to $A$. Prove that the union of any two of them is equal to $A$ as well.

Let $K$ commutative field with $8$ elements. Prove that $(\exists)a\in K$ such that $a^3=a+1$. [i]Mircea Becheanu[/i]

Let $A,B$ be adjacent vertices of a regular $n$-gon ($n\ge5$) with center $O$. A triangle $XYZ$, which is congruent to and initially coincides with $OAB$, moves in the plane in such a way that $Y$ and $Z$ each trace out the whole boundary of the polygon, with $X$ remaining inside the polygon. Find the locus of $X$.

Two grade seven students were allowed to enter a chess tournament otherwise composed of grade eight students. Each contestant played once with each other contestant and received one point for a win, one half point for a tie and zero for a loss. The two grade seven students together gained a total of eight points and each grade eight student scored the same number of points as his classmates. How many students for grade eight participated in the chess tournament? Is the solution unique?

We say that a subset \( T \) of \(\{1, 2, \dots, 2024\}\) is [b]kawaii[/b] if \( T \) has the following properties: 1. \( T \) has at least two distinct elements; 2. For any two distinct elements \( x \) and \( y \) of \( T \), \( x - y \) does not divide \( x + y \). For example, the subset \( T = \{31, 71, 2024\} \) is [b]kawaii[/b], but \( T = \{5, 15, 75\} \) is not [b]kawaii[/b] because \( 15 - 5 = 10 \) divides \( 15 + 5 = 20 \). What is the largest possible number of elements that a [b]kawaii [/b]subset can have?

Connect the commom points of circle$x^2+(y-1)^2=1$ and ellipse $9x^2+(y+1)^2=9$ with line segments, the figure is a $\text{(A)}$ line segment $\text{(B)}$ scalene triangle $\text{(C)}$ equilateral triangle $\text{(D)}$ quadrilateral

A paper cup has a base that is a circle with radius $r$, a top that is a circle with radius $2r$, and sides that connect the two circles with straight line segments as shown below. This cup has height $h$ and volume $V$. A second cup that is exactly the same shape as the first is held upright inside the first cup so that its base is a distance of $\tfrac{h}2$ from the base of the first cup. The volume of liquid that will t inside the first cup and outside the second cup can be written $\tfrac{m}{n}\cdot V$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [asy] pair s = (10,1); draw(ellipse((0,0),4,1)^^ellipse((0,-6),2,.5)); fill((3,-6)--(-3,-6)--(0,-2.1)--cycle,white); draw((4,0)--(2,-6)^^(-4,0)--(-2,-6)); draw(shift(s)*ellipse((0,0),4,1)^^shift(s)*ellipse((0,-6),2,.5)); fill(shift(s)*(3,-6)--shift(s)*(-3,-6)--shift(s)*(0,-2.1)--cycle,white); draw(shift(s)*(4,0)--shift(s)*(2,-6)^^shift(s)*(-4,0)--shift(s)*(-2,-6)); pair s = (10,-2); draw(shift(s)*ellipse((0,0),4,1)^^shift(s)*ellipse((0,-6),2,.5)); fill(shift(s)*(3,-6)--shift(s)*(-3,-6)--shift(s)*(0,-4.1)--cycle,white); draw(shift(s)*(4,0)--shift(s)*(2,-6)^^shift(s)*(-4,0)--shift(s)*(-2,-6)); //darn :([/asy]