Found problems: 1671
Let $\alpha\neq0$ be a real number. Determine all functions $f:\mathbb R\to\mathbb R$ such that \[f\left(x^2+y^2\right)=f(x-y)f(x+y)+\alpha yf(y)\] holds for all $x, y\in\mathbb R.$
Let $ x_1,x_2,\ldots,x_n $ be positive real numbers and $ x_{n+1} = x_1 + x_2 + \cdots + x_n $. Prove that
\[ \sum_{k=1}^n \sqrt { x_k (x_{n+1} - x_k)} \leq \sqrt { \sum_{k=1}^n x_{n+1}(x_{n+1}-x_k)}. \]
[i]Mircea Becheanu[/i]
Let $ n$ be an even positive integer. Let $ A_1, A_2, \ldots, A_{n \plus{} 1}$ be sets having $ n$ elements each such that any two of them have exactly one element in common while every element of their union belongs to at least two of the given sets. For which $ n$ can one assign to every element of the union one of the numbers 0 and 1 in such a manner that each of the sets has exactly $ \frac {n}{2}$ zeros?
Given a real number $\alpha$ and consider function $\varphi(x)=x^2e^{\alpha x}$ for $x\in\mathbb R$. Find all function $f:\mathbb R\to\mathbb R$ that satisfy: $$f(\varphi(x)+f(y))=y+\varphi(f(x))$$ forall $x,y\in\mathbb R$
Find all triples $(x, y, z)$ of real positive numbers, which satisfy the system $\begin{cases} \frac{1}{x}+\frac{4}{y}+\frac{9}{z}=3 \\ x + y + z \le 12 \end{cases}$
Show that if $a, b, c$ are the lengths of the sides of a triangle and if $2S = a + b + c$, then
\[\frac{a^n}{b+c} + \frac{b^n}{c+a} +\frac{c^n}{a+b} \geq \left(\dfrac 23 \right)^{n-2}S^{n-1} \quad \forall n \in \mathbb N \]
[i]Proposed by Greece.[/i]
Initially the numbers $i^3-i$ for $i=2,3 \ldots 2n+1$ are written on a blackboard, where $n\geq 2$ is a positive integer. On one move we can delete three numbers $a, b, c$ and write the number $\frac{abc} {ab+bc+ca}$. Prove that when two numbers remain on the blackboard, their sum will be greater than $16$.
Let $a_1 , a_2 , a_3 ,\ldots$ be a sequence of positive real numbers, define $s_n = \frac{a_1 +a_2 +\ldots+a_n }{n}$ and $r_n = \frac{a_{1}^{-1} +a_{2}^{-1} +\ldots+a_{n}^{-1} }{n}.$ Given that $\lim_{n\to \infty} s_n $ and $\lim_{n\to \infty} r_n $ exist, prove that the product of these limits is not less than $1.$
Let $A$ be a set with $|A|=225$, meaning that $A$ has 225 elements. Suppose further that there are eleven subsets $A_1, \ldots, A_{11}$ of $A$ such that $|A_i|=45$ for $1\leq i\leq11$ and $|A_i\cap A_j|=9$ for $1\leq i<j\leq11$. Prove that $|A_1\cup A_2\cup\ldots\cup A_{11}|\geq 165$, and give an example for which equality holds.
Let a,b, and c be positive reals. Prove:
$\left(\frac{a}{b}+\frac{b}{c}+\frac{c}{a}\right)^{2}\ge (a+b+c)\left(\frac{1}{a}+\frac{1}{b}+\frac{1}{c}\right)$
For some positive integer $n,$ Elmo writes down the equation
\[x_1+x_2+\dots+x_n=x_1+x_2+\dots+x_n.\]
Elmo inserts at least one $f$ to the left side of the equation and adds parentheses to create a valid functional equation. For example, if $n=3,$ Elmo could have created the equation
\[f(x_1+f(f(x_2)+x_3))=x_1+x_2+x_3.\]
Cookie Monster comes up with a function $f: \mathbb{Q}\to\mathbb{Q}$ which is a solution to Elmo's functional equation. (In other words, Elmo's equation is satisfied for all choices of $x_1,\dots,x_n\in\mathbb{Q})$. Is it possible that there is no integer $k$ (possibly depending on $f$) such that $f^k(x)=x$ for all $x$?
[i]Srinivas Arun[/i]
Let $ x$, $ y$ and $ z$ be non negative reals, such that there are not two simultaneously equal to $ 0$. Show that
$ \frac {x \plus{} y}{y \plus{} z} \plus{} \frac {y \plus{} z}{x \plus{} y} \plus{} \frac {y \plus{} z}{z \plus{} x} \plus{} \frac {z \plus{} x}{y \plus{} z} \plus{} \frac {z \plus{} x}{x \plus{} y} \plus{} \frac {x \plus{} y}{z \plus{} x}\geq\ 5 \plus{} \frac {x^{2} \plus{} y^{2} \plus{} z^{2}}{xy \plus{} yz \plus{} zx}$
and determine the equality cases.
Let $x, y,$ and $z$ be positive real numbers such that $xy + yz + zx = 3$. Prove that
$$\frac{x + 3}{y + z} + \frac{y + 3}{z + x} + \frac{z + 3}{x + y} + 3 \ge 27 \cdot \frac{(\sqrt{x} + \sqrt{y} + \sqrt{z})^2}{(x + y + z)^3}.$$
Proposed by [i]Petar Filipovski, Macedonia[/i]
Let $a, b,$ and $c$ be positive real numbers such that $a^2 + b^2 + c^2 = 3$. Prove that
$$\frac{a^2 + b^2}{2ab} + \frac{b^2 + c^2}{2bc} + \frac{c^2 + a^2}{2ca} + \frac{2(ab + bc + ca)}{3} \ge 5 $$
When equality holds?
For all positive integer $ n\geq 2$, prove that product of all prime numbers less or equal than $ n$ is smaller than $ 4^{n}$.
Let $ n$ be a given positive integer. In the coordinate set, consider the set of points $ \{P_{1},P_{2},...,P_{4n\plus{}1}\}\equal{}\{(x,y)|x,y\in \mathbb{Z}, xy\equal{}0, |x|\le n, |y|\le n\}.$
Determine the minimum of $ (P_{1}P_{2})^{2} \plus{} (P_{2}P_{3})^{2} \plus{}...\plus{} (P_{4n}P_{4n\plus{}1})^{2} \plus{} (P_{4n\plus{}1}P_{1})^{2}.$
Let $\,{\mathbb{R}}\,$ denote the set of all real numbers. Find all functions $\,f: {\mathbb{R}}\rightarrow {\mathbb{R}}\,$ such that \[ f\left( x^{2}+f(y)\right) =y+\left( f(x)\right) ^{2}\hspace{0.2in}\text{for all}\,x,y\in \mathbb{R}. \]
Let $f : \{ 1, 2, 3, \dots \} \to \{ 2, 3, \dots \}$ be a function such that $f(m + n) | f(m) + f(n) $ for all pairs $m,n$ of positive integers. Prove that there exists a positive integer $c > 1$ which divides all values of $f$.
Find all functions $f: R \rightarrow R$ such that
\[f(x+yf(x))+f(xf(y)-y)=f(x)-f(y)+2xy\]
for all $x,y \in R$
$\boxed{\text{A5}}$ Let $x,y,z$ be positive reals. Prove that $(x^2+y+1)(x^2+z+1)(y^2+x+1)(y^2+z+1)(z^2+x+1)(z^2+y+1)\geq (x+y+z)^6$
Let $a,b,c,d >0$ and $abcd=1$. Prove that:
\[ \frac{1}{(1+a)^2}+\frac{1}{(1+b)^2}+\frac{1}{(1+c)^2}+\frac{1}{(1+d)^2} \geq 1 \]
If $a,b,c$ are positive real numbers and satisfy: $\frac{a_1}{b_1}=\frac{a_2}{b_2}=...=\frac{a_n}{b_n}$ then prove that :$ \sum_{i=1}^{n} a^{2}_i \cdot \sum_{i=1}^{n} b^{2}_i =(\sum_{i=1}^{n} a_{i}b_{i})^2$
Let $f$ be an injective function from ${1,2,3,\ldots}$ in itself. Prove that for any $n$ we have: $\sum_{k=1}^{n} f(k)k^{-2} \geq \sum_{k=1}^{n} k^{-1}.$
Let $r$, $s$ be real numbers, find maximum $t$ so that if $a_1, a_2, \ldots$ is a sequence of positive real numbers satisfying
\[ a_1^r + a_2^r + \cdots + a_n^r \le 2023 \cdot n^t \]
for all $n \ge 2023$ then the sum
\[ b_n = \frac 1{a_1^s} + \cdots + \frac 1{a_n^s} \]
is unbounded, i.e for all positive reals $M$ there is an $n$ such that $b_n > M$.
Let $n\geq 2$ and $x_{1},x_{2},\ldots,x_{n}$ positive real numbers. Prove that
\[\frac{1+x_{1}^2}{1+x_{1}x_{2}}+\frac{1+x_{2}^2}{1+x_{2}x_{3}}+\cdots+\frac{1+x_{n}^2}{1+x_{n}x_{1}}\geq n.\]