Suppose that $a, b, c$ are positive real numbers and $a + b + c = 3$. Prove that $$\frac{a+b}{c+2} + \frac{b+c}{a+2} + \frac{c+a}{b+2} \geq 2$$ and determine when equality holds.

A strongman Bambula can carry several weights at the same time, if their total weight does not exceed $200$ kg, and these weights are no more than three. On the way to work, he injured his finger and found that he could now carry no more than two weights (and still no more than $200$ kg). At what minimum $k$ is the statement true: [i]any set of $100$ weights that Bambula could previously carry in $50$ runs, with a sore finger, he will be able to carry in no more than $k$ runs?[/i]

Let $P(x)$ be a polynomial with at most $n{}$ real coefficeints. Prove that if $P(x)$ has integer values for $n+1$ consecutive values of the argument, then $P(m)\in\mathbb{Z},\forall m\in\mathbb{Z}.$

prove for all $k> 1$ equation $(x+1)(x+2)...(x+k)=y^{2}$ has finite solutions.

The variables $a,b,c,d,$ traverse, independently from each other, the set of positive real values. What are the values which the expression \[ S= \frac{a}{a+b+d} + \frac{b}{a+b+c} + \frac{c}{b+c+d} + \frac{d}{a+c+d} \] takes?

Find all pairs $(p,q)$ such that the equation $$x^4+2px^2+qx+p^2-36=0$$ has exactly $4$ integer roots(counting multiplicity).

A magician intends to perform the following trick. She announces a positive integer $n$, along with $2n$ real numbers $x_1 < \dots < x_{2n}$, to the audience. A member of the audience then secretly chooses a polynomial $P(x)$ of degree $n$ with real coefficients, computes the $2n$ values $P(x_1), \dots , P(x_{2n})$, and writes down these $2n$ values on the blackboard in non-decreasing order. After that the magician announces the secret polynomial to the audience. Can the magician find a strategy to perform such a trick?

Does there exist an integer $n \ge 3$ and an arithmetic sequence $a_0, a_1, ... , a_n$ such that the polynomial $a_nx^n +... + a_1x + a_0$ has $n$ roots which also form an arithmetic sequence?

Anna and Lisa go for a bike ride. Anna's bike breaks down $30$ kilometers before their final destination. The two decide to complete the ride with Lisa's bike as follows: At the beginning, Anna is riding a bike and Lisa leaves. At some point, Anna gets off the bike, parks it on the side of the road and continues by foot. When Lisa gets to the bike, she takes it and rides until she catches up with Anna. After that, they repeat the same procedure. We don't know how many times the procedure is repeated, but they arrive at the final goal at the same time. Anna walks at a speed of $4$ km/h and cycles at a speed of $15$ km/h. Lisa walks at $5$ km/h and cycles with $20$ km/h. How long does it take them to cover the last $30$ km of the road? (Neglect the time it takes to park, lock, unlock the bike, etc.)

$2021$ copies of each of the number from $1$ to $5$ are initially written on the board.Every second Alice picks any two f these numbers, say $a$ and $b$ and writes $\frac{ab}{c}$.Where $c$ is the length of the hypoteneus with sides $a$ and $b$.Alice stops when only one number is left.If the minnimum number she could write was $x$ and the maximum number she could write was $y$ then find the greatest integer lesser than $2021^2xy$. [hide=PS]Does any body know how to use floors and ceiling function?cuz actuall formation used ceiling,but since Idk how to use ceiling I had to do it like this :(]

We say that a prime $p$ is $\textit{philé}$ if there is a polynomial $P$ of non-negative integer coefficients smaller than $p$ and with degree $3$, that is, $P(x) = ax^3 + bx^2 + cx + d$ where $a, b, c, d < p$, such that $$\{P(n) | 1 \leq n \leq p\}$$ is a complete residue system modulo $p$. Find all $\textit{philé}$ primes. Note: A set $A$ is a complete residue system modulo $p$ if for every integer $k$, with $0 \leq k \leq p - 1$, there exists an element $a \in A$ such that $$p | a-k.$$

$(SWE 2)$ For each $\lambda (0 < \lambda < 1$ and $\lambda = \frac{1}{n}$ for all $n = 1, 2, 3, \cdots)$, construct a continuous function $f$ such that there do not exist $x, y$ with $0 < \lambda < y = x + \lambda \le 1$ for which $f(x) = f(y).$

Find all real-valued functions $f$ defined on the set of real numbers such that $$f(f(x)+y)+f(x+f(y))=2f(xf(y))$$ for any real numbers $x$ and $y$.

Find all real roots $x$ of the equation $$\sqrt{x^2-2x-1}+\sqrt{x^2+2x-1}=p,$$ where $p$ is a real parameter.

Let $a_1,a_2,\cdots ,a_{100}$ be non-negative integers such that $(1)$ There are positive integers$ k\leq 100$ such that $a_1\leq a_2\leq \cdots\leq a_{k}$ and $a_i=0$ $(i>k);$ $(2)$ $ a_1+a_2+a_3+\cdots +a_{100}=100;$ $(3)$ $ a_1+2a_2+3a_3+\cdots +100a_{100}=2022.$ Find the minimum of $ a_1+2^2a_2+3^2a_3+\cdots +100^2a_{100}.$

We say that a function $f: \mathbb{Z}_{\ge 0} \times \mathbb{Z}_{\ge 0} \to \mathbb{Z}$ is [i]great[/i] if for any nonnegative integers $m$ and $n$, \[f(m + 1, n + 1) f(m, n) - f(m + 1, n) f(m, n + 1) = 1.\] If $A = (a_0, a_1, \dots)$ and $B = (b_0, b_1, \dots)$ are two sequences of integers, we write $A \sim B$ if there exists a great function $f$ satisfying $f(n, 0) = a_n$ and $f(0, n) = b_n$ for every nonnegative integer $n$ (in particular, $a_0 = b_0$). Prove that if $A$, $B$, $C$, and $D$ are four sequences of integers satisfying $A \sim B$, $B \sim C$, and $C \sim D$, then $D \sim A$. [i]Ankan Bhattacharya[/i]

Let $x,y$ be real numbers such that $(x+1)(y+2)=8.$ Prove that $$(xy-10)^2\ge 64.$$

Product of square trinomials $ x ^ 2 + a_1x + b_1 $, $ x ^ 2 + a_2x + b_2 $, $ \dots $, $ x ^ 2 + a_n x + b_n $ equals polynomial $ P (x) = x ^ {2n} + c_1x ^ {2n-1} + c_2x ^ {2n-2} + \dots + c_ {2n-1} x + c_ {2n} $, where the coefficients $ c_1 $, $ c_2 $, $ \dots $, $ c_ {2n} $ are positive. Prove that for some $ k $ ($ 1 \leq k \leq n $) the coefficients $ a_k $ and $ b_k $ are positive.

Find all quadruplets $(x_1, x_2, x_3, x_4)$ of real numbers such that the next six equalities apply: $$\begin{cases} x_1 + x_2 = x^2_3 + x^2_4 + 6x_3x_4\\ x_1 + x_3 = x^2_2 + x^2_4 + 6x_2x_4\\ x_1 + x_4 = x^2_2 + x^2_3 + 6x_2x_3\\ x_2 + x_3 = x^2_1 + x^2_4 + 6x_1x_4\\ x_2 + x_4 = x^2_1 + x^2_3 + 6x_1x_3 \\ x_3 + x_4 = x^2_1 + x^2_2 + 6x_1x_2 \end{cases}$$

Show that $abc \le (ab + bc + ca)(a^2 + b^2 + c^2)^2$ for all positive real numbers $a, b$ and $c$ such that $a + b + c = 1$.

Prove that for all positive integers $m$ and $n$, $$\frac1m\cdot\binom{2n}0-\frac1{m+1}\cdot\binom{2n}1+\frac1{m+2}\cdot\binom{2n}2-\ldots+\frac1{m+2n}\cdot\binom{2n}{n2}>0$$

Find the smallest positive number $a$ for which $$\sin a^o = \sin a$$ (on the left ($a^o$) is an angle of $a$ degrees, on the right is an angle in $a$ radians).

Let $(x_n)_{n\in Z}$ and $(y_n)_{n\in Z}$ be two sequences of integers such that $|x_{n+2} - x_n| \le 2$ and $x_n + x_m = y_{n^2+m^2}$ for all $n, m \in Z$. Show that the sequence of $x_n$s takes at most $6$ distinct values. (Paolo Leonetti)

Find all functions $f : \mathbb{R}\to\mathbb{R}$ such that $f(0) = 0$ and for any real numbers $x, y$ the following equality holds \[f(x^2+yf(x))+f(y^2+xf(y))=f(x+y)^2.\]

Let $G$ be the set of polynomials of the form \[P(z)=z^n+c_{n-1}z^{n-1}+\cdots+c_2z^2+c_1z+50,\] where $c_1,c_2,\cdots, c_{n-1}$ are integers and $P(z)$ has $n$ distinct roots of the form $a+ib$ with $a$ and $b$ integers. How many polynomials are in $G$? ${ \textbf{(A)}\ 288\qquad\textbf{(B)}\ 528\qquad\textbf{(C)}\ 576\qquad\textbf{(D}}\ 992\qquad\textbf{(E)}\ 1056 $