Consider a polynomial $P(x) = ax^2 + bx + c$ with $a > 0$ that has two real roots $x_1, x_2$. Prove that the absolute values of both roots are less than or equal to $1$ if and only if $a + b + c \ge 0, a -b + c \ge 0$, and $a - c \ge 0$.

Determine all pairs $(x, y)$ of positive integers such that \[\sqrt[3]{7x^2-13xy+7y^2}=|x-y|+1.\] [i]Proposed by Titu Andreescu, USA[/i]

A quadrilateral $ABCD$ is such that $\angle A= \angle C=60^o$ and $\angle B=100^o$. Let $O_1$ and $O_2$ be the centers of the incircles of triangles $ABD$ and $CBD$ respectively. Find the angle between the lines $AO_2$ and $CO_1$.

A particle moves on a circle with center $O$, starting from rest at a point $P$ and coming to rest again at a point $Q$, without coming to rest at any intermediate point. Prove that the acceleration vector of the particle does not vanish at any point between $P$ and $ Q$ and that, at some point $R$ between $P$ and $Q$, the acceleration vector points in along the radius $RO.$

Let $ABCD$ be a convex quadrilateral with $\angle BAC = \angle CAD$, $\angle ABC =\angle ACD$, $(AD \cap (BC =\{E\}$, $(AB \cap (DC = \{F\}$. Prove that: a) $AB\cdot DE = BC \cdot CE$ b) $AC^2 < \frac12 (AD \cdot AF + AB \cdot AE).$

Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that for all $x,y\in \mathbb{R}$, \[xf(y+x)+(y+x)f(y)=f(x^2+y^2)+2f(xy)\] [i]Proposed by Aritra Mondal[/i]

For a set $S \subseteq \mathbb{N}$, define $f(S) = \{\left\lceil \sqrt{s} \right\rceil \mid s \in S\}$. Find the number of sets $T$ such that $\vert f(T) \vert = 2$ and $f(f(T)) = \{2\}$.

Find all positive integers $n \geqslant 2$ for which there exist $n$ real numbers $a_1<\cdots<a_n$ and a real number $r>0$ such that the $\tfrac{1}{2}n(n-1)$ differences $a_j-a_i$ for $1 \leqslant i<j \leqslant n$ are equal, in some order, to the numbers $r^1,r^2,\ldots,r^{\frac{1}{2}n(n-1)}$.

Let $f$ be a function with the following properties: 1) $f(n)$ is defined for every positive integer $n$; 2) $f(n)$ is an integer; 3) $f(2)=2$; 4) $f(mn)=f(m)f(n)$ for all $m$ and $n$; 5) $f(m)>f(n)$ whenever $m>n$. Prove that $f(n)=n$.

Find all functions $f: \mathbb{Q}^{+}\to \mathbb{Q}^{+}$ such that for all $x,y \in \mathbb{Q}$: \[f \left( x+\frac{y}{x}\right) =f(x)+\frac{f(y)}{f(x)}+2y, \; x,y \in \mathbb{Q}^{+}.\]

Let $S$ be a nonempty finite set, and $\mathcal {F}$ be a collection of subsets of $S$ such that the following conditions are met: (i) $\mathcal {F}$ $\setminus$ {$S$} $\neq$ $\emptyset$ ; (ii) if $F_1, F_2 \in \mathcal {F}$, then $F_1 \cap F_2 \in \mathcal {F}$ and $F_1 \cup F_2 \in \mathcal {F}$. Prove that there exists $a \in S$ which belongs to at most half of the elements of $\mathcal {F}$.

The tangents to the circumcircle of $\triangle ABC$ at $B$ and $C$ meet at $D$. The circumcircle of $\triangle BCD$ meets sides $AC$ and $AB$ again at $E$ and $F$ respectively. Let $O$ be the circumcentre of $\triangle ABC$. Show that $AO$ is perpendicular to $EF$.

Given $1980$ vectors in the plane, and there are some non-collinear among them. The sum of every $1979$ vectors is collinear to the vector not included in that sum. Prove that the sum of all vectors equals to the zero vector.

Prove that every polynomial of fourth degree can be represented in the form $P(Q(x))+R(S(x))$, where $P,Q,R,S$ are quadratic trinomials. [i]A. Golovanov[/i] [b]EDIT.[/b] It is confirmed that assuming the coefficients to be [b]real[/b], while solving the problem, earned a maximum score.

Let $ABC$ a triangle, $I$ the incenter, $D$ the contact point of the incircle with the side $BC$ and $E$ the foot of the bisector of the angle $A$. If $M$ is the midpoint of the arc $BC$ which contains the point $A$ of the circumcircle of the triangle $ABC$ and $\{F\} = DI \cap AM$, prove that $MI$ passes through the midpoint of $[EF]$.

Let $ ABCDE$ be a convex pentagon such that \[ \angle BAC \equal{} \angle CAD \equal{} \angle DAE\qquad \text{and}\qquad \angle ABC \equal{} \angle ACD \equal{} \angle ADE. \]The diagonals $BD$ and $CE$ meet at $P$. Prove that the line $AP$ bisects the side $CD$. [i]Proposed by Zuming Feng, USA[/i]

Five identical empty buckets of $2$-liter capacity stand at the vertices of a regular pentagon. Cinderella and her wicked Stepmother go through a sequence of rounds: At the beginning of every round, the Stepmother takes one liter of water from the nearby river and distributes it arbitrarily over the five buckets. Then Cinderella chooses a pair of neighbouring buckets, empties them to the river and puts them back. Then the next round begins. The Stepmother goal's is to make one of these buckets overflow. Cinderella's goal is to prevent this. Can the wicked Stepmother enforce a bucket overflow? [i]Proposed by Gerhard Woeginger, Netherlands[/i]

Chitoge is painting a cube; she can paint each face either black or white, but she wants no vertex of the cube to be touching three faces of the same color. In how many ways can Chitoge paint the cube? Two paintings of a cube are considered to be the same if you can rotate one cube so that it looks like the other cube.

Write the following polynomial as a product of irreducible polynomials in $\mathbb{Z}[X]$ \[ f(X) = X^{2005} - 2005 X + 2004 . \]Justify your answer.

Let $P_{n}$ denote the number of paths in the coordinate plane traveling from $(0, 0)$ to $(n, 0)$ with three kinds of moves: [i]upstep[/i] $u = [1, 1]$, [i]downstep[/i] $d = [1,-1]$, and [i]flatstep[/i] $f = [1, 0]$ with the path always staying above the line $y = 0.$ Let $C_{n}= \frac{1}{n+1}\binom{2n}{n}$ be the $n^{th}$ Catalan number. Prove that $P_{n}= \sum_{i = 0}^\infty \binom{n}{2i}C_{i}$ and $C_{n}= \sum_{i = 0}^{2n}(-1)^{i}\binom{2n}{i}P_{2n-i}.$ [hide="Solution to Part 1"] Let a path string, $S_{k}$, denote a string of $u, d, f$ corresponding to upsteps, downsteps, and flatsteps of length $k$ which successfully travels from $(0, 0)$ to $(n, 0)$ without passing below $y = 0.$ Also, let each entry of a path string be a slot. Lastly, denote $u_{k}, d_{k}, f_{k}$ to be the number of upsteps, downsteps, and flatsteps, respectively, in $S_{k}.$ Note that in our situation, all such path strings are in the form $S_{n},$ so all our path strings have $n$ slots. Since the starting and ending $y$ values are the same, the number of upsteps must equal the number of downsteps. Let us observe the case when there are $2k$ downsteps and upsteps totally. Thus, there are $\binom{n}{2k}$ ways to choose the slots in which the upsteps and the downsteps appear. Now, we must arrange the downsteps and upsteps in such a way that $d_{n}= u_{n}$ and a greater number of upsteps preceed downsteps, as the path is always above $y = 0$. Note that a bijection exists between this and the number of ways to binary bracket $k$ letters. The number of binary brackets of $k$ letters is just the $k^{th}$ Catalan number. We then place the flatsteps in the rest of the slots. Thus, there are a total of $\sum_{k = 0}^\infty \binom{n}{2k}C_{k}$ ways to get an $S_{n}.$ [/hide]

Let $a$ and $b$ be positive integers that satisfy $ab-7a-11b+13=0$. What is the minimum possible value of $a+b$?

In the adjoining figure, points $B$ and $C$ lie on line segment $AD$, and $AB$, $BC$, and $CD$ are diameters of circle $O$, $N$, and $P$, respectively. Circles $O$, $N$, and $P$ all have radius $15$ and the line $AG$ is tangent to circle $P$ at $G$. If $AG$ intersects circle $N$ at points $E$ and $F$, then chord $EF$ has length [asy] size(250); defaultpen(fontsize(10)); pair A=origin, O=(1,0), B=(2,0), N=(3,0), C=(4,0), P=(5,0), D=(6,0), G=tangent(A,P,1,2), E=intersectionpoints(A--G, Circle(N,1))[0], F=intersectionpoints(A--G, Circle(N,1))[1]; draw(Circle(O,1)^^Circle(N,1)^^Circle(P,1)^^G--A--D, linewidth(0.7)); dot(A^^B^^C^^D^^E^^F^^G^^O^^N^^P); label("$A$", A, W); label("$B$", B, SE); label("$C$", C, NE); label("$D$", D, dir(0)); label("$P$", P, S); label("$N$", N, S); label("$O$", O, S); label("$E$", E, dir(120)); label("$F$", F, NE); label("$G$", G, dir(100));[/asy] $\textbf {(A) } 20 \qquad \textbf {(B) } 15\sqrt{2} \qquad \textbf {(C) } 24 \qquad \textbf{(D) } 25 \qquad \textbf {(E) } \text{none of these}$

Can every positive rational number $q$ be written as $$\frac{a^{2021} + b^{2023}}{c^{2022} + d^{2024}},$$ where $a, b, c, d$ are all positive integers? [i]Proposed by Dominic Yeo, UK[/i]

In trapezoid $ABCD$, $AD \parallel BC$ and $\angle ABC + \angle CDA = 270^{\circ}$. Compute $AB^2$ given that $AB \cdot \tan(\angle BCD) = 20$ and $CD = 13$. [i]Proposed by Lewis Chen[/i]

Given a positive integer $n$, there are $n$ boxes $B_1,...,B_n$. The following procedure can be used to add balls. $$\text{(Procedure) Chosen two positive integers }n\geq i\geq j\geq 1\text{, we add one ball each to the boxes }B_k\text{ that }i\geq k\geq j.$$ For positive integers $x_1,...,x_n$ let $f(x_1,...,x_n)$ be the minimum amount of procedures to get all boxes have its amount of balls to be a multiple of 3, starting with $x_i$ balls for $B_i(i=1,...,n)$. Find the largest possible value of $f(x_1,...,x_n)$. (If $x_1,...,x_n$ are all multiples of 3, $f(x_1,...,x_n)=0$.)