A number is chosen uniformly at random from the set of all positive integers with at least two digits, none of which are repeated. Find the probability that the number is even.

Let $n\ge3$ and $a_1,a_2,...,a_n \in \mathbb{R^{+}}$, such that $\frac{1}{1+a_1^4} + \frac{1}{1+a_2^4} + ... + \frac{1}{1+a_n^4} = 1$. Prove that: $$a_1a_2...a_n \ge (n-1)^{\frac n4}$$

Let $\left ( a_{n} \right )_{n \geq 1}$ be an increasing sequence of positive integers such that $a_1=1$, and for all positive integers $n$, $a_{n+1}\leq 2n$. Prove that for every positive $n$; there exists positive integers $p$ and $q$ such that $n=a_{p}-a_{q}$.

Prove that infinitely many positive integers can be represented as $(a-1)/b + (b-1)/c + (c-1)/a$, where $a$, $b$ and $c$ are pairwise distinct positive integers greater than 1.

Let $p$ be a prime. Suppose the mean of the nonzero quadratic residues mod $p$ is less than $\frac{p}{2}$. Show that the median of the nonzero quadratic residues mod $p$ is less than $\frac{p}{2}$.

There is an integer $n > 1$. There are $n^2$ stations on a slope of a mountain, all at different altitudes. Each of two cable car companies, $A$ and $B$, operates $k$ cable cars; each cable car provides a transfer from one of the stations to a higher one (with no intermediate stops). The $k$ cable cars of $A$ have $k$ different starting points and $k$ different finishing points, and a cable car which starts higher also finishes higher. The same conditions hold for $B$. We say that two stations are linked by a company if one can start from the lower station and reach the higher one by using one or more cars of that company (no other movements between stations are allowed). Determine the smallest positive integer $k$ for which one can guarantee that there are two stations that are linked by both companies. [i]Proposed by Tejaswi Navilarekallu, India[/i]

Find the maximum number $ c$ such that for all $n \in \mathbb{N}$ to have \[ \{n \cdot \sqrt{2}\} \geq \frac{c}{n}\] where $ \{n \cdot \sqrt{2}\} \equal{} n \cdot \sqrt{2} \minus{} [n \cdot \sqrt{2}]$ and $ [x]$ is the integer part of $ x.$ Determine for this number $ c,$ all $ n \in \mathbb{N}$ for which $ \{n \cdot \sqrt{2}\} \equal{} \frac{c}{n}.$

Denote $g(k)$ as the greatest odd divisor of $k$. Put $f(k) = \dfrac{k}{2} + \dfrac{k}{g(k)}$ for $k$ even, and $2^{(k+1)/2}$ for $k$ odd. Define the sequence $x_1, x_2, x_3, ...$ by $x_1 = 1$, $x_{n+1} = f(x_n)$. Find $n$ such that $x_n = 800$.

Let $AX,BY,CZ$ be three cevians concurrent at an interior point $D$ of a triangle $ABC$. Prove that if two of the quadrangles $DY AZ,DZBX,DXCY$ are circumscribable, so is the third.

a) Given a quartet of positive numbers $(a,b,c,d)$. It is transformed to the new one according to the rule: $a'=ab, b' =bc, c'=cd,d'=da$. The second one is transformed to the third according to the same rule and so on. Prove that if at least one initial number does not equal 1, than You can never obtain the initial set. b) Given a set of $2^k$ ($k$-th power of two) numbers, equal either to $1$ or to $-1$. It is transformed as that was in the a) problem (each one is multiplied by the next, and the last -- by the first. Prove that You will always finally obtain the set of positive units.

Sixteen natural numbers written in the decimal system may form a geometric sequence, of which the first five members have nine digits, five further members have ten digits, four members have eleven digits and two terms have twelve digits. Prove that there is exactly one sequence with these properties.

Let $n \ge 2$ be an integer. Show that there exist $n+1$ numbers $x_1, x_2, \ldots, x_{n+1} \in \mathbb{Q} \setminus \mathbb{Z}$, so that $\{ x_1^3 \} + \{ x_2^3 \} + \cdots + \{ x_n^3 \}=\{ x_{n+1}^3 \}$, where $\{ x \}$ is the fractionary part of $x$.

Given complex numbers $a, b, c$, let $|a+b|=m, |a-b|=n$. If $mn \neq 0$, Show that \[\max \{|ac+b|,|a+bc|\} \geq \frac{mn}{\sqrt{m^2+n^2}}\]

Each of two regular polyhedrons $P$ and $Q$ was divided by the plane into two parts. One part of $P$ was attached to one part of $Q$ along the dividing plane and formed a regular polyhedron not equal to $P$ and $Q$. How many faces can it have?

Let $n > 3$ be a natural number. Prove that $4^n + 1$ has a prime divisor $> 20$.

For each integer $C>1$ decide whether there exist pairwise distinct positive integers $a_1,a_2,a_3,...$ such that for every $k\ge 1$, $a_{k+1}^k$ divides $C^ka_1a_2...a_k$. [i]Proposed by Daniel Liu

(1) Prove that, on the complex plane, the area of the convex hull of all complex roots of $z^{20}+63z+22=0$ is greater than $\pi$. (2) Let $a_1,a_2,\ldots,a_n$ be complex numbers with sum $1$, and $k_1<k_2<\cdots<k_n$ be odd positive integers. Let $\omega$ be a complex number with norm at least $1$. Prove that the equation \[ a_1 z^{k_1}+a_2 z^{k_2}+\cdots+a_n z^{k_n}=w \] has at least one complex root with norm at most $3n|\omega|$.

Determine all $n \in \mathbb{N}$ for which $n^{10} + n^5 + 1$ is prime.

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$.

Let $ABC$ be a triangle with circumcircle $c$ and circumcenter $O$, and let $D$ be a point on the side $BC$ different from the vertices and the midpoint of $BC$. Let $K$ be the point where the circumcircle $c_1$ of the triangle $BOD$ intersects $c$ for the second time and let $Z$ be the point where $c_1$ meets the line $AB$. Let $M$ be the point where the circumcircle $c_2$ of the triangle $COD$ intersects $c$ for the second time and let $E$ be the point where $c_2$ meets the line $AC$. Finally let $N$ be the point where the circumcircle $c_3$ of the triangle $AEZ$ meets $c$ again. Prove that the triangles $ABC$ and $NKM$ are congruent.

Suppose that every point in the plane is coloured either black or white. Must there be an equilateral triangle such that all of its vertices are the same colour?

For which positive integer $n$ is the quantity $\frac{n}{3} + \frac{40}{n}$ minimized? [i]Proposed by Eugene Chen[/i]

Lucy starts by writing $s$ integer-valued $2022$-tuples on a blackboard. After doing that, she can take any two (not necessarily distinct) tuples $\mathbf{v}=(v_1,\ldots,v_{2022})$ and $\mathbf{w}=(w_1,\ldots,w_{2022})$ that she has already written, and apply one of the following operations to obtain a new tuple: \begin{align*} \mathbf{v}+\mathbf{w}&=(v_1+w_1,\ldots,v_{2022}+w_{2022}) \\ \mathbf{v} \lor \mathbf{w}&=(\max(v_1,w_1),\ldots,\max(v_{2022},w_{2022})) \end{align*} and then write this tuple on the blackboard. It turns out that, in this way, Lucy can write any integer-valued $2022$-tuple on the blackboard after finitely many steps. What is the smallest possible number $s$ of tuples that she initially wrote?

Let $CH$ be the altitude of triangle ABC, $O$ be the center of the circle circumscribed around it. Point $T$ is the projection of point $C$ on the line $TO$. Prove that the line $TH$ bisects the side $BC$.

Find all pairs of positive integers $(m, n)$ such that $m^2-mn+n^2+1$ divides both numbers $3^{m+n}+(m+n)!$ and $3^{m^3+n^3}+m+n$. [i]Proposed by Dorlir Ahmeti[/i]