Let $ a\in \mathbb{R} $ and $ f_1(x),f_2(x),\ldots,f_n(x): \mathbb{R} \rightarrow \mathbb{R} $ are the additive functions such that for every $ x\in \mathbb{R} $ we have $ f_1(x)f_2(x) \cdots f_n(x) =ax^n $. Show that there exists $ b\in \mathbb {R} $ and $ i\in {\{1,2,\ldots,n}\} $ such that for every $ x\in \mathbb{R} $ we have $ f_i(x)=bx $.

Let $a_1$ and $a_2$ be postive real numbers. Let $a_{n+2}=1+\frac{a_{n+1}}{a_{n}}$ Prove that $|a_{2012}-2|<10^{-200}$

Determine $$ \left|\prod^{10}_{k=1}(e^{\frac{i \pi}{2^k}}+ 1) \right|$$ 

Let $z_1,z_2,z_3,\dots,z_{12}$ be the 12 zeroes of the polynomial $z^{12}-2^{36}$. For each $j$, let $w_j$ be one of $z_j$ or $i z_j$. Then the maximum possible value of the real part of $\displaystyle\sum_{j=1}^{12} w_j$ can be written as $m+\sqrt{n}$ where $m$ and $n$ are positive integers. Find $m+n$.

Find all pairs (x; y) of real numbers satisfying the system of equations $x^3 + 1 - xy^2 - y^2 = 0$; $y^3 - 1 - x^2y + x^2 = 0$. Darij

p1. A telephone number with $7$ digits is called a [i]Beautiful Number [/i]if the digits are which appears in the first three numbers (the three must be different) repeats on the next three digits or the last three digits. For example some beautiful numbers: $7133719$, $7131735$, $7130713$, $1739317$, $5433354$. If the numbers are taken from $0, 1, 2, 3, 4, 5, 6, 7, 8$ or $9$, but the number the first cannot be $0$, how many Beautiful Numbers can there be obtained? p2. Find the number of natural numbers $n$ such that $n^3 + 100$ is divisible by $n +10$ p3. A function $f$ is defined as in the following table. [img]https://cdn.artofproblemsolving.com/attachments/5/5/620d18d312c1709b00be74543b390bfb5a8edc.png[/img] Based on the definition of the function $f$ above, then a sequence is defined on the general formula for the terms is as follows: $U_1=2$ and $U_{n+1}=f(U_n)$ , for $n = 1, 2, 3, ...$ p4. In a triangle $ABC$, point $D$ lies on side $AB$ and point $E$ lies on side $AC$. Prove for the ratio of areas: $\frac{ADE }{ABC}=\frac{AD\times AE}{AB\times AC}$ p5. In a chess tournament, a player only plays once with another player. A player scores $1$ if he wins, $0$ if he loses, and $\frac12$ if it's a draw. After the competition ended, it was discovered that $\frac12$ of the total value that earned by each player is obtained from playing with 10 different players who got the lowest total points. Especially for those in rank bottom ten, $\frac12$ of the total score one gets is obtained from playing with $9$ other players. How many players are there in the competition?

What is the minimal value of $\frac{b}{c + d} + \frac{c}{a + b}$ for positive real numbers $b$ and $c$ and non-negative real numbers $a$ and $d$ such that $b + c\ge a + d$?

Find roots of the equation $$1 -\frac{x}{1}+ \frac{x(x - 1)}{2!} -... +\frac{ (-1)^nx(x-1)...(x - n + 1)}{n!}= 0$$

Prove that for every positive integer $n \geq 2$, $$\frac{\sum_{1\leq i \leq n} \sqrt[3]{\frac{i}{n+1}}}{n} \leq \frac{\sum_{1\leq i \leq n-1} \sqrt[3]{\frac{i}{n}}}{n-1}.$$

Suppose $a_1,a_2,a_3,b_1,b_2,b_3$ are distinct positive integers such that \[(n \plus{} 1)a_1^n \plus{} na_2^n \plus{} (n \minus{} 1)a_3^n|(n \plus{} 1)b_1^n \plus{} nb_2^n \plus{} (n \minus{} 1)b_3^n\] holds for all positive integers $n$. Prove that there exists $k\in N$ such that $ b_i \equal{} ka_i$ for $ i \equal{} 1,2,3$.

Positive integer $l$ and positive real numbers $a_1, a_2, ..., a_l$ are given. For every positive integer $n$ we define $$c_n=\sum_{k_1+k_2+...+k_l=n}\frac{(2n)!}{(2k_1)!(2k_2)!...(2k_l)!}a_1^{k_1}a_2^{k_2}...a_l^{k_l}.$$ Prove that for every positive integer $n$ the inequality $\sqrt[n]{c_n}\leq \sqrt[n+1]{c_{n+1}}$ holds.

Let $m,n\geq 2$ be integers. Let $f(x_1,\dots, x_n)$ be a polynomial with real coefficients such that $$f(x_1,\dots, x_n)=\left\lfloor \frac{x_1+\dots + x_n}{m} \right\rfloor\text{ for every } x_1,\dots, x_n\in \{0,1,\dots, m-1\}.$$ Prove that the total degree of $f$ is at least $n$.

Let $a$ and $b$ be positive numbers. Prove the inequality $$\sqrt[3]{\frac ab}+\sqrt[3]{\frac ba}\le\sqrt[3]{2(a+b)\left(\frac1a+\frac1b\right)}.$$

let $x,y$ be non-zero reals such that : $x^3+y^3+3x^2y^2=x^3y^3$ find all values of $\frac{1}{x}+\frac{1}{y}$

Find all monic polynomials $P,Q$ which are non-constant, have real coefficients and they satisfy $2P(x)=Q(\frac{(x+1)^2}{2})-Q(\frac{(x-1)^2}{2})$ and $P(1)=1$ for all real $x$.

Determine all pairs of $(a,b)$ of non negative integers such that: $$\dfrac{a+b}{2} - \sqrt{ab}~=~1$$

For real numbers $ x_{i}>1,1\leq i\leq n,n\geq 2,$ such that: $ \frac{x_{i}^2}{x_{i}\minus{}1}\geq S\equal{}\displaystyle\sum^n_{j\equal{}1}x_{j},$ for all $ i\equal{}1,2\dots, n$ find, with proof, $ \sup S.$

The real numbers $a$, $b$, and $c$ are such that the quadratic trinomials $ax^2 + bx + c$ and $cx^2 + bx + a$ each have two strictly positive real roots. Show that the sum of all these roots is at least $4$.

Given a positive integer $ n$, for all positive integers $ a_1, a_2, \cdots, a_n$ that satisfy $ a_1 \equal{} 1$, $ a_{i \plus{} 1} \leq a_i \plus{} 1$, find $ \displaystyle \sum_{i \equal{} 1}^{n} a_1a_2 \cdots a_i$.

Let $n \geq 1$ be an integer, and $a_0, a_1, \dots, a_{n-1}$ be real numbers such that \[ 1 \geq a_{n-1} \geq a_{n-2} \geq \dots \geq a_1 \geq a_0 \geq 0. \] We assume that $\lambda$ is a real root of the polynomial \[ x^n + a_{n-1} x^{n-1} + \dots + a_1 x + a_0. \] Prove that $|\lambda| \leq 1$.

Three natural numbers $ a,b,c $ with $ \gcd (a,b) =1 $ define in the Diophantine plane a line $ d: ax+by-c=0. $ Prove that: [b]a)[/b] the distance between any two points from $ d $ is at least $ \sqrt{a^2+b^2} . $ [b]b)[/b] the restriction of $ d $ to the first quadrant of the Diophantine plane is a finite line having at most $ 1+\frac{c}{ab} $ elements.

For every integer $ n \geq 2$ determine the minimum value that the sum $ \sum^n_{i\equal{}0} a_i$ can take for nonnegative numbers $ a_0, a_1, \ldots, a_n$ satisfying the condition $ a_0 \equal{} 1,$ $ a_i \leq a_{i\plus{}1} \plus{} a_{i\plus{}2}$ for $ i \equal{} 0, \ldots, n \minus{} 2.$

* A shipment of $13.5$ tons is packed in a number of weightless containers. Each loaded container weighs not more than $350$ kg. Prove that $11$ trucks each of which is capable of carrying · $1.5$ ton can carry this load.

Solve the following equation where $x$ is a real number: $\lfloor x^2 \rfloor -10\lfloor x \rfloor + 24 = 0$

Let $n\geqslant 2$ be a positive integer and $a_1,a_2, \ldots ,a_n$ be real numbers such that \[a_1+a_2+\dots+a_n=0.\] Define the set $A$ by \[A=\left\{(i, j)\,|\,1 \leqslant i<j \leqslant n,\left|a_{i}-a_{j}\right| \geqslant 1\right\}\] Prove that, if $A$ is not empty, then \[\sum_{(i, j) \in A} a_{i} a_{j}<0.\]