This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 1671

Find all functions $f: \mathbb{R}^+ \to \mathbb{R}^+$ such that $$(z + 1)f(x + y) = f(xf(z) + y) + f(yf(z) + x),$$ for all positive real numbers $x, y, z$. [i]Fajar Yuliawan, Indonesia[/i]
Let $G$ be a finite simple graph and let $k$ be the largest number of vertices of any clique in $G$. Suppose that we label each vertex of $G$ with a non-negative real number, so that the sum of all such labels is $1$. Define the [i]value of an edge[/i] to be the product of the labels of the two vertices at its ends. Define the [i]value of a labelling[/i] to be the sum of values of the edges. Prove that the maximum possible value of a labelling of $G$ is $\frac{k-1}{2k}$. (A [i]finite simple graph[/i] is a graph with finitely many vertices, in which each edge connects two distinct vertices and no two edges connect the same two vertices. A [i]clique[/i] in a graph is a set of vertices in which any two are connected by an edge.)
Find all functions $f$ mapping non-empty finite sets of integers, to integers, such that $$f(A+B)=f(A)+f(B)$$ for all non-empty sets of integers $A$ and $B$. $A+B$ is defined as $\{a+b: a \in A, b \in B\}$.
Let $ a,b,c\in (0,1)$ and $ x,y,z\in (0, \plus{} \infty)$ be six real numbers such that \[ a^x \equal{} bc , \quad b^y \equal{} ca , \quad c^z \equal{} ab .\] Prove that \[ \frac 1{2 \plus{} x} \plus{} \frac 1{2 \plus{} y} \plus{} \frac 1{2 \plus{} z} \leq \frac 34 .\] [i]Cezar Lupu[/i]
Let $a,b,c,d$ be real numbers such that $a^2+b^2+c^2+d^2=1$. Determine the minimum value of $(a-b)(b-c)(c-d)(d-a)$ and determine all values of $(a,b,c,d)$ such that the minimum value is achived.
Let $m$ be a positive integer, and real numbers $a_1, a_2,\ldots , a_m$ satisfy \[\frac{1}{m}\sum_{i=1}^{m}a_i = 1,\] \[\frac{1}{m}\sum_{i=1}^{m}a_i ^2= 11,\] \[\frac{1}{m}\sum_{i=1}^{m}a_i ^3= 1,\] \[\frac{1}{m}\sum_{i=1}^{m}a_i ^4= 131.\] Prove that $m$ is a multiple of $7$. [i] Proposed by usjl[/i]
Suppose that a sequence $a_1,a_2,\ldots$ of positive real numbers satisfies \[a_{k+1}\geq\frac{ka_k}{a_k^2+(k-1)}\] for every positive integer $k$. Prove that $a_1+a_2+\ldots+a_n\geq n$ for every $n\geq2$.
Let $n$ and $k$ be positive integers. Prove that for $a_1, \dots, a_n \in [1,2^k]$ one has \[ \sum_{i = 1}^n \frac{a_i}{\sqrt{a_1^2 + \dots + a_i^2}} \le 4 \sqrt{kn}. \]
Let $x$ and $y$ be positive real numbers with $x + y =1 $. Prove that $$\frac{(3x-1)^2}{x}+ \frac{(3y-1)^2}{y} \ge1.$$ For which $x$ and $y$ equality holds? (K. Czakler, GRG 21, Vienna)
For which $a$, there is a function $f: R \to R$, different from a constant, such that $$f(a(x + y)) = f(x) + f(y) ?$$
For any real numbers sequence $\{x_n\}$ ,suppose that $\{y_n\}$ is a sequence such that: $y_1=x_1, y_{n+1}=x_{n+1}-(\sum\limits_{i = 1}^{n} {x^2_i})^{ \frac{1}{2}}$ ${(n \ge 1})$ . Find the smallest positive number $\lambda$ such that for any real numbers sequence $\{x_n\}$ and all positive integers $m$ , have $\frac{1}{m}\sum\limits_{i = 1}^{m} {x^2_i}\le\sum\limits_{i = 1}^{m} {\lambda^{m-i}y^2_i} .$ (High School Affiliated to Nanjing Normal University )
Assume that in the $\triangle ABC$ there exists a point $D$ on $BC$ and a line $l$ passing through $A$ such that $l$ is tangent to $(ADC)$ and $l$ bisects $BD.$ Prove that $a\sqrt{2}\geq b+c.$
Let $a,b,c$ be sides of the triangle. Prove that \[ a^2\left(\frac{b}{c}-1\right)+b^2\left(\frac{c}{a}-1\right)+c^2\left(\frac{a}{b}-1\right)\geq 0 . \]
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$?
Let $x_1,x_2,\cdots,x_n \in(0,1)$ , $n\geq2$. Prove that$$\frac{\sqrt{1-x_1}}{x_1}+\frac{\sqrt{1-x_2}}{x_2}+\cdots+\frac{\sqrt{1-x_n}}{x_n}<\frac{\sqrt{n-1}}{x_1 x_2 \cdots x_n}.$$
Find all functions $f:\mathbb{R}^+\to\mathbb{R}^+$ such that whenever $a>b>c>d>0$ and $ad=bc$, \[f(a+d)+f(b-c)=f(a-d)+f(b+c).\] [i]Calvin Deng.[/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?
Let $k$ be a fixed real number. Find all functions $f: R \to R$ such that $f(x)+ (f(y))^2 = kf(x + y^2)$ for all real numbers $x$ and $y$.
Let be a natural number $ n\ge 2, n $ real numbers $ b_1,b_2,\ldots ,b_n , $ and $ n-1 $ positive real numbers $ a_1,a_2,\ldots ,a_{n-1} $ such that $ a_1+a_2+\cdots +a_{n-1} =1. $ Prove the inequality $$ b_1^2+\frac{b_2^2}{a_1} +\frac{b_3^2}{a_2} +\cdots +\frac{b_n^2}{a_{n-1}} \ge 2b_1\left( b_2+b_3+\cdots +b_n \right) , $$ and specify when equality is attained. [i]Dumitru Acu[/i]
Let $x$, $y$, and $z$ be real numbers such that $x<y<z<6$. Solve the system of inequalities: \[\left\{\begin{array}{cc} \dfrac{1}{y-x}+\dfrac{1}{z-y}\le 2 \\ \dfrac{1}{6-z}+2\le x \\ \end{array}\right.\]
Let $S$ be the set of sequences of length 2018 whose terms are in the set $\{1, 2, 3, 4, 5, 6, 10\}$ and sum to 3860. Prove that the cardinality of $S$ is at most \[2^{3860} \cdot \left(\frac{2018}{2048}\right)^{2018}.\]
Prove that for positive real numbers $a,b,c$ satisfying $abc=1$ the following inequality holds: $$ \frac{a}{b}+\frac{b}{c}+\frac{c}{a} \ge \frac{a^2+1}{2a}+\frac{b^2+1}{2b}+\frac{c^2+1}{2c}.$$
Let $~$ $ a,\,b,\,c,\,d\, >\, 0$ $~$ and $~$ $a+b+c+d\, =\, 1\, .$ $~$ Prove the inequality \[ \frac{1}{4a+3b+c}+\frac{1}{3a+b+4d}+\frac{1}{a+4c+3d}+\frac{1}{4b+3c+d}\; \ge\; 2\, . \]
If x,y<0 prove that $\left(x+\frac{2}{y} \right) \left(\frac{y}{x}+2 \right)\geq 8$. When do we have equality?