Let $a \neq b a,b \in \mathbb{R}$ such that $(x^2+20ax+10b)(x^2+20bx+10a)=0$ has no roots for $x$. Prove that $20(b-a)$ is not an integer.

Let $a_1, \dots, a_n, b_1, \dots, b_n$ be $2n$ positive integers such that the $n+1$ products \[a_1 a_2 a_3 \cdots a_n, b_1 a_2 a_3 \cdots a_n, b_1 b_2 a_3 \cdots a_n, \dots, b_1 b_2 b_3 \cdots b_n\] form a strictly increasing arithmetic progression in that order. Determine the smallest possible integer that could be the common difference of such an arithmetic progression.

In the square $ABCD$ the points $E$ and $F$ are marked on the sides $AB$ and $BC$ respectively, in such a way that $EB = 2AE$ and $BF = FC$. Let $G$ be the intersection between $DF$ and $EC$. If the side of the square equals $10$, what is the distance from point $G$ to side $AB$?

The circle inscribed in a triangle $ABC$ touches the sides $BC,CA,AB$ in $D,E, F$, respectively, and $X, Y,Z$ are the midpoints of $EF, FD,DE$, respectively. Prove that the centers of the inscribed circle and of the circles around $XYZ$ and $ABC$ are collinear.

A pack of $2n$ cards contains $n$ different pairs of cards. Each pair consists of two identical cards, either of which is called the twin of the other. A game is played between two players $A$ and $B$. A third person called the [i]dealer[/i] shuffles the pack and deals the cards one by one face upward onto the table. One of the players, called the [i]receiver[/i], takes the card dealt, provided he does not have already its twin. If he does already have the twin, his opponent takes the dealt card and becomes the receiver. $A$ is initially the receiver and takes the first card dealt. The player who first obtains a complete set of $n$ different cards wins the game. What fraction of all possible arrangements of the pack lead to $A$ winning? Prove the correctness of your answer.

A computer program that works only with integer numbers reads the numbers on the screen, identifies the selected numbers and performs one of the following actions: • If button $A$ is pressed, the user selects $5$ numbers and then each selected number is changed to its successor; • If button $B$ is pressed, the user selects $5$ numbers and then each selected number is changed to its triple. Bento has this program on his computer with the numbers $1, 3, 3^2, · · ·, 3^{19}$ on the screen, each one appearing just once. a) By simply pressing button $A$ several times, is Bento able to make the sum of the numbers on the screen be $2024^{2025}$? b) What is the minimum number of times that Bento must press button $B$ to make all the numbers on the screen turn equal, without pressing button $A$?

Points $P$ and $Q$ are chosen uniformly and independently at random on sides $\overline {AB}$ and $\overline{AC},$ respectively, of equilateral triangle $\triangle ABC.$ Which of the following intervals contains the probability that the area of $\triangle APQ$ is less than half the area of $\triangle ABC?$ $\textbf{(A) } \left[\frac 38, \frac 12\right] \qquad \textbf{(B) } \left(\frac 12, \frac 23\right] \qquad \textbf{(C) } \left(\frac 23, \frac 34\right] \qquad \textbf{(D) } \left(\frac 34, \frac 78\right] \qquad \textbf{(E) } \left(\frac 78, 1\right]$

Prove that $ \frac {( \minus{} 1)^n}{n!}\int_1^2 (\ln x)^n\ dx \equal{} 2\sum_{k \equal{} 1}^n \frac {( \minus{} \ln 2)^k}{k!} \plus{} 1$.

Let $ABC$ be a triangle with centroid $T$. Denote by $M$ the midpoint of $BC$. Let $D$ be a point on the ray opposite to the ray $BA$ such that $AB = BD$. Similarly, let $E$ be a point on the ray opposite to the ray $CA$ such that $AC = CE$. The segments $T D$ and $T E$ intersect the side $BC$ in $P$ and $Q$, respectively. Show that the points $P, Q$ and $M$ split the segment $BC$ into four parts of equal length.

Let $R$ be a square region and $n\ge4$ an integer. A point $X$ in the interior of $R$ is called $n\text{-}ray$ partitional if there are $n$ rays emanating from $X$ that divide $R$ into $n$ triangles of equal area. How many points are 100-ray partitional but not 60-ray partitional? $\textbf{(A)}\,1500 \qquad\textbf{(B)}\,1560 \qquad\textbf{(C)}\,2320 \qquad\textbf{(D)}\,2480 \qquad\textbf{(E)}\,2500$

Does there exist a polynomial \( P(x,y) \) in two variables with real coefficients, such that the following two conditions hold: 1) \( P(x,y) = P(x, x-y) = P(y-x, y) \) for any real numbers \( x \) and \( y \); 2) There does not exist a polynomial \( Q(z) \) in one variable with real coefficients such that \( P(x,y) = Q(x^2 - xy + y^2) \) for any real numbers \( x \) and \( y \)?

Moor made a lopsided ice cream cone. It turned out to be an oblique circular cone with the vertex directly above the perimeter of the base (see diagram below). The height and base radius are both of length $1$. Compute the radius of the largest spherical scoop of ice cream that it can hold such that at least $50\%$ of the scoop’s volume lies inside the cone. [center]<see attached>[/center]

Let $f$ be a quadratic function which satisfies the following condition. Find the value of $\frac{f(8)-f(2)}{f(2)-f(1)}$. For two distinct real numbers $a,b$, if $f(a)=f(b)$, then $f(a^2-6b-1)=f(b^2+8)$.

Consider $ \triangle ABC$ and points $ M \in (AB)$, $ N \in (BC)$, $ P \in (CA)$, $ R \in (MN)$, $ S \in (NP)$, $ T \in (PM)$ such that $ \frac {AM}{MB} \equal{} \frac {BN}{NC} \equal{} \frac {CP}{PA} \equal{} k$ and $ \frac {MR}{RN} \equal{} \frac {NS}{SP} \equal{} \frac {PT}{TN} \equal{} 1 \minus{} k$ for some $ k \in (0, 1)$. Prove that $ \triangle STR \sim \triangle ABC$ and, furthermore, determine $ k$ for which the minimum of $ [STR]$ is attained.

Let $\Gamma$ be a circle centered at $O$ with radius $R$. Let $X$ and $Y$ be points on $\Gamma$ such that $XY<R$. Let $I$ be a point such that $IX = IY$ and $XY = OI$. Describe how to construct with ruler and compass a triangle which has circumcircle $\Gamma$, incenter $I$ and Euler line $OX$. Prove that this triangle is unique.

Prove The Following identity: $ \sum_{j \equal{} 0}^n \left ({3n \plus{} 2 \minus{} j \choose j}2^j \minus{} {3n \plus{} 1 \minus{} j \choose j \minus{} 1}2^{j \minus{} 1}\right ) \equal{} 2^{3n}$. The Second term on left hand side is to be regarded zero for j=0.