Square trinomials $P(x) = x^2 + ax + b$ and $Q(x) = x^2 + cx + d$ are such that the equation $P(Q(x)) = Q(P(x))$ has no real roots. Prove that $b \ne d$.

Let $P$ be a variable point on arc $BC$ of the circumcircle of triangle $ABC$ not containing $A$. Let $I_1$ and $I_2$ be the incenters of the triangles $PAB$ and $PAC$, respectively. Prove that: [b](a)[/b] The circumcircle of $?PI_1I_2$ passes through a fixed point. [b](b)[/b] The circle with diameter $I_1I_2$ passes through a fixed point. [b](c)[/b] The midpoint of $I_1I_2$ lies on a fixed circle.

Find all the pairs of positive integers $(x,y)$ such that $x\leq y$ and \[\frac{(x+y)(xy-1)}{xy+1}=p,\]where $p$ is a prime number.

In a certain country there are $10$ cities connected by a network of one-way nonstop flights so that it is possible to fly (using one or more flights) from any city to any other. Let $n$ be the least number of flights needed to complete a trip starting from one of the cities, visiting all others and returning to the starting point. Find the greatest possible value of $n$.

Students guess that Norb's age is $24, 28, 30, 32, 36, 38, 41, 44, 47$, and $49$. Norb says, "At least half of you guessed too low, two of you are off by one, and my age is a prime number." How old is Norb? $ \textbf{(A)}29\qquad\textbf{(B)}31\qquad\textbf{(C)}37\qquad\textbf{(D)}43\qquad\textbf{(E)}48 $

A number $n$ is $\textit{almost prime}$ if any of $n-2$, $n-1$, $n$, $n+1$, or $n+2$ is prime. Compute the smallest positive integer that is not $\textit{almost prime}$.

Five equally skilled tennis players named Allen, Bob, Catheryn, David, and Evan play in a round robin tournament, such that each pair of people play exactly once, and there are no ties. In each of the ten games, the two players both have a 50% chance of winning, and the results of the games are independent. Compute the probability that there exist four distinct players $P_1$, $P_2$, $P_3$, $P_4$ such that $P_i$ beats $P_{i+1}$ for $i=1, 2, 3, 4$. (We denote $P_5=P_1$).

An $ n \times n, n \geq 2$ chessboard is numbered by the numbers $ 1, 2, \ldots, n^2$ (and every number occurs). Prove that there exist two neighbouring (with common edge) squares such that their numbers differ by at least $ n.$

We are given $n$ coins of different weights and $n$ balances, $n>2$. On each turn one can choose one balance, put one coin on the right pan and one on the left pan, and then delete these coins out of the balance. It's known that one balance is wrong (but it's not known ehich exactly), and it shows an arbitrary result on every turn. What is the smallest number of turns required to find the heaviest coin? [hide=Thanks]Thanks to the user Vlados021 for translating the problem.[/hide]

Let $\mathbb{Q}^+$ denote the set of all positive rational numbers. Determine all functions $f:\mathbb{Q}^+\to \mathbb{Q}^+$ satisfying$$f(x^2f(y)^2)=f(x^2)f(y)$$for all $x,y\in\mathbb{Q}^+$

Maria have $14$ days to train for an olympiad. The only conditions are that she cannot train by $3$ consecutive days and she cannot rest by $3$ consecutive days. Determine how many configurations of days(in training) she can reach her goal.

Find all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ such that: $$f(xy+f(x))=xf(y)$$ for all $x,y\in\mathbb{R}$.

A natural number is called [i]good[/i] if it can be represented as sum of two coprime natural numbers, the first of which decomposes into odd number of primes (not necceserily distinct) and the second to even. Prove that there exist infinity many $n$ with $n^4$ being good.

Let be three natural numbers $ n,p,q , $ a field $ \mathbb{F} , $ and two matrices $ A,B\in\mathcal{M}_n\left( \mathbb{F} \right) $ such that $$ A^pB=0=(A+I)^qB. $$ Prove that $ B=0. $ [i]D.M. Bătinețu[/i]

Let $n$ and $k$ be positive integers. Prove that for $a_1, \dots, a_n \in [1,2^k]$ one has \[ \sum_{i = 1}^n \frac{a_i}{\sqrt{a_1^2 + \dots + a_i^2}} \le 4 \sqrt{kn}. \]

Let $\omega_1,\omega_2$ be two non-intersecting circles, with circumcenters $O_1,O_2$ respectively, and radii $r_1,r_2$ respectively where $r_1 < r_2$. Let $AB,XY$ be the two internal common tangents of $\omega_1,\omega_2$, where $A,X$ lie on $\omega_1$, $B,Y$ lie on $\omega_2$. The circle with diameter $AB$ meets $\omega_1,\omega_2$ at $P$ and $Q$ respectively. If $$\angle AO_1P+\angle BO_2Q=180^{\circ},$$ find the value of $\frac{PX}{QY}$ (in terms of $r_1,r_2$).

Let $n \geq 2$ be an integer. Find the minimum $k$ for which there exists a partition of $\{1, 2, . . . , k\}$ into $n$ subsets $X_1,X_2, \cdots , X_n$ such that the following condition holds: for any $i, j, 1 \leq i < j \leq n$, there exist $x_i \in X_1, x_j \in X_2$ such that $|x_i - x_j | = 1.$

A rectangle \( m \times n \), where \( m \) and \( n \) are natural numbers strictly greater than 1, is partitioned into \( mn \) unit squares, each of which can be colored either black or white. An operation consists of changing the color of all the squares in a row or in a column to the opposite color. Is it possible that, although initially exactly one square is colored black and all the others are white, after a finite number of moves all squares have the same color?

Denote $\langle x\rangle$ the distance of the real number x from the nearest integer. Let f be a linear, 1 periodic, continuous real function. Prove that there exist natural n and real numbers $a_1 , ..., a_n , b_1 , ..., b_n , c_1 , ..., c_n$ such that $$f(x) = \sum_{i = 1}^n c_i \langle a_ix + b_i \rangle$$ for every x iff there is a k such that $$\sum_{j = 1}^{2^k} f \left(x+{j\over2^k}\right)$$ is constant.

There are $10$ horses, named Horse 1, Horse 2, $\ldots$, Horse 10. They get their names from how many minutes it takes them to run one lap around a circular race track: Horse $k$ runs one lap in exactly $k$ minutes. At time 0 all the horses are together at the starting point on the track. The horses start running in the same direction, and they keep running around the circular track at their constant speeds. The least time $S > 0$, in minutes, at which all $10$ horses will again simultaneously be at the starting point is $S = 2520$. Let $T>0$ be the least time, in minutes, such that at least $5$ of the horses are again at the starting point. What is the sum of the digits of $T$? $\textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 5\qquad\textbf{(E)}\ 6$

Find all function $f:\mathbb{N} \longrightarrow \mathbb{N}$ such that forall positive integers $x$ and $y$, $\frac{f(x+y)-f(x)}{f(y)}$ is again a positive integer not exceeding $2022^{2022}$.

Given an infinite sequence of numbers $a_1, a_2, a_3, ...$ such that for each positive integer $k$, there exists positive integer $t$ for which $a_k = a_{k+t} = a_{k+2t} = ....$ Does this sequences must be periodic?

Prove that: $$\left\lfloor10^{n+3}\cdot\sqrt{\overline{\underbrace{11\ldots1}_{2n\text{ times}}}}\right\rfloor=\overline{\underbrace{33\ldots3}_{2n\text{ times}}166}$$ [i]Proposed by Ovidiu Pop[/i]

Calculate: $\underset{n\to \infty }{\mathop{\lim }}\,\int_{0}^{1}{{{e}^{{{x}^{n}}}}dx}$

We consider an acute triangle $ABC$. The altitude from $A$ is $AD$, the altitude from $D$ in triangle $ABD$ is $DE,$ and the altitude from $D$ in triangle $ACD$ is $DF$. a) Prove that the triangles $ABC$ and $AF E$ are similar. b) Prove that the segment $EF$ and the corresponding segments constructed from the vertices $B$ and $C$ all have the same length.