Let $a_1,..., a_n$ be positive reals and let $x_1, ... , x_n$ be real numbers such that $a_1x_1 +...+ a_nx_n = 0$. Prove that $$\sum_{1\le i<j \le n} x_ix_j |a_i - a_j | \le 0.$$ When does the equality take place?

Solve the set of simultaneous equations \begin{align*} v^2+ w^2+ x^2+ y^2 &= 6 - 2u, \\ u^2+ w^2+ x^2+ y^2 &= 6 - 2v, \\ u^2+ v^2+ x^2+ y^2 &= 6- 2w, \\ u^2+ v^2+ w^2+ y^2 &= 6 - 2x, \\ u^2+ v^2+ w^2+ x^2 &= 6- 2y. \end{align*}

In the increasing sequence of positive integers $a_1$, $a_2$,. . . , the number $a_k$ is said to be funny if it can be represented as the sum of some other terms (not necessarily distinct) of the sequence. (a) Prove that all but finitely terms of the sequence are funny. (b) Does the result in (a) always hold if the terms of the sequence can be any positive rational numbers?

Find all the possible values of a positive integer $n$ for which the expression $S_n=x^n+y^n+z^n$ is constant for all real $x,y,z$ with $xyz=1$ and $x+y+z=0$.

Let $a$ and $b$ be real numbers such that $\max_{0\le x\le 1} |x^3 - ax - b|$ is as small as possible. Find $a + b$ in simplest radical form. (Hint: If $f(x) = x^3 - cx - d$, then the maximum (or minimum) of $f(x)$ either occurs when $x = 0$ and/or $x = 1$ and/or when x satisfies $3x^2 - c = 0$).

Prove that among any $2n+1$ irrational numbers there are $n+1$ numbers such that the sum of any $k$ of them is irrational, for all $k \in \{1,2,3,\ldots, n+1 \}$.

The sequence of Fibonacci numbers $F_0, F_1, F_2, . . .$ is defined by $F_0 = F_1 = 1 $ and $F_{n+2} = F_n+F_{n+1}$ for all $n > 0$. For example, we have $F_2 = F_0 + F_1 = 2, F_3 = F_1 + F_2 = 3, F_4 = F_2 + F_3 = 5$, and $F_5 = F_3 + F_4 = 8$. The sequence $a_0, a_1, a_2, ...$ is defined by $a_n =\frac{1}{F_nF_{n+2}}$ for all $n \ge 0$. Prove that for all $m \ge 0$ we have: $a_0 + a_1 + a_2 + ... + a_m < 1$.

Consider the equation \[\frac{xy-C}{x+y}= k ,\] where all symbols used are positive integers. 1. Show that, for any (fixed) values $C, k$ this equation has at least a solution $x, y$; 2. Show that, for any (fixed) values $C, k$ this equation has at most a finite number of solutions $x, y$; 3. Show that, for any $C, n$ there exists $k = k(C,n)$ such that the equation has more than $n$ solutions $x, y$.

Suppose $P(x)$ is a degree $n$ monic polynomial with integer coefficients such that $2013$ divides $P(r)$ for exactly $1000$ values of $r$ between $1$ and $2013$ inclusive. Find the minimum value of $n$.

Find all functions $f\colon \mathbb{R}\to\mathbb{R}$ that satisfy $f(x+y)-f(x-y)=2y(3x^2+y^2)$ for all $x,y{\in}R$ ______________________________________ Azerbaijan Land of the Fire :lol:

Suppose that $n>1$ and $P_n(x)$ is a polynomial of degree $n$. For $k =1,2, . . . ,n$ we have $P_n(k)=k(k+1)$. Also $P_n(0) = 1$. For all $n$ there exists an integer $m > n$ such that $P_n(m) = P_{n+2}(m)$. Find the value of $m$ for $n = 10$.

$\lim _{x \rightarrow 0^{+}} \frac{[x]}{\tan x}$ where $[x]$ is the greatest integer function [list=1] [*] -1 [*] 0 [*] 1 [*] Does not exists [/list]

Solve equation : $\sqrt{x+\sqrt{4x+\sqrt{16x}+..+\sqrt{4^nx+3}}}-\sqrt{x}=1$

Let $p, q$ be real numbers. Knowing that there are positive real numbers $a, b, c$, different two by two, such that $$p=\frac{a^2}{(b-c)^2}+\frac{b^2}{(a-c)^2}+\frac{c^2}{(a-b)^2},$$ $$q=\frac{1}{(b-c)^2}+\frac{1}{(a-c)^2}+\frac{1}{(b-a)^2}$$ calculate the value of $$\frac{a}{(b-c)^2}+\frac{b}{(a-c)^2}+\frac{c}{(b-a)^2}$$ in terms of $p, q$.

When rolling two normal dice, the set of possible outcomes of the sum of the points is $2, 3, 3, 4,4, 4,..., 11, 11,12$. Notice that this sequence can be obtained from the identity $$(x + x^2 + x^3 + x^4 + x^5 + x^6) (x + x^2 + x^3 + x^4 + x^5 + x^6) = x^2 + 2x^3 + 3x^4 +... + 2x^{11} + x^{12}.$$ Design a crazy pair of dice, that is, two other cubes, not necessarily the same, with a natural number indicated on each face, such that the set of possible results of the sum of its points is equal to of two normal dice.

[u]Round 9[/u] [b]p25.[/b] Circle $\omega_1$ has radius $1$ and diameter $AB$. Let circle $\omega_2$ be a circle withm aximum radius such that it is tangent to $AB$ and internally tangent to $\omega_1$. A point $C$ is then chosen such that $\omega_2$ is the incircle of triangle $ABC$. Compute the area of $ABC$. [b]p26.[/b] Two particles lie at the origin of a Cartesian plane. Every second, the first particle moves from its initial position $(x, y)$ to one of either $(x +1, y +2)$ or $(x -1, y -2)$, each with probability $0.5$. Likewise, every second the second particle moves from it’s initial position $(x, y)$ to one of either $(x +2, y +3)$ or $(x -2, y -3)$, each with probability $0.5$. Let $d$ be the distance distance between the two particles after exactly one minute has elapsed. Find the expected value of $d^2$. [b]p27.[/b] Find the largest possible positive integer $n$ such that for all positive integers $k$ with $gcd (k,n) = 1$, $k^2 -1$ is a multiple of $n$. [u]Round 10[/u] [b]p28.[/b] Let $\vartriangle ABC$ be a triangle with side lengths $AB = 13$, $BC = 14$, $C A = 15$. Let $H$ be the orthcenter of $\vartriangle ABC$, $M$ be the midpoint of segment $BC$, and $F$ be the foot of altitude from $C$ to $AB$. Let $K$ be the point on line $BC$ such that $\angle MHK = 90^o$. Let $P$ be the intersection of $HK$ and $AB$. Let $Q$ be the intersection of circumcircle of $\vartriangle FPK$ and $BC$. Find the length of $QK$. [b]p29.[/b] Real numbers $(x, y, z)$ are chosen uniformly at random from the interval $[0,2\pi]$. Find the probability that $$\cos (x) \cdot \cos (y)+ \cos(y) \cdot \cos (z)+ \cos (z) \cdot \cos(x) + \sin (x) \cdot \sin (y)+ \sin (y) \cdot \sin (z)+ \sin (z) \cdot \sin (x)+1$$ is positive. [b]p30.[/b] Find the number of positive integers where each digit is either $1$, $3$, or $4$, and the sum of the digits is $22$. [u]Round 11[/u] [b]p31.[/b] In $\vartriangle ABC$, let $D$ be the point on ray $\overrightarrow{CB}$ such that $AB = BD$ and let $E$ be the point on ray $\overrightarrow{AC}$ such that $BC =CE$. Let $L$ be the intersection of $AD$ and circumcircle of $\vartriangle ABC$. The exterior angle bisector of $\angle C$ intersects $AD$ at $K$ and it follows that $AK = AB +BC +C A$. Given that points $B$, $E$, and $L$ are collinear, find $\angle C AB$. [b]p32.[/b] Let $a$ be the largest root of the equation $x^3 -3x^2 +1 0$. Find the remainder when $\lfloor a^{2019} \rfloor$ is divided by $17$. [b]p33.[/b] For all $x, y \in Q$, functions $f , g ,h : Q \to Q$ satisfy $f (x + g (y)) = g (h( f (x)))+ y$. If $f (6)=2$, $g\left( \frac12 \right) = 2$, and $h \left( \frac72 \right)= 2$, find all possible values of $f (2019)$. [u]Round 12[/u] [b]p34.[/b] An $n$-polyomino is formed by joining $n$ unit squares along their edges. A free polyomino is a polyomino considered up to congruence. That is, two free polyominos are the same if there is a combination of translations, rotations, and reflections that turns one into the other. Let $P(n)$ be the number of free $n$-polyominos. For example, $P(3) = 2$ and $P(4) = 5$. Estimate $P(20)+P(19)$. If your estimate is $E$ and the actual value is $A$, your score for this problem will be $$\max \, \left( 0, \left \lfloor 15-10 \cdot \left|\log_{10} \left( \frac{A}{E} \right) \right| \right \rfloor \right).$$ [b]p35.[/b] Estimate $$\sum^{2019}_{k=1} sin(k),$$ where $k$ is measured in radians. If your estimate is $E$ and the actual value is $A$, your score for this problem will be $\max \, (0,15-10 \cdot |E - A|)$ . [b]p36.[/b] For a positive integer $n$, let $r_{10}(n)$ be the number of $10$-tuples of (not necessarily positive) integers $(a_1,a_2,... ,a_9,a_{10})$ such that $$a^2_1 +a^2_2+ ...+a^2_9+a^2_{10}= n.$$ Estimate $r_{10}(20)+r_{10}(19)$. If your estimate is $E$ and the actual value is $A$, your score for this problem will be$$\max \, \left( 0, \left \lfloor 15-10 \cdot \left|\log_{10} \left( \frac{A}{E} \right) \right| \right \rfloor \right).$$ PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3165997p28809441]here [/url] and 5-8 [url=https://artofproblemsolving.com/community/c3h3166012p28809547]here[/url].Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Show that for all integers $ n \ge 2$, $ \sqrt { 2\sqrt[3]{3 \sqrt[4]{4...\sqrt[n]{n}}}}<2$

Consider an infinite sequence of positive integers in which each positive integer occurs exactly once. Let $\{a_n\}, n\ge 1$ be such a sequence. We call it [i]consistent [/i] if, for an arbitrary natural $k$ and every natural $n ,m$ such that $a_n <a_m$, the inequality $a_{kn} <a _{km}$ also holds. For example, the sequence $a_n = n$ is consistent . a) Prove that there are consistent sequences other than $a_n = n$. b) Are there consistent sequences for which $a_n \ne n, n\ge 2$ ? c) Are there consistent sequences for which $a n \ne n, n\ge 1$ ?

(a) Show that, if $I \subset R$ is a closed bounded interval, and $f : I \to R$ is a non-constant monic polynomial function such that $max_{x\in I}|f(x)|< 2$, then there exists a non-constant monic polynomial function $g : I \to R$ such that $max_{x\in I} |g(x)| < 1$. (b) Show that there exists a closed bounded interval $I \subset R$ such that $max_{x\in I}|f(x)| \ge 2$ for every non-constant monic polynomial function $f : I \to R$.

Prove that a fifth-degree polynomial $$ P(x) = x^5 - 3x^4 + 6x^3 - 3x^2 + 9x - 6$$ is not the product of two lower-degree polynomials with integer coefficients.

Find all solutions for real $x$, $$\lfloor x\rfloor^3 -7 \lfloor x+\frac{1}{3} \rfloor=-13.$$

Let $P$ be a polynomial of degree $6$ and let $a,b$ be real numbers such that $0<a<b$. Suppose that $P(a)=P(-a),P(b)=P(-b),P'(0)=0$. Prove that $P(x)=P(-x)$ for all real $x$.

Let $a,b,c$ be nonnegative real numbers.Prove that $3(a^2+b^2+c^2)\ge (a+b+c)(\sqrt{ab}+\sqrt{bc}+\sqrt{ca})+(a-b)^2+(b-c)^2+(c-a)^2\ge (a+b+c)^2$.

Let $ x, y, z$ be distinct non-negative real numbers. Prove that \[ \frac{1}{(x\minus{}y)^2} \plus{} \frac{1}{(y\minus{}z)^2} \plus{} \frac{1}{(z\minus{}x)^2} \geq \frac{4}{xy \plus{} yz \plus{} zx}.\] When does the equality hold?

Determine all functions $ f: \mathbb{R} \to \mathbb{R}$ satisfying the condition $ f(xy) \le xf(y)$ for all real numbers $ x$ and $ y$.