Let $m\ge10$ be any positive integer such that all its decimal digits are distinct. Denote $f(m)$ sum of positive integers created by all non-identical permutations of digits of $m,$ e.g. \[f(302)=320+023+032+230+203=808.\] Determine all positive integers $x$ such that \[f(x)=138\,012.\]

Let $ABCDEF$ be a regular hexagon of side length 1. Compute the area of the intersection of the circle centered at $A$ passing through $C$ and the circle centered at $D$ passing through $E$. [i]Proposed by Robert Trosten[/i]

Given a positive integer $n\geq 2$ and positive real numbers $a_1, a_2, \ldots, a_n$ with the sum equal to $1$. Let $b = a_1 + 2a_2 + \ldots + n a_n$. Prove that $$\sum_{1\leq i < j \leq n} (i-j)^2 a_i a_j \leq (n-b)(b-1).$$

Find the least $k$ for which the number $2010$ can be expressed as the sum of the squares of $k$ integers.

How many of the positive divisors of $120$ are divisible by $4$?

$2023$ players participated in a tennis tournament, and any two players played exactly one match. There was no draw in any match, and no player won all the other players. If a player $A$ satisfies the following condition, let $A$ be "skilled player". [b](Condition)[/b] For each player $B$ who won $A$, there is a player $C$ who won $B$ and lost to $A$. It turned out there are exactly $N(\geq 0)$ skilled player. Find the minimum value of $N$.

A friendly football match lasts 90 minutes. In this problem, we consider one of the teams, coached by Sir Alex, which plays with 11 players at all times. a) Sir Alex wants for each of his players to play the same integer number of minutes, but each player has to play less than 60 minutes in total. What is the minimum number of players required? b) For the number of players found in a), what is the minimum number of substitutions required, so that each player plays the same number of minutes? [i]Remark:[/i] Substitutions can only take place after a positive integer number of minutes, and players who have come off earlier can return to the game as many times as needed. There is no limit to the number of substitutions allowed. Proposed by Athanasios Kontogeorgis and Demetres Christofides.

Three non-negative integers are written on the board. In every step, the three numbers $(a, b, c)$ are being replaced with $a+b, b+c, c+a$. Find the biggest number of steps, after which the number $111$ will appear on the board.

Let $x_1, x_2 , x_3, .... x_n$ be $n$ real numbers such that $0 < x_j < \frac{1}{2}$. Prove that \[ \frac{ \prod\limits_{j=1}^{n} x_j } { \left( \sum\limits_{j=1}^{n} x_j \right)^n} \leq \frac{ \prod\limits_{j=1}^{n} (1-x_j) } { \left( \sum\limits_{j=1}^{n} (1 - x_j) \right)^n} \]

Through a point $P$ exterior to a given circle pass a secant and a tangent to the circle. The secant intersects the circle at $A$ and $B$, and the tangent touches the circle at $C$ on the same side of the diameter through $P$ as the points $A$ and $B$. The projection of the point $C$ on the diameter is called $Q$. Prove that the line $QC$ bisects the angle $\angle AQB$.

Let $ABCD$ be a convex quadrilateral, the incenters of $\triangle ABC$ and $\triangle ADC$ are $I,J$, respectively. It is known that $AC,BD,IJ$ concurrent at a point $P$. The line perpendicular to $BD$ through $P$ intersects with the outer angle bisector of $\angle BAD$ and the outer angle bisector $\angle BCD$ at $E,F$, respectively. Show that $PE=PF$.

Let $ a,b,c $ be positive real numbers satisfying $ a+b+c=2 $. Prove the inequality \[ \frac{1}{1+ab}+\frac{1}{1+bc}+\frac{1}{1+ca} \ge \frac{27}{13} \]

Determine the number of ten-digit positive integers with the following properties: $\bullet$ Each of the digits $0, 1, 2, . . . , 8$ and $9$ is contained exactly once. $\bullet$ Each digit, except $9$, has a neighbouring digit that is larger than it. (Note. For example, in the number $1230$, the digits $1$ and $3$ are the neighbouring digits of $2$ while $2$ and $0$ are the neighbouring digits of $3$. The digits $1$ and $0$ have only one neighbouring digit.) [i](Karl Czakler)[/i]

Evaluate: $\lim_{n\to\infty} \frac{1}{2n} \ln\binom{2n}{n}$

The sequence $a_1,a_2,a_3,...$, is constructed according to the rule $$a_1=1, a_2=a_1+1/a_1, ... , a_{n+1}=a_n+1/a_n, ...$$ Prove that $a_{100} > 14$.

A [i]repunit[/i] is a positive integer whose digits in base $ 10$ are all ones. Find all polynomials $ f$ with real coefficients such that if $ n$ is a repunit, then so is $ f(n).$

Let $\sigma(n) $ denote the sum of positive divisors of a number $n $. A positive integer $N=2^rb $ is given,where $r $ and $b $ are positive integers and $b $ is odd. It is known that $\sigma(N)=2N-1$. Prove that $b$ and $\sigma (b) $ are coprime. Tuymaada Q6 Juniors

Let $a,b,c$ be distinct complex numbers with $|a|=|b|=|c|=1.$ If $|a+b-c|^2+|b+c-a|^2+|c+a-b|^2=12,$ prove that the points of affixes $a,b,c$ are the vertices of an equilateral triangle.

For each positive integer $n$, let $S(n)$ be the sum of the digits of $n^2 +1$. A sequence $\{a_n\}$ is defined, with $a_0$ an arbitrary positive integer and $a_{n+1} = S(a_n)$. Prove that the sequence $\{a_n\}$ is eventually periodic with period three.

Points $E$ and $F$ are taken on the diagonals $AB_1$ and $CA_1$ of the lateral faces $ABB_1A_1$ and $CAA_1C_1$ of a triangular prism $ABCA_1B_1C_1$ so that $EF\parallel BC_1$. Find the ratio of the lengths of $EF$ and $BC_1$.

Consider the set $A = \{0, 1, 2, . . . , 2^{2n} - 1\}$. The function $f : A \rightarrow A$ is given by: $f(x_0 + 2x_1 + 2^2x_2 + ... + 2^{2n-1}x_{2n-1})=$$(1 - x_0) + 2x_1 + 2^2(1 - x_2) + 2^3x_3 + ... + 2^{2n-1}x_{2n-1}$ for every $0-1$ sequence $(x_0, x_1, . . . , x_{2n-1})$. Show that if $a_1, a_2, . . . , a_9$ are consecutive terms of an arithmetic progression, then the sequence $f(a_1), f(a_2), . . . , f(a_9)$ is not increasing.

Prove that there exist a subset $A$ of $\{1,2,\cdots,2^n\}$ with $n$ elements, such that for any two different non-empty subset of $A$, the sum of elements of one subset doesn't divide another's.

The hexagon $ABCDEF$ has all angles equal . We know that four consecutive sides of the hexagon have lengths $7, 6, 3$ and $5$ in this order. What is the sum of the lengths of the two remaining sides?

The girl continues the sequence of letters $ASSARA... $, adding one of the three letters $A$, $R$ or $S$. When adding the next letter, the girl makes sure that no two written sevens of consecutive letters coincide. At some point it turned out that it was impossible to add a new letter according to these rules. What letter could be written last?

Let $s,t$ be given nonzero integers, $(x,y)$ be any (ordered) pair of integers. A sequence of moves is performed as follows: per move $(x,y)$ changes to $(x+t, y-s)$. The pair (x,y) is said to be [i]good [/i] if after some (may be, zero) number of moves described a pair of integers arises that are not relatively prime. a) Determine whether $(s,t)$ is itself a good pair; bj Prove that for any nonzero $s$ and $t$ there is a pair $(x,y)$ which is not good.