Let $ f(x) $ be a polynomial, $ n $ - a natural number. Prove that if $ f(x^{n}) $ is divisible by $ x-1 $, then it is also divisible by $ x^{n-1} + x^{n-2} + \ldots + x + $1.

A sequence of real numbers $a_1,a_2,\ldots$ satisfies the relation $$a_n=-\max_{i+j=n}(a_i+a_j)\qquad\text{for all}\quad n>2017.$$ Prove that the sequence is bounded, i.e., there is a constant $M$ such that $|a_n|\leq M$ for all positive integers $n$.

Prove the inequality $$\frac{a + b}{a^2 -ab + b^2} \le \frac{4}{ |a + b|}$$ for all real numbers $a$ and $b$ with $a + b\ne 0$. When does equality hold?

If $a,b,c$ are real numbers such that $a^2+2b=7$, $b^2+4c=-7$, and $c^2+6a=-14$, find $a^2+b^2+c^2$. $\textbf{(A) }14\qquad\textbf{(B) }21\qquad\textbf{(C) }28\qquad\textbf{(D) }35\qquad\textbf{(E) }49$

[u]Round 1[/u] [b]p1.[/b] Ravi has a bag with $100$ slips of paper in it. Each slip has one of the numbers $3, 5$, or $7$ written on it. Given that half of the slips have the number $3$ written on them, and the average of the values on all the slips is $4.4$, how many slips have $7$ written on them? [b]p2.[/b] In triangle $ABC$, point $D$ lies on side $AB$ such that $AB \perp CD$. It is given that $\frac{CD}{BD}=\frac12$, $AC = 29$, and $AD = 20$. Find the area of triangle $BCD$. [b]p3.[/b] Compute $(123 + 4)(123 + 5) - 123\cdot 132$. [u]Round 2[/u] [b]p4. [/b] David is evaluating the terms in the sequence $a_n = (n + 1)^3 - n^3$ for $n = 1, 2, 3,....$ (that is, $a_1 = 2^3 - 1^3$ , $a_2 = 3^3 - 2^3$, $a_3 = 4^3 - 3^3$, and so on). Find the first composite number in the sequence. (An positive integer is composite if it has a divisor other than 1 and itself.) [b]p5.[/b] Find the sum of all positive integers strictly less than $100$ that are not divisible by $3$. [b]p6.[/b] In how many ways can Alex draw the diagram below without lifting his pencil or retracing a line? (Two drawings are different if the order in which he draws the edges is different, or the direction in which he draws an edge is different). [img]https://cdn.artofproblemsolving.com/attachments/9/6/9d29c23b3ca64e787e717ceff22d45851ae503.png[/img] [u]Round 3[/u] [b]p7.[/b] Fresh Mann is a $9$th grader at Euclid High School. Fresh Mann thinks that the word vertices is the plural of the word vertice. Indeed, vertices is the plural of the word vertex. Using all the letters in the word vertice, he can make $m$ $7$-letter sequences. Using all the letters in the word vertex, he can make $n$ $6$-letter sequences. Find $m - n$. [b]p8.[/b] Fresh Mann is given the following expression in his Algebra $1$ class: $101 - 102 = 1$. Fresh Mann is allowed to move some of the digits in this (incorrect) equation to make it into a correct equation. What is the minimal number of digits Fresh Mann needs to move? [b]p9.[/b] Fresh Mann said, “The function $f(x) = ax^2+bx+c$ passes through $6$ points. Their $x$-coordinates are consecutive positive integers, and their y-coordinates are $34$, $55$, $84$, $119$, $160$, and $207$, respectively.” Sophy Moore replied, “You’ve made an error in your list,” and replaced one of Fresh Mann’s numbers with the correct y-coordinate. Find the corrected value. [u]Round 4[/u] [b]p10.[/b] An assassin is trying to find his target’s hotel room number, which is a three-digit positive integer. He knows the following clues about the number: (a) The sum of any two digits of the number is divisible by the remaining digit. (b) The number is divisible by $3$, but if the first digit is removed, the remaining two-digit number is not. (c) The middle digit is the only digit that is a perfect square. Given these clues, what is a possible value for the room number? [b]p11.[/b] Find a positive real number $r$ that satisfies $$\frac{4 + r^3}{9 + r^6}=\frac{1}{5 - r^3}- \frac{1}{9 + r^6}.$$ [b]p12.[/b] Find the largest integer $n$ such that there exist integers $x$ and $y$ between $1$ and $20$ inclusive with $$\left|\frac{21}{19} -\frac{x}{y} \right|<\frac{1}{n}.$$ PS. You had better use hide for answers. Last rounds have been posted [url=https://artofproblemsolving.com/community/c4h2784267p24464980]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a$, $b$, $c$ be the side lengths of a triangle. Prove that $$ \sqrt[3]{(a^2+bc)(b^2+ca)(c^2+ab)} > \frac{a^2+b^2+c^2}{2}. $$

Find all functions $ f: \mathbb{R} \rightarrow \mathbb{R}$ satisfying \[ f(x^3\plus{}y^3)\equal{}xf(x^2)\plus{}yf(y^2)\] for all real numbers $ x$ and $ y$. [i]Hery Susanto, Malang[/i]

A polynomial $P$ is called [i]level[/i] if it has integer coefficients and satisfies $P\left(0\right)=P\left(2\right)=P\left(5\right)=P\left(6\right)=30$. What is the largest positive integer $d$ such that for any level polynomial $P$, $d$ is a divisor of $P\left(n\right)$ for all integers $n$? $\text{(A) }1\qquad\text{(B) }2\qquad\text{(C) }3\qquad\text{(D) }6\qquad\text{(E) }10$

Three positive reals $x,y,z$ are given so that $xy=\frac{z-x+1}{y}=\frac{z+1}2.$ Prove that one of the numbers is the arithmetic mean of the other two.

Suppose $a_1 =\frac16$ and $a_n = a_{n-1} - \frac{1}{n}+ \frac{2}{n + 1} - \frac{1}{n + 2}$ for $n > 1$. Find $a_{100}$.

[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 $f :\mathbb{N} \rightarrow\mathbb{N}$ be an injective function such that $f(1) = 2,~ f(2) = 4$ and \[f(f(m) + f(n)) = f(f(m)) + f(n)\] for all $m, n \in \mathbb{N}$. Prove that $f(n) = n + 2$ for all $n \ge 2$.

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}.$

Suppose $f$ is a polynomial in $\mathbb{Z}[X]$ and m is integer .Consider the sequence $a_i$ like this $a_1=m$ and $a_{i+1}=f(a_i)$ find all polynomials $f$ and alll integers $m$ that for each $i$: \[ a_i | a_{i+1}\]

[b]a)[/b] Give example of two irrational numbers $ a,b $ having the property that $ a^3,b^3,a+b $ are all rational. [b]b)[/b] Prove that if $ x,y $ are two nonnegative real numbers having the property that $ x^3,y^3,x+y $ are rational, then $ x $ and $ y $ are both rational. [i]Mihai Piticari[/i] and [i]Vladimir Cerbu[/i]

Find $x$ and $y$ ($a$ and $b$ parameters): $$\begin{cases} \dfrac{x-y\sqrt{x^2-y^2}}{\sqrt{1-x^2+y^2}} = a\\ \\ \dfrac{y-x\sqrt{x^2-y^2}}{\sqrt{1-x^2+y^2}} = b\end{cases}$$

Find all values of $n$ for which all solutions of the equation $x^3-3x+n=0$ are integers.

[b]a)[/b] Prove that, for any integer $ k, $ the equation $ x^3-24x+k=0 $ has at most an integer solution. [b]b)[/b] Show that the equation $ x^3+24x-2016=0 $ has exactly one integer solution.

(i) For positive integers $a<b$, let $M(a,b)=\frac{\Sigma^{b}_{k=a}\sqrt{k^2+3k+3}}{b-a+1}$. Calculate $[M(a,b)]$ (ii) Calculate $N(a,b)=\frac{\Sigma^{b}_{k=a}[\sqrt{k^2+3k+3}]}{b-a+1}$.

Determine all functions $f : \mathbb{R} \rightarrow \mathbb{R}$ that satisfy the following equation for all $x, y \in \mathbb{R}$. $$(x+y)f(x-y) = f(x^2-y^2).$$

Find all functions $f$ from the reals to the reals such that \[ \left(f(x)+f(z)\right)\left(f(y)+f(t)\right)=f(xy-zt)+f(xt+yz) \] for all real $x,y,z,t$.

Solve the equation $\sqrt{x^2 - 4x + 13} + 1 = 2x$

Find the largest positive real number $k$ such that the inequality$$a^3+b^3+c^3-3\ge k(3-ab-bc-ca)$$holds for all positive real triples $(a;b;c)$ satisfying $a+b+c=3.$

We will call the sequence of positive real numbers. $a_1,a_2,\dots ,a_n$ of [i]length [/i] $n$ when $$a_1\geq \frac{a_1+a_2}{2}\geq \dots \geq \frac{a_1+a_2+\cdots +a_n}{n}.$$ Let $x_1,x_2,\dots ,x_n$ and $y_1,y_2,\dots ,y_n$ be sequences of length $n.$ Prove that $$\sum_{i = 1}^{n}x_iy_i\geq\frac{1}{n}\left(\sum_{i = 1}^{n}x_i\right)\left(\sum_{i = 1}^{n}y_i\right).$$ [i](tatari/nightmare)[/i]

Find all the functions $f: \mathbb{Z}\to \mathbb{Z}$ satisfying the following property: if $a$, $b$ and $c$ are integers such that $a+b+c=0$, then $$f(a)+f(b)+f(c)=a^2+b^2+c^2.$$