Show that there is no function $f : \mathbb N \to \mathbb N$ satisfying $f(f(n)) = n + 1$ for each positive integer $n.$

Find all functions $f:\mathbb N\to\mathbb N$ such that \begin{align*} x+f(y)&\mid f(y+f(x))\\ f(x)-2017&\mid x-2017\end{align*}

Consider a polynomial $P(x) = \prod^9_{j=1}(x+d_j),$ where $d_1, d_2, \ldots d_9$ are nine distinct integers. Prove that there exists an integer $N,$ such that for all integers $x \geq N$ the number $P(x)$ is divisible by a prime number greater than 20. [i]Proposed by Luxembourg[/i]

Prove that for any integer $n$, $n\geq 3$, there exist $n$ positive integers $a_1,a_2,\ldots,a_n$ in arithmetic progression, and $n$ positive integers in geometric progression $b_1,b_2,\ldots,b_n$ such that \[ b_1 < a_1 < b_2 < a_2 <\cdots < b_n < a_n . \] Give an example of two such progressions having at least five terms. [i]Mihai Baluna[/i]

Solve the following system (over the real numbers): \[\begin{cases}5x+5y+5xy-2xy^2-2x^2y=20 &\\ 3x+3y+3xy+xy^2+x^2y=23&\end{cases}\]

Let $r_1, \dots , r_5$ be the roots of the polynomial $x^5+5x^4-79x^3+64x^2+60x+144$. What is $r^2_1+\dots+r^2_5$?

Prove the following inequality: \[\prod^k_{i=1} x_i \cdot \sum^k_{i=1} x^{n-1}_i \leq \sum^k_{i=1} x^{n+k-1}_i,\] where $x_i > 0,$ $k \in \mathbb{N}, n \in \mathbb{N}.$

Given $f:\mathbb{R}\to \mathbb{R}$ an arbitrary function and $g:\mathbb{R}\to \mathbb{R}$ a function of the second degree, with the property: for any real numbers m and n equation $f\left( x \right)=mx+n$ has solutions if and only if the equation $g\left( x \right)=mx+n$ has solutions Show that the functions $f$ and $g$ are equal.

Let $a_o,a_1,a_2,..,a_ n$ be a non-decreasing sequence of $n+1$ real numbers where $a_0 = 0$ and for every $j > i $ we have $a_j - a_i \le j - i$. Show that $$\left (\sum_{i=0}^n a_i \right )^2 \ge \sum_{i=0}^n a_i^3$$

[color=darkblue]The sequence $ (a_n)_{n \in \mathbb{N}}$ is defined as follows: \[ a_n \equal{} \dfrac{2}{3 \plus{} 1} \plus{} \dfrac{2^2}{3^2 \plus{} 1} \plus{} \dfrac{2^3}{3^4 \plus{} 1} \plus{} \ldots \plus{} \dfrac{2^{n \plus{} 1}}{3^{2^n} \plus{} 1} \] Prove that $ a_n < 1$ for any $ n \in \mathbb{N}$[/color]

Let $f(x)$ be a nonconstant real polynomial. The sequence $\{a_i\}_{i=1}^{\infty}$ of real numbers is strictly increasing and unbounded, as $$a_{i+1}<a_i+2020.$$ The integers $\lfloor{|f(a_1)|}\rfloor$ , $\lfloor{|f(a_2)|}\rfloor$ , $\lfloor{|f(a_3)|}\rfloor$ , $\dots$ are written consecutively in such a way that their digits form an infinite sequence of digits $\{s_k\}_{k=1}^{\infty}$ (here $s_k\in\{0, 1, \dots, 9\}$). $\quad$If $n\in\mathbb{N}$ , prove that among the numbers $\overline{s_{n(k-1)+1}s_{n(k-1)+2}\cdots s_{nk}}$ , where $k\in\mathbb{N}$ , all $n$-digit numbers appear.

Let $S=\{1,2, \ldots ,10^{10}\}$. Find all functions $f:S \rightarrow S$, such that $$f(x+1)=f(f(x))+1 \pmod {10^{10}}$$ for each $x \in S$ (assume $f(10^{10}+1)=f(1)$).

$P,Q,R$ are non-zero polynomials that for each $z\in\mathbb C$, $P(z)Q(\bar z)=R(z)$. a) If $P,Q,R\in\mathbb R[x]$, prove that $Q$ is constant polynomial. b) Is the above statement correct for $P,Q,R\in\mathbb C[x]$?

For two quadratic trinomials $P(x)$ and $Q(x)$ there is a linear function $\ell(x)$ such that $P(x)=Q(\ell(x))$ for all real $x$. How many such linear functions $\ell(x)$ can exist? [i](A. Golovanov)[/i]

For any $p, q \in N$, we can express $\frac{p}{q}$ as the base $10$ decimal $x_1x_2... x_{\ell}.x_{\ell+1}... x_a \overline{y_1y_2... y_b}$, with the digits $y_1, . . . y_b$ repeating. In other words, $\frac{p}{q}$ can be expressed with integer part $x_1x_2... x_{\ell}$ and decimal part $0.x_{\ell+1}... x_a \overline{y_1y_2... y_b}$. Given that $\frac{p}{q}= \frac{(2021)^{2021}}{2021!}$ , estimate the minimum value of $a$. If $E$ is the exact answer to this question and $A$ is your answer, your score is given by $\max \, \left(0, \left\lfloor 25 - \frac{1}{10}|E - A|\right\rfloor \right)$.

[b]p1.[/b] Three camps are located in the vertices of an equilateral triangle. The roads connecting camps are along the sides of the triangle. Captain America is inside the triangle and he needs to know the distances between camps. Being able to see the roads he has found that the sum of the shortest distances from his location to the roads is 50 miles. Can you help Captain America to evaluate the distances between the camps? [b]p2.[/b] $N$ regions are located in the plane, every pair of them have a non-empty overlap. Each region is a connected set, that means every two points inside the region can be connected by a curve all points of which belong to the region. Iron Man has one charge remaining to make a laser shot. Is it possible for him to make the shot that goes through all $N$ regions? [b]p3.[/b] Money in Wonderland comes in $\$5$ and $\$7$ bills. (a) What is the smallest amount of money you need to buy a slice of pizza that costs $\$1$ and get back your change in full? (The pizza man has plenty of $\$5$ and $\$7$ bills.) For example, having $\$7$ won't do since the pizza man can only give you $\$5$ back. (b) Vending machines in Wonderland accept only exact payment (do not give back change). List all positive integer numbers which CANNOT be used as prices in such vending machines. (That is, find the sums of money that cannot be paid by exact change.) [b]p4.[/b] (a) Put $5$ points on the plane so that each $3$ of them are vertices of an isosceles triangle (i.e., a triangle with two equal sides), and no three points lie on the same line. (b) Do the same with $6$ points. [b]p5.[/b] Numbers $1,2,3,…,100$ are randomly divided in two groups $50$ numbers in each. In the first group the numbers are written in increasing order and denoted $a_1,a_2, ..., a_{50}$. In the second group the numberss are written in decreasing order and denoted $b_1,b_2, ..., b_{50}$. Thus $a_1<a_2<...<a_{50}$ and $ b_1>b_2>...>b_{50}$. Evaluate $|a_1-b_1|+|a_2-b_2|+...+|a_{50}-b_{50}|$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a,b,c$ be positive real numbers that satisfy the condition $a + b + c = 1$. Prove the inequality $$\frac{a^{-3}+b}{1-a}+\frac{b^{-3}+c}{1-b}+\frac{c^{-3}+a}{1-c}\ge 123$$

Let $\{a_n\}$ be a nonnegative real sequence. Define $$X_k = \sum_{i=1}^{2^k}a_i, Y_k = \sum_{i=1}^{2^k}\left\lfloor \frac{2^k}{i}\right\rfloor a_i, k=0,1,2,...$$ Prove that $X_n\le Y_n - \sum_{i=0}^{n-1} Y_i \le \sum_{i=0}^n X_i$ for all positive integer $n$. Here $\lfloor\alpha\rfloor$ denotes the largest integer that does not exceed $\alpha$.

Determine all polynomials $P(x)$ with real coefficients such that $P(x)^2 + P\left(\frac{1}{x}\right)^2= P(x^2)P\left(\frac{1}{x^2}\right)$ for all $x$.

The harmonic table is a triangular array: $1$ $\frac 12 \qquad \frac 12$ $\frac 13 \qquad \frac 16 \qquad \frac 13$ $\frac 14 \qquad \frac 1{12} \qquad \frac 1{12} \qquad \frac 14$ Where $a_{n,1} = \frac 1n$ and $a_{n,k+1} = a_{n-1,k} - a_{n,k}$ for $1 \leq k \leq n-1.$ Find the harmonic mean of the $1985^{th}$ row.

Let the numbers $a_1,a_2,a_3,a_4$ form an arithmetic progression with difference $d\ne0$. Prove that there are no exists geometric progressions $b_1,b_2,b_3,b_4$ and $c_1,c_2,c_3,c_4$ such that: $$a_1=b_1+c_1,a_2=b_2+c_2,a_3=b_3+c_3,a_4=b_4+c_4.$$

The polynomial $Q(x)=x^3-21x+35$ has three different real roots. Find real numbers $a$ and $b$ such that the polynomial $x^2+ax+b$ cyclically permutes the roots of $Q$, that is, if $r$, $s$ and $t$ are the roots of $Q$ (in some order) then $P(r)=s$, $P(s)=t$ and $P(t)=r$.

Assume that $x_1,x_2,\ldots,x_7$ are real numbers such that \[ \begin{array}{r} x_1+4x_2+9x_3+16x_4+25x_5+36x_6+49x_7=1\,\,\,\,\,\,\,\, \\ 4x_1+9x_2+16x_3+25x_4+36x_5+49x_6+64x_7=12\,\,\,\,\, \\ 9x_1+16x_2+25x_3+36x_4+49x_5+64x_6+81x_7=123. \\ \end{array} \] Find the value of \[16x_1+25x_2+36x_3+49x_4+64x_5+81x_6+100x_7.\]

Find all pairs of positive integers $(x, y)$ such that $(xy+1)(xy+x+2)$ be a perfect square .

There are three solutions with different percentages of alcohol. If you mix them in a ratio of $1:2:3$, you get a $20\%$ solution. If you mix them in a ratio of $5: 4: 3,$ you will get a solution with $50\%$ alcohol content. What percentage of alcohol will the solution contain if equal amounts of the original solutions are mixed?