Found problems: 8
Prove that
$$ a+b+c>\left( \sqrt\alpha +\sqrt\beta +\sqrt\gamma \right)^2, $$
for all positive real numbers $ a,b,c,\alpha ,\beta ,\gamma $ that are under the condition
$$ abc>\alpha bc+\beta ac+\gamma ab. $$
[i]Țuțescu Lucian[/i] and [i]Chiriță Aurel[/i]
Let $N$ be a positive integer. Consider a $N \times N$ array of square unit cells. Two corner cells that lie on the same longest diagonal are colored black, and the rest of the array is white. A [i]move[/i] consists of choosing a row or a column and changing the color of every cell in the chosen row or column.
What is the minimal number of additional cells that one has to color black such that, after a finite number of moves, a completely black board can be reached?
Suppose $a,b,c\in \mathbb R^+$. Prove that :\[\left(\frac ab+\frac bc+\frac ca\right)^2\geq (a+b+c)\left(\frac1a+\frac1b+\frac1c\right)\]
Let $ n\ge 2 $ be a perfect square and let be $ n $ natural numbers $ m_1,m_2,\ldots ,m_n. $ Prove that if the polynom
$$ X^2-\left( 1+ m_1^2+m_2^2+\cdots +m_n^2 \right) X+m_1m_2+m_2m_3+\cdots +m_{n-1}m_n +m_nm_1\in \mathbb{N} [X] $$
is reducible, then its two roots are perfect squares.
Let $N$ be a positive integer. Consider a $N \times N$ array of square unit cells. Two corner cells that lie on the same longest diagonal are colored black, and the rest of the array is white. A [i]move[/i] consists of choosing a row or a column and changing the color of every cell in the chosen row or column.
What is the minimal number of additional cells that one has to color black such that, after a finite number of moves, a completely black board can be reached?
Let $ w, x, y, z$ are non-negative reals such that $ wx \plus{} xy \plus{} yz \plus{} zw \equal{} 1$.
Show that $ \frac {w^3}{x \plus{} y \plus{} z} \plus{} \frac {x^3}{w \plus{} y \plus{} z} \plus{} \frac {y^3}{w \plus{} x \plus{} z} \plus{} \frac {z^3}{w \plus{} x \plus{} y}\geq \frac {1}{3}$.
Let $a$, $b$ and $c$ be positive real numbers with $abc = 1$. Determine the minimum possible value of
$$ \left(\frac{a}{b} + \frac{b}{c} + \frac{c}{a}\right) \cdot \left(\frac{ab}{a+b} + \frac{bc}{b+c} + \frac{ca}{c+a}\right) $$
as well as all triples $(a,b,c)$ which attain the minimum.
Let $ w, x, y, z$ are non-negative reals such that $ wx \plus{} xy \plus{} yz \plus{} zw \equal{} 1$.
Show that $ \frac {w^3}{x \plus{} y \plus{} z} \plus{} \frac {x^3}{w \plus{} y \plus{} z} \plus{} \frac {y^3}{w \plus{} x \plus{} z} \plus{} \frac {z^3}{w \plus{} x \plus{} y}\geq \frac {1}{3}$.