The function $f:\mathbb{N}\rightarrow \mathbb{N}$ is [b]peruvian[/b] if it satifies the following two properties: $\triangleright f$ is strictly increasing. $\triangleright$ The numbers $a_1,a_2,a_3,\dots$ where $a_1=f(1)$ and $a_{n+1}=f(a_n)$ for every $n\geq 1$, are in arithmetic progression. Determine all peruvian functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that $f(1)=3$.

Sum of the roots in the range $\left(-\frac{\pi}{2},\frac{\pi}{2} \right)$ of the equation $\sin x\tan x=x^2$ is [list=1] [*] $\frac{\pi}{2}$ [*] 0 [*] 1 [*] None of these [/list]

A class consisting of $24$ students has participated in the first round of the Georg Mohr Contest, where one could obtain between $0$ and $20$ points. Three of the students obtained exactly the class’s average. If each of the students that scored below the average had scored $4$ points more, the average would have been $3$ points higher. How many students scored above the class’s average?

Consider all polynomials $P(x)$ with real coefficients that have the following property: for any two real numbers $x$ and $y$ one has \[|y^2-P(x)|\le 2|x|\quad\text{if and only if}\quad |x^2-P(y)|\le 2|y|.\] Determine all possible values of $P(0)$. [i]Proposed by Belgium[/i]

$1+2+3+4+5+6=6+7+8$. What is the smallest number $k$ greater than $6$ for which: $1 + 2 +...+ k = k + (k+1) +...+ n$, with $n$ an integer greater than $k$ ?

Japanese businessman Rui lives in America and makes a living from trading cows. On Black Thursday he was selling his cows for $2000$ dollars each (the cows were of the same price), but after the financial crash there were huge fluctuations in the market and Rui was forced to follow them with his pricing. Every day he doubled, halved, multiplied by five or divided by five the price from the previous day (even if it meant he had to give change in cents). At the same time he managed to follow the Japanese superstition, so that the integer part of the price in dollars never started with digit $4$. On the day when Billy visited him to buy some cows the price of each cow was $80$ dollars. What is the minimal number of days that could have passed since Black Thursday by then?

Let $ P (x) $ and $ Q (x) $ be polynomials with real coefficients such that $ P (0)> 0 $ and all coefficients of the polynomial $ S (x) = P (x) \cdot Q (x) $ are integers. Prove that for any positive $ x $ the inequality holds: $$S ({{x} ^ {2}}) - {{S} ^ {2}} (x) \le \frac {1} {4} ({{P} ^ {2}} ({{ x} ^ {3}}) + Q ({{x} ^ {3}})). $$

[b]D[/b]enote $\phi=\frac{\sqrt{5}+1}{2}$ and consider the set of all finite binary strings without leading zeroes. Each string $S$ has a “base-$\phi$” value $p(S)$. For example, $p(1101)=\phi^3+\phi^2+1$. For any positive integer n, let $f(n)$ be the number of such strings S that satisfy $p(S) =\frac{\phi^{48n}-1}{\phi^{48}-1}$. The sequence of fractions $\frac{f(n+1)}{f(n)}$ approaches a real number $c$ as $n$ goes to infinity. Determine the value of $c$.

Evaluate the sum \[ \left\lfloor \frac{2^0}{3} \right\rfloor + \left\lfloor \frac{2^1}{3} \right\rfloor + \left\lfloor \frac{2^2}{3} \right\rfloor + \cdots + \left\lfloor \frac{2^{1000}}{3} \right\rfloor. \]

[u]Round 1[/u] [b]p1.[/b] Ten children arrive at a birthday party and leave their shoes by the door. All the children have different shoe sizes. Later, as they leave one at a time, each child randomly grabs a pair of shoes their size or larger. After some kids have left, all of the remaining shoes are too small for any of the remaining children. What is the greatest number of shoes that might remain by the door? [b]p2.[/b] Turans, the king of Saturn, invented a new language for his people. The alphabet has only $6$ letters: A, N, R, S, T, U; however, the alphabetic order is different than in English. A word is any sequence of $6$ different letters. In the dictionary for this language, the first word is SATURN. Which word follows immediately after TURANS? [b]p3.[/b] Benji chooses five integers. For each pair of these numbers, he writes down the pair's sum. Can all ten sums end with different digits? [b]p4.[/b] Nine dwarves live in a house with nine rooms arranged in a $3\times3$ square. On Monday morning, each dwarf rubs noses with the dwarves in the adjacent rooms that share a wall. On Monday night, all the dwarves switch rooms. On Tuesday morning, they again rub noses with their adjacent neighbors. On Tuesday night, they move again. On Wednesday morning, they rub noses for the last time. Show that there are still two dwarves who haven't rubbed noses with one another. [b]p5.[/b] Anna and Bobby take turns placing rooks in any empty square of a pyramid-shaped board with $100$ rows and $200$ columns. If a player places a rook in a square that can be attacked by a previously placed rook, he or she loses. Anna goes first. Can Bobby win no matter how well Anna plays? [img]https://cdn.artofproblemsolving.com/attachments/7/5/b253b655b6740b1e1310037da07a0df4dc9914.png[/img] [u]Round 2[/u] [b]p6.[/b] Some boys and girls, all of different ages, had a snowball fight. Each girl threw one snowball at every kid who was older than her. Each boy threw one snowball at every kid who was younger than him. Three friends were hit by the same number of snowballs, and everyone else took fewer hits than they did. Prove that at least one of the three is a girl. [b]p7.[/b] Last year, jugglers from around the world travelled to Jakarta to participate in the Jubilant Juggling Jamboree. The festival lasted $32$ days, with six solo performances scheduled each day. The organizers noticed that for any two days, there was exactly one juggler scheduled to perform on both days. No juggler performed more than once on a single day. Prove there was a juggler who performed every day. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ Z$ and $ R$ denote the sets of integers and real numbers, respectively. Let $ f: Z \rightarrow R$ be a function satisfying: (i) $ f(n) \ge 0$ for all $ n \in Z$ (ii) $ f(mn)\equal{}f(m)f(n)$ for all $ m,n \in Z$ (iii) $ f(m\plus{}n) \le max(f(m),f(n))$ for all $ m,n \in Z$ (a) Prove that $ f(n) \le 1$ for all $ n \in Z$ (b) Find a function $ f: Z \rightarrow R$ satisfying (i), (ii),(iii) and $ 0<f(2)<1$ and $ f(2007) \equal{} 1$

Let $n$ be the number of polynomial functions from the integers modulo $2010$ to the integers modulo $2010$. $n$ can be written as $n = p_1 p_2 \cdots p_k$, where the $p_i$s are (not necessarily distinct) primes. Find $p_1 + p_2 + \cdots + p_n$.

Let $t_{k} = a_{1}^k + a_{2}^k +...+a_{n}^k$, where $a_{1}$, $a_{2}$, ... $a_{n}$ are positive real numbers and $k \in \mathbb{N}$. Prove that $$\frac{t_{5}^2 t_1^{6}}{15} - \frac{t_{4}^4 t_{2}^2 t_{1}^2}{6} + \frac{t_{2}^3 t_{4}^5}{10} \geq 0 $$ [i]Proposed by Daniel Velinov[/i]

For each $n \ge 2$ define the polynomial $$f_n(x)=x^n-x^{n-1}-\dots-x-1.$$ Prove that (a) For each $n \ge 2$, $f_n(x)=0$ has a unique positive real root $\alpha_n$; (b) $(\alpha_n)_n$ is a strictly increasing sequence; (c) $\lim_{n \rightarrow \infty} \alpha_n=2.$

Assume that the polynomial $\left(x+1\right)^n-1$ is divisible by some polynomial $P\left(x\right)=x^k+c_{k-1}x^{k-1}+c_{k-2}x^{k-2}+...+c_1x+c_0$, whose degree $k$ is even and whose coefficients $c_{k-1}$, $c_{k-2}$, ..., $c_1$, $c_0$ all are odd integers. Show that $k+1\mid n$.

For a non-constant polynomial $P(x)=a_{n} x^{n}+a_{n-1} x^{n-1}+\ldots+a_{1} x+a_{0} \in \mathbb{R}[x], a_{n} \neq 0, n \in \mathbb{N}$, we say that $P$ is symmetric if $a_{k}=a_{n-k}$ for every $k=0,1, \ldots,\left\lceil\frac{n}{2}\right\rceil$. We define the weight of a non-constant polynomial $P \in \mathbb{R}[x]$, denoted by $t(P)$, as the multiplicity of its zero with the highest multiplicity. a) Prove that there exist non-constant, monic, pairwise distinct polynomials $P_{1}, P_{2}, \ldots, P_{2021} \in \mathbb{R}[x]$, none of which is symmetric, such that the product of any two (distinct) polynomials is symmetric. b) What is the smallest possible value of $t\left(P_{1} \cdot P_{2} \cdot \ldots \cdot P_{2021}\right)$, if $P_{1}, P_{2}, \ldots, P_{2021} \in \mathbb{R}[x]$ are non-constant, monic, pairwise distinct polynomials, none of which is symmetric, and the product of any two (distinct) polynomials is symmetric?

Integers $a,b$ and $c$ satisfy the equality $a+b+c=0$. Denote $S=ab+bc+ac$, $A=a^2+a+1$, $B=b^2+b+1$ and $C=c^2+c+1$. Prove that the number $(S+A)(S+B)(S+C)$ is a perfect square.

Determine all real numbers $x$ such that $$\frac{2002\lfloor x\rfloor}{\lfloor-x\rfloor+x}>\frac{\lfloor2x\rfloor}{x-\lfloor1+x\rfloor}.$$

Prove that for any real numbers $ x_1, x_2, \ldots, x_{1981} $, $ y_1, y_2, \ldots, y_{1981} $ such that $ \sum_{j=1}^{1981} x_j = 0 $, $ \sum_{j=1}^{1981} y_j = 0 $ the inequality occurs $$ \sqrt{\sum_{j=1}^{1981} (x_j^2+y_j^2)} \leq \frac{1}{\sqrt{2}} \sum_{j=1}^{1981} \sqrt{x_j^2+y_j^2}.$$

There are $100$ different real numbers. Prove, that we can put it in $10 \times 10$ table, such that difference between two numbers in cells with common side are not equals $1$ [i]A. Golovanov[/i]

Define the function $f(n)$ for positive integers $n$ as follows: if $n$ is prime, then $f(n) = 1$; and $f(ab) = a \cdot f(b)+f(a)\cdot b$ for all positive integers $a$ and $b$. How many positive integers $n$ less than $5^{50}$ have the property that $f(n) = n$?

Four distinct points are marked in a line. For each point, the sum of the distances from said point to the other three is calculated; getting in total 4 numbers. Decide whether these 4 numbers can be, in some order: a) $29,29,35,37$ b) $28,29,35,37$ c) $28,34,34,37$

Real numbers $x,y,z$ satisfy $$\frac{1}{x}+\frac{1}{y}+\frac{1}{z}+x+y+z=0$$ and none of them lies in the open interval $(-1,1)$. Find the maximum value of $x+y+z$. [i]Proposed by Jaromír Šimša[/i]

Let $ A $ be the set of real solutions of the equation $ 3^x=x+2, $ and let be the set $ B $ of real solutions of the equation $ \log_3 (x+2) +\log_2 \left( 3^x-x \right) =3^x-1 . $ Prove the validity of the following subpoints: [b]a)[/b] $ A\subset B. $ [b]b)[/b] $ B\not\subset\mathbb{Q} \wedge B\not\subset \mathbb{R}\setminus\mathbb{Q} . $

Let $P$ be a polynomial of degree $n$ with only real zeros and real coefficients. Prove that for every real $x$ we have $(n-1)(P'(x))^2\ge nP(x)P''(x)$. When does equality occur?