Found problems: 2529
Let $a,b,c\in\mathbb{R^+}$. Prove that $$\frac{a^{11}}{b^5c^5}+\frac{b^{11}}{ c^5a^5}+\frac{c^{11}}{a^5b^5}\ge a+b+c$$ [i](Real Matrik)[/i]
Find all functions $f: \mathbb{R}^{+} \rightarrow \mathbb{R}$ and $g: \mathbb{R}^{+} \rightarrow \mathbb{R}$ such that
$$f(x^2 + y^2) = g(xy)$$
holds for all $x, y \in \mathbb{R}^{+}$.
Positive real numbers $a$ and $b$ satisfy the following conditions: the function $f(x)=x^3+ax^2+2bx-1$ has three different real roots, while the function $g(x)=2x^2+2bx+a$ doesn't have real roots.
Prove that $a-b>1$.
[i](V. Karamzin)[/i]
Given a sequence {$a_n$} such that $a_1=2$ and for all positive integer $n\geq 2$ $a_{n+1}=\frac{a_n^4+9}{16a_n}$. Prove that $\frac {4}{5}<a_n<\frac {5}{4}$
For a positive integer $k\ge 2$ define $\mathcal{T}_k=\{(x,y)\mid x,y=0,1,\ldots, k-1\}$ to be a collection of $k^2$ lattice points on the cartesian coordinate plane. Let $d_1(k)>d_2(k)>\cdots$ be the decreasing sequence of the distinct distances between any two points in $T_k$. Suppose $S_i(k)$ be the number of distances equal to $d_i(k)$.
Prove that for any three positive integers $m>n>i$ we have $S_i(m)=S_i(n)$.
Find all positive integers $x,y$ satisfying the equation \[ 9(x^2+y^2+1) + 2(3xy+2) = 2005 . \]
A rectangular box measures $a \times b \times c$, where $a,$ $b,$ and $c$ are integers and $1 \leq a \leq b \leq c$. The volume and surface area of the box are numerically equal. How many ordered triples $(a,b,c)$ are possible?
$ \textbf{(A) }4\qquad\textbf{(B) }10\qquad\textbf{(C) }12\qquad\textbf{(D) }21\qquad\textbf{(E) }26 $
Let $a,b$ and $c$ be positive real numbers. Prove that \[ \frac{a^2b(b-c)}{a+b}+\frac{b^2c(c-a)}{b+c}+\frac{c^2a(a-b)}{c+a} \ge 0. \]
Numbers $x,y,z$ are positive integers and satisfy the equation $x+y+z=2013$. (E)
a) Find the number of the triplets $(x,y,z)$ that are solutions of the equation (E).
b) Find the number of the solutions of the equation (E) for which $x=y$.
c) Find the solution $(x,y,z)$ of the equation (E) for which the product $xyz$ becomes maximum.
Is there a sequence $ a_1,a_2,\ldots$ of positive reals satisfying simoultaneously the following inequalities for all positive integers $ n$:
a) $ a_1\plus{}a_2\plus{}\ldots\plus{}a_n\le n^2$
b) $ \frac1{a_1}\plus{}\frac1{a_2}\plus{}\ldots\plus{}\frac1{a_n}\le2008$?
The number of real solutions $(x,y,z,w)$ of the simultaneous equations \[2y = x + \frac{17}{x},\quad 2z = y + \frac{17}{y},\quad 2w = z + \frac{17}{z},\quad 2x = w + \frac{17}{w}\] is
$ \textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 8\qquad\textbf{(E)}\ 16 $
Find all real solutions of the equation
\[
\left(1+x^2\right)\left(1+x^3\right)\left(1+x^5\right)=8x^5
\]
Let $n$ be a fixed positive integer. Find the maximum possible value of \[ \sum_{1 \le r < s \le 2n} (s-r-n)x_rx_s, \] where $-1 \le x_i \le 1$ for all $i = 1, \cdots , 2n$.
Let $a, b, c $ be positive real numbers such that $abc = \frac {2} {3}. $ Prove that:
$$\frac {ab}{a + b} + \frac {bc} {b + c} + \frac {ca} {c + a} \geqslant \frac {a+b+c} {a^3+b ^ 3 + c ^ 3}.$$
For an integer $m\geq 1$, we consider partitions of a $2^m\times 2^m$ chessboard into rectangles consisting of cells of chessboard, in which each of the $2^m$ cells along one diagonal forms a separate rectangle of side length $1$. Determine the smallest possible sum of rectangle perimeters in such a partition.
[i]Proposed by Gerhard Woeginger, Netherlands[/i]
Let $n$ numbers all equal to $1$ be written on a blackboard. A move consists of replacing two numbers on the board with two copies of their sum. It happens that after $h$ moves all $n$ numbers on the blackboard are equal to $m.$ Prove that $h \leq \frac{1}{2}n \log_2 m.$
Prove that if $0<x<\pi/2$, then $\sec^6 x+\csc^6 x+(\sec^6 x)(\csc^6 x)\geq 80$.
Let $f: [0,1] \to (0, \infty)$ be an integrable function such that $f(x)f(1-x) = 1$ for all $x\in [0,1]$. Prove that $\int_0^1f(x)dx \geq 1$.
Let $n \geq 3$ be an integer. Let $t_1$, $t_2$, ..., $t_n$ be positive real numbers such that \[n^2 + 1 > \left( t_1 + t_2 + \cdots + t_n \right) \left( \frac{1}{t_1} + \frac{1}{t_2} + \cdots + \frac{1}{t_n} \right).\] Show that $t_i$, $t_j$, $t_k$ are side lengths of a triangle for all $i$, $j$, $k$ with $1 \leq i < j < k \leq 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 $ a$, $ b$, $ c$, $ d$ be positive real numbers such that $ abcd \equal{} 1$ and $ a \plus{} b \plus{} c \plus{} d > \dfrac{a}{b} \plus{} \dfrac{b}{c} \plus{} \dfrac{c}{d} \plus{} \dfrac{d}{a}$. Prove that
\[ a \plus{} b \plus{} c \plus{} d < \dfrac{b}{a} \plus{} \dfrac{c}{b} \plus{} \dfrac{d}{c} \plus{} \dfrac{a}{d}\]
[i]Proposed by Pavel Novotný, Slovakia[/i]
Find all triplets of integers $(a,b,c)$ such that the number
$$N = \frac{(a-b)(b-c)(c-a)}{2} + 2$$
is a power of $2016$.
(A power of $2016$ is an integer of form $2016^n$,where n is a non-negative integer.)
Let $a,b$ be natural numbers with $ab>2$. Suppose that the sum of their greatest common divisor and least common multiple is divisble by $a+b$. Prove that the quotient is at most $\frac{a+b}{4}$. When is this quotient exactly equal to $\frac{a+b}{4}$
Let $a,b,c\in(0,\frac{4}{3})$ and $a + b + c = 3$. Prove that $$\frac{4abc}{(a+b)(a+c)}+\frac{(a+b)^2+(a+c)^2}{(a+b)+(a+c)}\leq\sum_{cyc}\frac{1}{a^2(3b+3c-5)}.$$
Let $\mathbb R$ be the set of real numbers. Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ where there exist a real constant $c\ge 0$ such that $$x^3+y^2f(y)+zf(z^2)\ge cf(xyz)$$ holds for all reals $x$, $y$, $z$ that satisfy $x+y+z\ge 0$.
[i]Proposed by Ivan Chan Kai Chin[/i]