Found problems: 592
Suppose that $a,b,c,d$ are positive real numbers satisfying $(a+c)(b+d)=ac+bd$. Find the smallest possible value of
$$\frac{a}{b}+\frac{b}{c}+\frac{c}{d}+\frac{d}{a}.$$
[i]Israel[/i]
Are there any real numbers $a,b,c$ such that $a+b+c=6$, $ab+bc+ca=9$ and $a^4+b^4+c^4=260$? What about if we let $a^4+b^4+c^4=210$?
[i] (Andrei Bâra)[/i]
Tina wrote a positive number on each of five pieces of paper. She did not say which numbers she wrote, but revealed their pairwise sums instead: $17,20,28,14,42,36,28,39,25,31$. Which numbers did she write?
Let $a$ and $b$ be distinct positive integers such that $3^a + 2$ is divisible by $3^b + 2$. Prove that $a > b^2$.
[i]Proposed by Tynyshbek Anuarbekov, Kazakhstan[/i]
Let $ a, b, c $ be the side lengths of a triangle. Prove that
$$ \displaystyle\sum_{cyc} \frac{(a^2 + b^2)(a + c)}{b} \ge 2(a^2 + b^2 + c^2) $$
Let $a, b,c$ be positive real numbers.
Prove that $ \sqrt{a^3b+a^3c}+\sqrt{b^3c+b^3a}+\sqrt{c^3a+c^3b}\ge \frac43 (ab+bc+ca)$
If a b c positive reals smaller than 1, prove:
a+b+c+2abc>ab+bc+ca+2(abc)^(1/2)
Let $ m$ and $ n$ be two positive integers. Let $ a_1$, $ a_2$, $ \ldots$, $ a_m$ be $ m$ different numbers from the set $ \{1, 2,\ldots, n\}$ such that for any two indices $ i$ and $ j$ with $ 1\leq i \leq j \leq m$ and $ a_i \plus{} a_j \leq n$, there exists an index $ k$ such that $ a_i \plus{} a_j \equal{} a_k$. Show that
\[ \frac {a_1 \plus{} a_2 \plus{} ... \plus{} a_m}{m} \geq \frac {n \plus{} 1}{2}.
\]
$a,b,c$ are nonnegative integers that satisfy $a^2+b^2+c^2=3$. Find the minimum and maximum value the sum
$$\frac{1}{1+a+b}+\frac{1}{1+b+c}+\frac{1}{1+c+a}$$
may achieve and find all $a,b,c$ for which equality occurs.\\ \\
[i](Andrei Bâra)[/i]
Prove that for arbitrary positive numbers the following inequality holds
\[\frac{1}{a} + \frac{1}{b} + \frac{1}{c} \leq \frac{a^8 + b^8 + c^8}{a^3b^3c^3}.\]
Let $(x_n)_{n=1}^\infty$ be a sequence defined recursively with: $x_1=2$ and $x_{n+1}=\frac{x_n(x_n+n)}{n+1}$ for all $n \ge 1$. Prove that $$n(n+1) >\frac{(x_1+x_2+ \ldots +x_n)^2}{x_{n+1}}.$$
[i]Proposed by Nikola Velov[/i]
Let $x$, $y$, and $z$ be positive real numbers. Prove that
$\sqrt {\frac {xy}{x^2 + y^2 + 2z^2}} + \sqrt {\frac {yz}{y^2 + z^2 + 2x^2}}+\sqrt {\frac {zx}{z^2 + x^2 + 2y^2}} \le \frac{3}{2}$.
When does equality hold?
Let $a, b$, and $c$ be positive real numbers. Prove that
\[\frac{a^4 + 3}{b} + \frac{b^4 + 3}{c} + \frac{c^4 + 3}{a} \ge 12.\]
When does equality hold?
[i]Proposed by Petar Filipovski[/i]
Let $n$ be an odd positive integer, and let $x_1,x_2,\cdots ,x_n$ be non-negative real numbers. Show that \[ \min_{i=1,\ldots,n} (x_i^2+x_{i+1}^2) \leq \max_{j=1,\ldots,n} (2x_jx_{j+1}) \]where $x_{n+1}=x_1$.
Let $x, y, z$ be positive real numbers such that $2(xy + yz + zx) = xyz$.
Prove that $\frac{1}{(x-2)(y-2)(z-2)} + \frac{8}{(x+2)(y+2)(z+2)} \le \frac{1}{32}$
Let $a,b,A,B$ be given reals. We consider the function defined by \[ f(x) = 1 - a \cdot \cos(x) - b \cdot \sin(x) - A \cdot \cos(2x) - B \cdot \sin(2x). \] Prove that if for any real number $x$ we have $f(x) \geq 0$ then $a^2 + b^2 \leq 2$ and $A^2 + B^2 \leq 1.$
Let $P(x)$ be a polynomial with real non-negative coefficients. Let $k$ be a positive integer and $x_1, x_2, \dots, x_k$ positive real numbers such that $x_1x_2\cdots x_k=1$. Prove that
$$P(x_1)+P(x_2)+\cdots+P(x_k)\geq kP(1).$$
Find all $x$ for which, for all $n,$ \[\sum^n_{k=1} \sin {k x} \leq \frac{\sqrt{3}}{2}.\]
Prove for positive $a,b,c$ that
$$ (a^2+\frac{b^2}{c^2})(b^2+\frac{c^2}{a^2})(c^2+\frac{a^2}{b^2}) \geq abc (a+\frac{1}{a})(b+\frac{1}{b})(c+\frac{1}{c})$$
$a,b,c\in\mathbb{R^+}$ and $a^2+b^2+c^2=48$. Prove that \[a^2\sqrt{2b^3+16}+b^2\sqrt{2c^3+16}+c^2\sqrt{2a^3+16}\le24^2\]
Let $a, b$ and $c$ be pairwise different natural numbers. Prove $\frac{a^3 + b^3 + c^3}{3} \ge abc + a + b + c$.
When does equality holds?
(Karl Czakler)
Let $(a_i,b_i)$ be pairwise distinct pairs of positive integers for $1\le i\le n$. Prove that
\[(a_1+a_2+\ldots+a_n)(b_1+b_2+\ldots+b_n)>\frac29 n^3,\]
and show that the statement is sharp, i.e. for an arbitrary $c>\frac29$ it is possible that
\[(a_1+a_2+\ldots+a_n)(b_1+b_2+\ldots+b_n)<cn^3.\]
[i]Submitted by Péter Pál Pach, Budapest, based on an OKTV problem[/i]
Let $c_1, \ldots, c_n \in \mathbb{R}$ with $n \geq 2$ such that \[ 0 \leq \sum^n_{i=1} c_i \leq n. \] Show that we can find integers $k_1, \ldots, k_n$ such that \[ \sum^n_{i=1} k_i = 0 \] and \[ 1-n \leq c_i + n \cdot k_i \leq n \] for every $i = 1, \ldots, n.$
[hide="Another formulation:"]
Let $x_1, \ldots, x_n,$ with $n \geq 2$ be real numbers such that \[ |x_1 + \ldots + x_n| \leq n. \] Show that there exist integers $k_1, \ldots, k_n$ such that \[ |k_1 + \ldots + k_n| = 0. \] and \[ |x_i + 2 \cdot n \cdot k_i| \leq 2 \cdot n -1 \] for every $i = 1, \ldots, n.$ In order to prove this, denote $c_i = \frac{1+x_i}{2}$ for $i = 1, \ldots, n,$ etc.
[/hide]
Let $a$, $b$, $c$, $d$ and $e$ be distinct positive real numbers such that $a^2+b^2+c^2+d^2+e^2=ab+ac+ad+ae+bc+bd+be+cd+ce+de$
$a)$ Prove that among these $5$ numbers there exists triplet such that they cannot be sides of a triangle
$b)$ Prove that, for $a)$, there exists at least $6$ different triplets
Let $a$, $b$, $c$, $d$ be positive real numbers such that $abcd=1$. Prove that
$1/[(1/2 +a+ab+abc)^{1/2}]+ 1/[(1/2+b+bc+bcd)^{1/2}] + 1/[(1/2+c+cd+cda)^{1/2}] + 1/[1(1/2+d+da+dab)^{1/2}]$ is greater than or equal to $2^{1/2}$.