Determine all functions $ f$ from the set of positive integers to the set of positive integers such that, for all positive integers $ a$ and $ b$, there exists a non-degenerate triangle with sides of lengths \[ a, f(b) \text{ and } f(b \plus{} f(a) \minus{} 1).\] (A triangle is non-degenerate if its vertices are not collinear.) [i]Proposed by Bruno Le Floch, France[/i]

$f(x)$ is a real valued function defined for $x \geq 0$ such that $f(0) = 0$, $f(x+1)=f(x)+\sqrt{x}$ for all $x$, and \[ f(x) < \frac{1}{2}f\left(x - \frac{1}{2}\right)+\frac{1}{2}f\left(x + \frac{1}{2}\right) \quad \text{for all} \quad x \geq \frac{1}{2} \] Show that $f\left(\frac{1}{2}\right)$ is uniquely determined.

Driving along a highway, Megan noticed that her odometer showed $15951$ (miles). This number is a palindrome—it reads the same forward and backward. Then $2$ hours later, the odometer displayed the next higher palindrome. What was her average speed, in miles per hour, during this $2$-hour period? $\textbf{(A) }50 \qquad \textbf{(B) }55 \qquad \textbf{(C) }60\qquad \textbf{(D) }65\qquad\textbf{(E) }70$

Solve in non-negative integers the equation $ 2^{a}3^{b} \plus{} 9 \equal{} c^{2}$

For every $n\geq 3$, determine all the configurations of $n$ distinct points $X_1,X_2,\ldots,X_n$ in the plane, with the property that for any pair of distinct points $X_i$, $X_j$ there exists a permutation $\sigma$ of the integers $\{1,\ldots,n\}$, such that $\textrm{d}(X_i,X_k) = \textrm{d}(X_j,X_{\sigma(k)})$ for all $1\leq k \leq n$. (We write $\textrm{d}(X,Y)$ to denote the distance between points $X$ and $Y$.) [i](United Kingdom) Luke Betts[/i]

Farmer John ties his goat to a number of ropes of varying lengths in the Euclidean plane. If he ties the goat to $k$ ropes centered at $Q_1$, $Q_2$, ... $Q_k$ with lengths $\ell_1$, $\ell_2$, ... $\ell_k$ (respectively), the goat can reach any point $R$ such that $\ell_j \geq RQ_j$ for all $j \in \{1,2,3, \ldots k\}$. Suppose that Farmer John has planted grass at a finite set of points $P_1$, $P_2$, ... $P_n$, and sets the ropes such that the goat can reach all of these points. What is, in terms of the points, the largest possible lower bound on the area of the region that the goat can reach?

Let $p(x) = x^{2013} + a_{2012}x^{2012} + a_{2011}x^{2011} +...+ a_1x + a_0$ be a polynomial with real coefficients with roots $- b_{1006}, - b_{1005}, ... , -b_1, 0, b_1, ... , b_{1005}, b_{1006}$, where $b_1, b_2, ... , b_{1006}$ are positive reals with product $1$. Show that $a_3a_{2011} \le 1012036$

[b]a)[/b] Show that $ \frac{n}{2}\ge \frac{2\sqrt{x} +3\sqrt[3]{x}+\cdots +n\sqrt[n]{x}}{n-1} -x, $ for all non-negative reals $ x $ and integers $ n\ge 2. $ [b]b)[/b] If $ x,y,z\in (0,\infty ) , $ then prove the inequality $$ \sum_{\text{cyc}} \frac{x}{(2x+y+z)^2+4} \le 3/16 $$

Two circles are externally tangent to each other at a point $A$ and internally tangent to a third circle $\Gamma$ at points $B$ and $C.$ Let $D$ be the midpoint of the secant of $\Gamma$ which is tangent to the smaller circles at $A.$ Show that $A$ is the incenter of the triangle $BCD$ if the centers of the circles are not collinear.

Prove that there are infinitely many primes $ p$ such that the total number of solutions mod $ p$ to the equation $ 3x^{3}\plus{}4y^{4}\plus{}5z^{3}\minus{}y^{4}z \equiv 0$ is $ p^2$

Let $n$ be a positive integer. We define $f(n)$ as the number of finite sequences $(a_1, a_2, \ldots , a_k)$ of positive integers such that $a_1 < a_2 < a_3 < \cdots < a_k$ and $$a_1+a_2^2+a_3^3+\cdots + a_k^k \leq n.$$ Determine the positive constants $\alpha$ and $C$ such that $$\lim\limits_{n\rightarrow \infty} \frac{f(n)}{n^\alpha}=C.$$

P6. It is given the integer $Y$ with $Y = 2018 + 20118 + 201018 + 2010018 + \cdots + 201 \underbrace{00 \ldots 0}_{\textrm{100 digits}} 18.$ Determine the sum of all the digits of such $Y$. (It is implied that $Y$ is written with a decimal representation.) P7. Three groups of lines divides a plane into $D$ regions. Every pair of lines in the same group are parallel. Let $x, y$ and $z$ respectively be the number of lines in groups 1, 2, and 3. If no lines in group 3 go through the intersection of any two lines (in groups 1 and 2, of course), then the least number of lines required in order to have more than 2018 regions is .... P8. It is known a frustum $ABCD.EFGH$ where $ABCD$ and $EFGH$ are squares with both planes being parallel. The length of the sides of $ABCD$ and $EFGH$ respectively are $6a$ and $3a$, and the height of the frustum is $3t$. Points $M$ and $N$ respectively are intersections of the diagonals of $ABCD$ and $EFGH$ and the line $MN$ is perpendicular to the plane $EFGH$. Construct the pyramids $M.EFGH$ and $N.ABCD$ and calculate the volume of the 3D figure which is the intersection of pyramids $N.ABCD$ and $M.EFGH$. P9. Look at the arrangement of natural numbers in the following table. The position of the numbers is determined by their row and column numbers, and its diagonal (which, the sequence of numbers is read from the bottom left to the top right). As an example, the number $19$ is on the 3rd row, 4th column, and on the 6th diagonal. Meanwhile the position of the number $26$ is on the 3rd row, 5th column, and 7th diagonal. (Image should be placed here, look at attachment.) a) Determine the position of the number $2018$ based on its row, column, and diagonal. b) Determine the average of the sequence of numbers whose position is on the "main diagonal" (quotation marks not there in the first place), which is the sequence of numbers read from the top left to the bottom right: 1, 5, 13, 25, ..., which the last term is the largest number that is less than or equal to $2018$. P10. It is known that $A$ is the set of 3-digit integers not containing the digit $0$. Define a [i]gadang[/i] number to be the element of $A$ whose digits are all distinct and the digits contained in such number are not prime, and (a [i]gadang[/i] number leaves a remainder of 5 when divided by 7. If we pick an element of $A$ at random, what is the probability that the number we picked is a [i]gadang[/i] number?

Find all integers $n\geq 3$ for which every convex equilateral $n$-gon of side length $1$ contains an equilateral triangle of side length $1$. (Here, polygons contain their boundaries.)

Let $ABCD$ be a trapezium inscribed in a circle $k$ with diameter $AB$. A circle with center $B$ and radius $BE$,where $E$ is the intersection point of the diagonals $AC$ and $BD$ meets $k$ at points $K$ and $L$. If the line ,perpendicular to $BD$ at $E$,intersects $CD$ at $M$,prove that $KM\perp DL$.

Consider 2 non-constant polynomials $P(x),Q(x)$, with nonnegative coefficients. The coefficients of $P(x)$ is not larger than $2021$ and $Q(x)$ has at least one coefficient larger than $2021$. Assume that $P(2022)=Q(2022)$ and $P(x),Q(x)$ has a root $\frac p q \ne 0 (p,q\in \mathbb Z,(p,q)=1)$. Prove that $|p|+n|q|\le Q(n)-P(n)$ for all $n=1,2,...,2021$