Let $P(x)$ be polynomial with integer coefficients. Prove, that if for any natural $k$ holds equality: $ \underbrace{P(P(...P(0)...))}_{n -times}=0$ then $P(0)=0$ or $P(P(0))=0$

[u]Round 9[/u] [b]p25.[/b] A positive integer is called spicy if it is divisible by the sum if its digits. Find the number of spicy integers between $100$ and $200$ inclusive. [b]p26.[/b] Rectangle $ABCD$ has points $E$ and $F$ on sides $AB$ and $BC$, respectively. Given that $\frac{AE}{BE} = \frac{BF}{FC} =\frac12$, $\angle ADE = 30^o$, and $[DEF] = 25$, find the area of rectangle $ABCD$. [b]p27.[/b] Find the largest value of $n$ for which $3^n$ divides ${100 \choose 33}$. [u]Round 10[/u] [b]p28.[/b] Isosceles trapezoid $ABCD$ is inscribed in a circle such that $AB \parallel CD$, $AB = 2$, $CD = 4$, and $AC = 9$. What is the radius of the circle? [b]p29.[/b] Find the product of all possible positive integers $n$ less than $11$ such that in a group of $n$ people, it is possible for every person to be friends with exactly $3$ other people within the group. Assume that friendship is amutual relationship. [b]p30.[/b] Compute the infinite product $$\left( 1+ \frac{1}{2^1} \right) \left( 1+ \frac{1}{2^2} \right) \left( 1+ \frac{1}{2^4} \right) \left( 1+ \frac{1}{2^8} \right) \left( 1+ \frac{1}{2^{16}} \right) ...$$ [u]Round 11[/u] [b]p31.[/b] Find the sum of all possible values of $x y$ if $x +\frac{1}{y}= 12$ and $\frac{1}{x}+ y = 8$. [b]p32.[/b] Find the number of ordered pairs $(a,b)$, where $0 < a,b < 1999$, that satisfy $a^2 +b^2 \equiv ab$ (mod $1999$) [b]p33.[/b] Let $f :N\to Q$ be a function such that $f(1) =0$, $f (2) = 1$ and $f (n) = \frac{f(n-1)+f (n-2)}{2}$ . Evaluate $$\lim_{n\to \infty} f (n).$$ [u]Round 12[/u] [b]p34.[/b] Estimate the sumof the digits of $2018^{2018}$. The number of points you will receive is calculated using the formula $\max \,(0,15-\log_{10}(A-E))$, where $A$ is the true value and $E$ is your estimate. [b]p35.[/b] Let $C(m,n)$ denote the number of ways to tile an $m$ by $n$ rectangle with $1\times 2$ tiles. Estimate $\log_{10}(C(100, 2))$. The number of points you will recieve is calculated using the formula $\max \,(0,15- \log_{10}(A-E))$, where $A$ is the true value and $E$ is your estimate. [b]p36.[/b] Estimate $\log_2 {1000 \choose 500}$. The number of points you earn is equal to $\max \,(0,15-|A-E|)$, where $A$ is the true value and $E$ is your estimate. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3165983p28809209]here [/url] and 5-8 [url=https://artofproblemsolving.com/community/c3h3165992p28809294]here[/url].. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $P(x)$ be a polynomial of degree $n$ with real coefficients and let $a\geq 3$. Prove that \[\max_{0\leq j \leq n+1}\left | a^j-P(j) \right |\geq 1\]

Given equation ${a^5} - {a^3} + a = 2$, with real $a$ . Prove that $3 < {a^6} < 4$.

Let $p > 1$ be a natural number. Consider the set $F_p$ of all non-constant sequences of non-negative integers that satisfy the recursive relation $a_{n+1} = (p+1)a_n - pa_{n-1}$ for all $n > 0$. Show that there exists a sequence ($a_n$) in $F_p$ with the property that for every other sequence ($b_n$) in $F_p$, the inequality $a_n \le b_n$ holds for all $n$.

Let $n>1$ be an integer and $a,b,c$ be three complex numbers such that $a+b+c=0$ and $a^n+b^n+c^n=0$. Prove that two of $a,b,c$ have the same magnitude. [i]Evan O'Dorney.[/i]

Do there exist a bounded function $f: \mathbb{R}\to\mathbb{R}$ such that $f(1)>0$ and $f(x)$ satisfies an inequality $f^2(x+y)\ge f^2(x)+2f(xy)+f^2(y)$?

For integers $a$ and $b$ with $0 \leq a,b < {2010}^{18}$ let $S$ be the set of all polynomials in the form of $P(x)=ax^2+bx.$ For a polynomial $P$ in $S,$ if for all integers n with $0 \leq n <{2010}^{18}$ there exists a polynomial $Q$ in $S$ satisfying $Q(P(n)) \equiv n \pmod {2010^{18}},$ then we call $P$ as a [i]good polynomial.[/i] Find the number of [i]good polynomials.[/i]

Find all functions $f:\mathbb{Z}^+ \rightarrow \mathbb{Z}^+$ (where $\mathbb{Z}^+$ is the set of positive integers) such that $f(n!) = f(n)!$ for all positive integers $n$ and such that $m-n$ divides $f(m) - f(n)$ for all distinct positive integers $m, n$.

Given an integer $n\ge3$ consider positive integers $x_1,\ldots,x_n$ such that $x_1<x_2<\cdots<x_n<2x_1$. If $p$ is a prime and $r$ is a positive integer such that $p^r$ divides the product $x_1\cdots x_n$, prove that $$\frac{x_1\cdots x_n}{p^r}>n!.$$

Let $n$ ($n \ge 1$) be an integer. Consider the equation $2\cdot \lfloor{\frac{1}{2x}}\rfloor - n + 1 = (n + 1)(1 - nx)$, where $x$ is the unknown real variable. (a) Solve the equation for $n = 8$. (b) Prove that there exists an integer $n$ for which the equation has at least $2021$ solutions. (For any real number $y$ by $\lfloor{y} \rfloor$ we denote the largest integer $m$ such that $m \le y$.)

Let $n\geqslant 3$ be an integer and $x_1>x_2>\cdots>x_n$ be real numbers. Suppose that $x_k>0\geqslant x_{k+1}$ for an index $k{}$. Prove that \[\sum_{i=1}^k\left(x_i^{n-2}\prod_{j\neq i}\frac{1}{x_i-x_j}\right)\geqslant 0.\]

Find all polynomials $P(x)$ with real coefficients such that for all pairwise distinct positive integers $x, y, z, t$ with $x^2 + y^2 + z^2 = 2t^2$ and $\gcd(x, y, z, t ) = 1,$ the following equality holds \[2P^2(t ) + 2P(xy + yz + zx) = P^2(x + y + z) .\] [b]Note.[/b] $P^2(k)=\left( P(k) \right)^2.$

Let $f(x) = x^m + a_1x^{m-1} + \cdots+ a_{m-1}x + a_m$ and $g(x) = x^n + b_1x^{n-1} + \cdots + b_{n-1}x + b_n$ be two polynomials with real coefficients such that for each real number $x, f(x)$ is the square of an integer if and only if so is $g(x)$. Prove that if $n +m > 0$, then there exists a polynomial $h(x)$ with real coefficients such that $f(x) \cdot g(x) = (h(x))^2.$ [hide="Remark."]Remark. The original problem stated $g(x) = x^n + b_1x^{n-1} + \cdots + {\color{red}{ b_{n-1}}} + b_n$, but I think the right form of the problem is what I wrote.[/hide]

Fix a real polynomial $P$ with degree at least $1$, and a real number $c$. Prove that there exist a real number $k$ such that for all reals $a$ and $b$, $$P(a)+P(b)=c \quad \Rightarrow \quad |a+b|<k$$ [i]Proposed by Wong Jer Ren[/i]

Find the biggest real number $C$, such that for every different positive real numbers $a_1,a_2...a_{2019}$ that satisfy inequality : $\frac{a_1}{|a_2-a_3|} + \frac{a_2}{|a_3-a_4|} + ... + \frac{a_{2019}}{|a_1-a_2|} > C$

Let $\mathbb{N}$ denote the set of all positive integers.Function $f:\mathbb{N}\cup{0}\rightarrow\mathbb{N}\cup{0}$ satisfies :for any two distinct positive integer $a,b$, we have $$f(a)+f(b)-f(a+b)=2019$$ (1)Find $f(0)$ (2)Let $a_1,a_2,...,a_{100}$ be 100 positive integers (they are pairwise distinct), find $f(a_1)+f(a_2)+...+f(a_{100})-f(a_1+a_2+...+a_{100})$

If $a, b, c, d>0$ and $abcd=1$, show that $$\frac{ab+1}{a+1}+\frac{bc+1}{b+1}+\frac{cd+1}{c+1}+\frac{da+1}{d+1} \geq 4. $$ When does equality hold?

Determine all functions $f:\mathbb R\to\mathbb R$ such that for all $x, y \in \mathbb R$ $$f(xf(y) - yf(x)) = f(xy) - xy.$$

A sequence $\{a_n\}$ , $a_1=1,a_2=2,a_{n+1}=\dfrac{a_n^2+(-1)^n}{a_{n-1}}$. Show that $a_m^2+a_{m+1}^2\in\{a_n\},\forall m\in\Bbb N$

Let $a_0,a_1,a_2,\dots $ be a sequence of real numbers such that $a_0=0, a_1=1,$ and for every $n\geq 2$ there exists $1 \leq k \leq n$ satisfying \[ a_n=\frac{a_{n-1}+\dots + a_{n-k}}{k}. \]Find the maximum possible value of $a_{2018}-a_{2017}$.

Let $\alpha$ be a real number. Find all the functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that $f(f(x+y))=f(x+y) +f(x)f(y)+ \alpha xy$ for all $x,y \in \mathbb{R}$

Exactly 1600 Coconuts are distributed on exactly 100 monkeys, where some monkeys also can have 0 coconuts. Prove that, no matter how you distribute the coconuts, at least 4 monkeys will always have the same amount of coconuts. (The original problem is written in German. So, I apologize when I've changed the original problem or something has become unclear while translating.)

Let $n\geq 2$ be some fixed positive integer and suppose that $a_1, a_2,\dots,a_n$ are positive real numbers satisfying $a_1+a_2+\cdots+a_n=2^n-1$. Find the minimum possible value of $$\frac{a_1}{1}+\frac{a_2}{1+a_1}+\frac{a_3}{1+a_1+a_2}+\cdots+\frac{a_n}{1+a_1+a_2+\cdots+a_{n-1}}$$

Call a polynomial $p(x)$ with positive integer roots [i]corrupt[/i] if there exists an integer that cannot be expressed as a sum of (not necessarily positive) multiples of its roots. The polynomial $A(x)$ is monic, corrupt, and has distinct roots. As well, $A(0)$ has $7$ positive divisors. Find the least possible value of $|A(1)|$.