Let $n\geqslant 0$ be an integer, and let $a_0,a_1,\dots,a_n$ be real numbers. Show that there exists $k\in\{0,1,\dots,n\}$ such that $$a_0+a_1x+a_2x^2+\cdots+a_nx^n\leqslant a_0+a_1+\cdots+a_k$$ for all real numbers $x\in[0,1]$.

Consider a sequence of positive integers $x_n$ such that: \[(\text{A})\ x_{2n+1}=4x_n+2n+2 \] \[(\text{B})\ x_{3n+\color[rgb]{0.9529,0.0980,0.0118}2}=3x_{n+1}+6x_n \] for all $n\ge 0$. Prove that \[(\text{C})\ x_{3n-1}=x_{n+2}-2x_{n+1}+10x_n \] for all $n\ge 0$.

Let $x_0 = 5$ and $x_{n+1} = x_n + \frac{1}{x_n} \ (n = 0, 1, 2, \ldots )$. Prove that \[45 < x_{1000} < 45. 1.\]

A polynomial $p(x) = a_0x^k + a_1x^{k-1} + \cdots + a_k$ with integer coefficients is said to be divisible by an integer $m$ if $p(x)$ is divisible by m for all integers $x$. Prove that if $p(x)$ is divisible by $m$, then $k!a_0$ is also divisible by $m$. Also prove that if $a_0, k,m$ are non-negative integers for which $k!a_0$ is divisible by $m$, there exists a polynomial $p(x) = a_0x^k+\cdots+ a_k$ divisible by $m.$

Let $p$ be a polynomial with degree less than $4$ such that $p(x)$ attains a maximum at $x = 1$. If $p(1) = p(2) = 5$, find $p(10)$.

Let $a$ and $b$ be two positive real numbers such that $a^{2007} = a + 1$ and $b^{4014} = b + 3a$. Determine whether $a > b$ or $b > a$.

Let $S$ be a set of real numbers such that: i) $1$ is from $S$; ii) for any $a, b$ from $S$ (not necessarily different), we have that $a-b$ is also from $S$; iii) for any $a$ from $S$ ($a$ is different from $0$), we have that $1/a$ is from $S$. Show that for every $a, b$ from $S$, we have that $ab$ is from $S$.

Let $p,q\in \mathbb{R}[x]$ such that $p(z)q(\overline{z})$ is always a real number for every complex number $z$. Prove that $p(x)=kq(x)$ for some constant $k \in \mathbb{R}$ or $q(x)=0$. [i]Proposed by Mohammad Ahmadi[/i]

For all $x,y,z$ positive real numbers, find the all $c$ positive real numbers that providing $$\frac{x^3y+y^3z+z^3x}{x+y+z}+\frac{4c}{xyz}\ge2c+2$$

Let $x$ be an irrational number. Show that there are integers $m$ and $n$ such that $\frac{1}{2555}< mx + n <\frac{1}{2012}$

Let \[ f(x_1,x_2,x_3,x_4,x_5,x_6,x_7)=x_1x_2x_4+x_2x_3x_5+x_3x_4x_6+x_4x_5x_7+x_5x_6x_1+x_6x_7x_2+x_7x_1x_3 \] be defined for non-negative real numbers $x_1,x_2,\dots,x_7$ with sum $1$. Prove that $f(x_1,x_2,\dots,x_7)$ has a maximum value and find that value.

Find all functions $f : \mathbb Z \to \mathbb Z$ such that \[f (n |m|) + f (n(|m| +2)) = 2f (n(|m| +1)) \qquad \forall m,n \in \mathbb Z.\] [b]Note.[/b] $|x|$ denotes the absolute value of the integer $x.$

Find all real $a$ such that the equation $3^{\cos (2x)+1}-(a-5)3^{\cos^2(2x)}=7$ has a real root. [hide=Remark] This was the statement given at the contest, but there was actually a typo and the intended equation was $3^{\cos (2x)+1}-(a-5)3^{\cos^2(x)}=7$, which is much easier.

Prove that if the numbers $ x_1 $ and $ x_2 $ are roots of the equation $ x^2 + px - 1 = 0 $, where $ p $ is an odd number, then for every natural $n$number $ x_1^n + x_2^n $ and $ x_1^{n+1} + x_2^{n+1} $ are integer and coprime.

Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that $$f(x^2 + y) \ge (\frac{1}{x} + 1)f(y)$$ holds for all $x \in \mathbb{R} \setminus \{0\}$ and all $y \in \mathbb{R}$.

[b]p1.[/b] An airplane travels between two cities. The first half of the distance between the cities is traveled at a constant speed of $600$ mi/hour, and the second half of the distance is traveled at a a constant speed of $900$ mi/hour. Find the average speed of the plane. [b]p2.[/b] The figure below shows two egg cartons, $A$ and $B$. Carton $A$ has $6$ spaces (cell) and has $3$ eggs. Carton $B$ has $12$ cells and $3$ eggs. Tow cells from the total of $18$ cells are selected at random and the contents of the selected cells are interchanged. (Not that one or both of the selected cells may be empty.) [img]https://cdn.artofproblemsolving.com/attachments/6/7/2f7f9089aed4d636dab31a0885bfd7952f4a06.png[/img] (a) Find the number of selections/interchanges that produce a decrease in the number of eggs in cartoon $A$- leaving carton $A$ with $2$ eggs. (b) Assume that the total number of eggs in cartons $A$ and $B$ is $6$. How many eggs must initially be in carton $A$ and in carton $B$ so that the number of selections/interchanges that lead to an increase in the number of eggs in $A$ equals the number of selections/interchanges that lead to an increase in the number of eggs in $B$. $\bullet$ In other words, find the initial distribution of $6$ eggs between $A$ and $B$ so that the likelihood of an increase in A equals the likelihood of an increase in $B$ as the result of a selection/interchange. Prove your answer. [b]p3.[/b] Divide the following figure into four equal parts (parts should be of the same shape and of the same size, they may be rotated by different angles however they may not be disjoint and reconnected). [img]https://cdn.artofproblemsolving.com/attachments/f/b/faf0adbf6b09b5aaec04c4cfd7ab1d6397ad5d.png[/img] [b]p4.[/b] Find the exact numerical value of $\sqrt[3]{5\sqrt2 + 7}- \sqrt[3]{5\sqrt2 - 7}$ (do not use a calculator and do not use approximations). [b]p5.[/b] The medians of a triangle have length $9$, $12$ and $15$ cm respectively. Find the area of the triangle. [b]p6. [/b]The numbers $1, 2, 3, . . . , 82$ are written in an arbitrary order. Prove that it is possible to cross out $72$ numbers in such a sway the remaining number will be either in increasing order or in decreasing order. PS. You should use hide for answers.

let $m,n\in \mathbb{N}$ and $p(x),q(x),h(x)$ are polynomials with real Coefficients such that $p(x)$ is Descending. and for all $x\in \mathbb{R}$ $p(q(nx+m)+h(x))=n(q(p(x))+h(x))+m$ . prove that dont exist function $f:\mathbb{R}\rightarrow \mathbb{R}$ such that for all $x\in \mathbb{R}$ $f(q(p(x))+h(x))=f(x)^{2}+1$

Let $A = \{m : m$ an integer and the roots of $x^2 + mx + 2020 = 0$ are positive integers $\}$ and $B= \{n : n$ an integer and the roots of $x^2 + 2020x + n = 0$ are negative integers $\}$. Suppose $a$ is the largest element of $A$ and $b$ is the smallest element of $B$. Find the sum of digits of $a + b$.

$S$ is the set of functions $f:\mathbb{N} \to \mathbb{R}$ that satisfy the following conditions: [b]I.[/b] $f(1) = 2$ [b]II.[/b] $f(n+1) \geq f(n) \geq \frac{n}{n + 1} f(2n)$ for $n = 1, 2, \ldots$ Find the smallest $M \in \mathbb{N}$ such that for any $f \in S$ and any $n \in \mathbb{N}, f(n) < M$.

Real numbers $x,y,a$ satisfy the equations $$x+y = x^3 +y^3 = x^5 +y^5 = a$$ Find all possible values of $a$.

Let $\alpha > 1$ be an irrational number and $L$ be a integer such that $L > \frac{\alpha^2}{\alpha - 1}$. A sequence $x_1, x_2, \cdots$ satisfies that $x_1 > L$ and for all positive integers $n$, \[ x_{n+1} = \begin{cases} \left \lfloor \alpha x_n \right \rfloor & \textup{if} \; x_n \leqslant L \\\left \lfloor \frac{x_n}{\alpha} \right \rfloor & \textup{if} \; x_n > L \end{cases}. \] Prove that (i) $\left\{x_n\right\}$ is eventually periodic. (ii) The eventual fundamental period of $\left\{x_n\right\}$ is an odd integer which doesn't depend on the choice of $x_1$.

Find all surjective functions $f:\mathbb{N}\to\mathbb{N}$ such that for all positive integers $a$ and $b$, exactly one of the following equations is true: \begin{align*} f(a)&=f(b), <br /> \\ f(a+b)&=\min\{f(a),f(b)\}. \end{align*} [i]Remarks:[/i] $\mathbb{N}$ denotes the set of all positive integers. A function $f:X\to Y$ is said to be surjective if for every $y\in Y$ there exists $x\in X$ such that $f(x)=y$.

A calculating ruler is a ruler for doing algebric calculations. This ruler has three arms, two of them are sationary and one can move freely right and left. Each of arms is gradient. Gradation of each arm depends on the algebric operation ruler does. For eaxample the ruler below is designed for multiplying two numbers. Gradations are logarithmic. [img]http://aycu05.webshots.com/image/5604/2000468517162383885_rs.jpg[/img] For working with ruler, (e.g for calculating $x.y$) we must move the middle arm that the arrow at the beginning of its gradation locate above the $x$ in the lower arm. We find $y$ in the middle arm, and we will read the number on the upper arm. The number written on the ruler is the answer. 1) Design a ruler for calculating $x^{y}$. Grade first arm ($x$) and ($y$) from 1 to 10. 2) Find all rulers that do the multiplication in the interval $[1,10]$. 3) Prove that there is not a ruler for calculating $x^{2}+xy+y^{2}$, that its first and second arm are grade from 0 to 10.

Solve the equation: \[3\sqrt{3x-1}=x^2+1\]

Given $a, b,c \ge 0, a + b + c = 1$, prove that $(a^2 + b^2 + c^2)^2 + 6abc \ge ab + bc + ac$ (I. Voronovich)