Let $\mathbb{N}$ be the set of positive integers. Let $f: \mathbb{N} \rightarrow \mathbb{N}$ be a function such that for every positive integer $n \in \mathbb{N}$ $$ f(n) -n<2021 \quad \text{and} \quad f^{f(n)}(n) =n$$ Prove that $f(n)=n$ for infinitely many $n \in \mathbb{N}$

[b]p1.[/b] Find all solutions $a, b, c, d, e, f, g$ if it is known that they represent distinct digits and satisfy the following: $\begin{tabular}{ccccccc} & & & a & b & c & d \\ x & & & & & a & b \\ \hline & & c & d & b & d & b \\ + & c & e & b & f & b & \\ \hline & c & g & a & e & g & b \\ \end{tabular}$ [b]p2.[/b] $5$ numbers are placed on the circle. It is known that the sum of any two neighboring numbers is not divisible by $3$ and the sum of any three consecutive numbers is not divisible by $3$. How many numbers on the circle are divisible by $3$? [b]p3.[/b] $n$ teams played in a volleyball tournament. Each team played precisely one game with all other teams. If $x_j$ is the number of victories and $y_j$ is the number of losses of the $j$th team, show that $$\sum^n_{j=1}x^2_j=\sum^n_{j=1} y^2_j $$ [b]p4.[/b] Three cars participated in the car race: a Ford $[F]$, a Toyota $[T]$, and a Honda $[H]$. They began the race with $F$ first, then $T$, and $H$ last. During the race, $F$ was passed a total of $3$ times, $T$ was passed $5$ times, and $H$ was passed $8$ times. In what order did the cars finish? [b]p5.[/b] The side of the square is $4$ cm. Find the sum of the areas of the six half-disks shown on the picture. [img]https://cdn.artofproblemsolving.com/attachments/c/b/73be41b9435973d1c53a20ad2eb436b1384d69.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $k,r \in \mathbb N$ and let $x\in (0,1)$ be a rational number given in decimal representation \[ x = 0.a_1a_2a_3a_4 \ldots . \] Show that if the decimals $a_k, a_{k+r}, a_{k+2r}, \ldots$ are canceled, the new number obtained is still rational. [i]Dan Schwarz[/i]

Find the nonnegative real numbers $ a,b,c,d $ that satisfy the following system: $$ \left\{ \begin{matrix} a^3+2abc+bcd-6&=&a \\a^2b+b^2c+abd+bd^2&=&b\\a^2b+a^2c+bc^2+cd^2&=&c\\d^3+ab^2+abc+bcd-6&=&d \end{matrix} \right. $$

Alice, Bob, and Carol each independently roll a fair six-sided die and obtain the numbers $a, b, c$, respectively. They then compute the polynomial $f(x)=x^{3}+p x^{2}+q x+r$ with roots $a, b, c$. If the expected value of the sum of the squares of the coefficients of $f(x)$ is $\frac{m}{n}$ for relatively prime positive integers $m, n$, find the remainder when $m+n$ is divided by 1000 .

find the smallest natural number $n$ such that there exists $n$ real numbers in the interval $(-1,1)$ such that their sum equals zero and the sum of their squares equals $20$.

Suppose $ P(x) \equal{} a_nx^n\plus{}\cdots\plus{}a_1x\plus{}a_0$ be a real polynomial of degree $ n > 2$ with $ a_n \equal{} 1$, $ a_{n\minus{}1} \equal{} \minus{}n$, $ a_{n\minus{}2} \equal{}\frac{n^2 \minus{} n}{2}$ such that all the roots of $ P$ are real. Determine the coefficients $ a_i$.

Determine, whether there exist a function $f$ defined on the set of all positive real numbers and taking positive values such that $f(x+y)\geqslant yf(x)+f(f(x))$ for all positive x and y?

Tej writes $2, 3, ..., 101$ on a chalkboard. Every minute he erases two numbers from the board, $x$ and $y$, and writes $xy/(x+y-1)$. If Tej does this for $99$ minutes until only one number remains, what is its maximum possible value?

5. We call $(P_n)_{n\in \mathbb{N}}$ an arithmetic sequence with common difference $Q(x)$ if $\forall n: P_{n+1} = P_n + Q$ $\newline$ We have an arithmetic sequence with a common difference $Q(x)$ and the first term $P(x)$ such that $P,Q$ are monic polynomials with integer coefficients and don't share an integer root. Each term of the sequence has at least one integer root. Prove that: $\newline$ a) $P(x)$ is divisible by $Q(x)$ $\newline$ b) $\text{deg}(\frac{P(x)}{Q(x)}) = 1$

Let $k$ be an odd number that is greater than or equal to $3$. Prove that there exists a $k^{th}$-degree integer-valued polynomial with non-integer-coefficients that has the following properties: (1) $f(0)=0$ and $f(1)=1$; and. (2) There exist infinitely many positive integers $n$ so that if the following equation: \[ n= f(x_1)+\cdots+f(x_s), \] has integer solutions $x_1, x_2, \dots, x_s$, then $s \geq 2^k-1$.

Let $k\ge2$ be an integer. Find the smallest integer $n \ge k+1$ with the property that there exists a set of $n$ distinct real numbers such that each of its elements can be written as a sum of $k$ other distinct elements of the set.

$x_1=\frac{1}{2}$ and $x_{k+1}=\frac{x_k}{x_1^2+...+x_k^2}$ Prove that $\sqrt{x_k^4+4\frac{x_{k-1}}{x_{k+1}}}$ is rational

[b]p1.[/b] Two perpendicular chords intersect in a circle. The lengths of the segments of one chord are $3$ and $4$. The lengths of the segments of the other chord are $6$ and $2$. Find the diameter of the circle. [b]p2.[/b] Determine the greatest integer that will divide $13,511$, $13,903$ and $14,589$ and leave the same remainder. [b]p3.[/b] Suppose $A, B$ and $C$ are the angles of the triangle. Show that $\cos^2 A + \cos^2 B + \cos^2 C + 2 \cos A \cos B \cos C = 1$ [b]p4.[/b] Given the linear fractional transformation $f_1(x) =\frac{2x - 1}{x + 1}$. Define $f_{n+1}(x) = f_1(f_n(x))$ for $n = 1, 2, 3,...$ . It can be shown that $f_{35} = f_5$. (a) Find a function $g$ such that $f_1(g(x)) = g(f_1(x)) = x$. (b) Find $f_{28}$. [b]p5.[/b] Suppose $a$ is a complex number such that $a^{10} + a^5 + 1 = 0$. Determine the value of $a^{2005} + \frac{1}{a^{2005}}$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all pairs $(a,b)$ of real numbers such that $\lfloor an + b \rfloor$ is a perfect square, for all positive integer $n$.

[b]p1.[/b] The case of Mr. Brown, Mr. Potter, and Mr. Smith is investigated. One of them has committed a crime. Everyone of them made two statements. Mr. Brown: I have not done it. Mr. Potter has not done it. Mr. Potter: Mr. Brown has not done it. Mr. Smith has done it. Mr. Smith: I have not done it. Mr. Brown has done it. It is known that one of them told the truth both times, one lied both times, and one told the truth one time and lied one time. Who has committed the crime? [b]p2.[/b] Is it possible to draw in a plane $1000001$ circles of the radius $1$ such that every circle touches exactly three other circles? [b]p3.[/b] Consider a circle of radius $R$ centered at the origin. A particle is “launched” from the $x$-axis at a distance, $d$, from the origin with $0 < d < R$, and at an angle, $\alpha$, with the $x$-axis. The particle is reflected from the boundary of the circle so that the [b]angle of incidence[/b] equals the [b]angle of reflection[/b]. Determine the angle $\alpha$ so that the path of the particle contacts the circle’s interior at exactly eight points. Please note that $\alpha$ should be determined in terms of the qunatities $R$ and $d$. [img]https://cdn.artofproblemsolving.com/attachments/e/3/b8ef9bb8d1b54c263bf2b68d3de60be5b41ad0.png[/img] [b]p4.[/b] Is it possible to find four different real numbers such that the cube of every number equals the square of the sum of the three others? [b]p5. [/b]The Fibonacci sequence $(1, 2, 3, 5, 8, 13, 21, . . .)$ is defined by the following formula: $f_n = f_{n-2} + f_{n-1}$, where $f_1 = 1$, $f_2 = 2$. Prove that any positive integer can be represented as a sum of different members of the Fibonacci sequence. [b]p6.[/b] $10,000$ points are arbitrary chosen inside a square of area $1$ m$^2$ . Does there exist a broken line connecting all these points, the length of which is less than $201$ m$^2? PS. You should use hide for answers.

Let $f: \mathbb{N} \rightarrow \mathbb{N}$ be a bijection and let $k$ be a positive integer such that $|f(x+1)-f(x)| \leq k$ for all positive integers $x$. Show that there exists an integer $d$, such that $f(x)=x+d$ for infinitely many positive integers $x$.

Determine all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that $$f(x + f(y)) + f(x - f(y)) = x.$$

Given the polynomials $P(x)=px^4+qx^3+rx^2+sx+t,\ Q(x)=\frac{d}{dx}P(x)$, find the real numbers $p,\ q,\ r,\ s,\ t$ such that $P(\sqrt{-5})=0,\ Q(\sqrt{-2})=0$ and $\int_0^1 P(x)dx=-\frac{52}{5}.$

In an infinite sequence $\{\alpha\}, \{\alpha^2\}, \{\alpha^3\}, \cdots $ there are finitely many distinct values$.$ Show that $\alpha$ is an integer$. (\{x\}$ denotes the fractional part of$ x.)$ [i](Golovanov A.S.)[/i]

Suppose the real numbers $a, A, b, B$ satisfy the inequalities: $$|A - 3a| \le 1 - a\,\,\, , \,\,\, |B -3b| \le 1 - b$$, and $a, b$ are positive. Prove that $$\left|\frac{AB}{3}- 3ab\right | - 3ab \le 1 - ab.$$

Let $A$ be a finite set of pairs of real numbers such that for any pairs $(a,b)$ in $A$ we have $a>0$. Let $X_0=(x_0, y_0)$ be a pair of real numbers(not necessarily from $A$). We define $X_{j+1}=(x_{j+1}, y_{j+1})$ for all $j\ge 0$ as follows: for all $(a,b)\in A$, if $ax_j+by_j>0$ we let $X_{j+1}=X_j$; otherwise we choose a pair $(a,b)$ in $A$ for which $ax_j+by_j\le 0$ and set $X_{j+1}=(x_j+a, y_j+b)$. Show that there exists an integer $N\ge 0$ such that $X_{N+1}=X_N$.

Find all functions $f(x) = ax^2 + bx + c$, with $a \ne 0$, such that $f(f(1)) = f(f(0)) = f(f(-1))$ .

Solve in $ \mathbb{R}^3 $ the system: $$ \left\{ \begin{matrix} 3^x+4^x=5^y \\8^y+15^y=17^z \\ 20^z+21^z=29^x \end{matrix} \right. $$ [i]Cristinel Mortici[/i]

Is that true that there exist a polynomial $f(x)$ with rational coefficients, not all integers, with degree $n>0$, a polynomial $g(x)$, with integer coefficients, and a set $S$ with $n+1$ integers such that $f(t)=g(t)$ for all $t \in S$?