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

Let $f:\mathbb{R} \to \mathbb{R}$ be a continuous function . Suppose \[f(x)=\frac{1}{t} \int^t_0 (f(x+y)-f(y))\,dy\] $\forall x\in \mathbb{R}$ and all $t>0$ . Then show that there exists a constant $c$ such that $f(x)=cx\ \forall x$
Let $a,b,c,d$ be positive real numbers such that $a+b+c+d=1$. Prove that\[ 6(a^3+b^3+c^3+d^3)\ge(a^2+b^2+c^2+d^2)+\frac{1}{8} \]
Let $a_1, a_2,\ldots , a_n$ be positive real numbers such that $\sum_{i=1}^na_i^3=3$ and $\sum_{i=1}^na_i^5=5$. Prove that $\sum_{i=1}^na_i>\frac{3}{2}$.
Let $ABCDEF$ be a convex hexagon of area $1$, whose opposite sides are parallel. The lines $AB$, $CD$ and $EF$ meet in pairs to determine the vertices of a triangle. Similarly, the lines $BC$, $DE$ and $FA$ meet in pairs to determine the vertices of another triangle. Show that the area of at least one of these two triangles is at least $3/2$.
Let $ a,\ b$ be real numbers satisfying $ \int_0^1 (ax\plus{}b)^2dx\equal{}1$. Determine the values of $ a,\ b$ for which $ \int_0^1 3x(ax\plus{}b)\ dx$ is maximized.
Let $f(x)$ be a continuous function defined on $0\leq x\leq \pi$ and satisfies $f(0)=1$ and \[\left\{\int_0^{\pi} (\sin x+\cos x)f(x)dx\right\}^2=\pi \int_0^{\pi}\{f(x)\}^2dx.\] Evaluate $\int_0^{\pi} \{f(x)\}^3dx.$
Define $ \phi$ the positive real root of $ x^2 \minus{} x \minus{} 1$ and let $ a,b,c,d$ be positive real numbers such that $ (a \plus{} 2b)^2 \equal{} 4c^2 \plus{} 1$. Show that $ \displaystyle 2d^2 \plus{} a^2\left(\phi \minus{} \frac {1}{2}\right) \plus{} b^2\left(\frac {1}{\phi \minus{} 1} \plus{} 2\right) \plus{} 2 \ge 4(c \minus{} d) \plus{} 2\sqrt {d^2 \plus{} 2d}$ and find all cases of equality. [i](A.Naskov)[/i]
For any given positive numbers $a_1,a_2,\ldots,a_n$, prove that there exist positive numbers $x_1,x_2,\ldots,x_n$ satisfying $\sum_{i=1}^n x_i=1$, such that for any positive numbers $y_1,y_2,\ldots,y_n$ with $\sum_{i=1}^n y_i=1$, the inequality $\sum_{i=1}^n \frac{a_ix_i}{x_i+y_i}\ge \frac{1}{2}\sum_{i=1}^n a_i$ holds.
Let $f(x) = x^n + a_{n-2} x^{n-2} + a_{n-3}x^{n-3} + \dots + a_1x + a_0$ be a polynomial with real coefficients $(n \ge 2)$. Suppose all roots of $f$ are real. Prove that the absolute value of each root is at most $\sqrt{\frac{2(1-n)}n a_{n-2}}$.
Let $a,b,c$ be positive real numbers. Prove that \[\left((3a^2+1)^2+2\left(1+\frac{3}{b}\right)^2\right)\left((3b^2+1)^2+2\left(1+\frac{3}{c}\right)^2\right)\left((3c^2+1)^2+2\left(1+\frac{3}{a}\right)^2\right)\geq 48^3\]
Suppose that $a > 0; b > 0$ and $a + b \leq 1$. Determine the minimum value of $M=\frac{1}{ab} +\frac{1}{a^2+ab}+\frac{1}{ab+b^2}+\frac{1}{a^2+b^2}$.
For every $x,y\ge0$ prove that $(x+1)^2+(y-1)^2\ge\frac{8y\sqrt{xy}}{3\sqrt{3}}.$
Determine the smallest real constant $c$ such that \[\sum_{k=1}^{n}\left ( \frac{1}{k}\sum_{j=1}^{k}x_j \right )^2\leq c\sum_{k=1}^{n}x_k^2\] for all positive integers $n$ and all positive real numbers $x_1,\cdots ,x_n$.
Prove that \[\sum_{cyc}(x+y)\sqrt{(z+x)(z+y)} \geq 4(xy+yz+zx),\] for all positive real numbers $x,y$ and $z$.
Let $ n$ be a positive integer. Consider \[ S \equal{} \left\{ (x,y,z) \mid x,y,z \in \{ 0, 1, \ldots, n\}, x \plus{} y \plus{} z > 0 \right \} \] as a set of $ (n \plus{} 1)^{3} \minus{} 1$ points in the three-dimensional space. Determine the smallest possible number of planes, the union of which contains $ S$ but does not include $ (0,0,0)$. [i]Author: Gerhard Wöginger, Netherlands [/i]
Let $x,y$ be real numbers satisfying the condition: \[x-3\sqrt {x+1}=3\sqrt{y+2} -y\] Find the greatest value and the smallest value of: \[P=x+y\]
Prove that for all positive real numbers $a_1,a_2,\cdots a_n$ \[\frac{1}{\frac{1}{1+a_1}+\frac{1}{1+a_2}+\cdots +\frac{1}{1+a_n}}-\frac{1}{\frac{1}{a_1}+\frac{1}{a_2}+\cdots +\frac{1}{a_n}}\geq \frac{1}{n}\] When does the inequality hold?
Find all positive integers $n$ such that for any integer $k$ there exists an integer $a$ for which $a^3+a-k$ is divisible by $n$. [i]Warut Suksompong, Thailand[/i]
Suppose that in a certain society, each pair of persons can be classified as either [i]amicable [/i]or [i]hostile[/i]. We shall say that each member of an amicable pair is a [i]friend[/i] of the other, and each member of a hostile pair is a [i]foe[/i] of the other. Suppose that the society has $\, n \,$ persons and $\, q \,$ amicable pairs, and that for every set of three persons, at least one pair is hostile. Prove that there is at least one member of the society whose foes include $\, q(1 - 4q/n^2) \,$ or fewer amicable pairs.
[b](a)[/b] Prove that \[\frac {x^{2}}{\left(x \minus{} 1\right)^{2}} \plus{} \frac {y^{2}}{\left(y \minus{} 1\right)^{2}} \plus{} \frac {z^{2}}{\left(z \minus{} 1\right)^{2}} \geq 1\] for all real numbers $x$, $y$, $z$, each different from $1$, and satisfying $xyz=1$. [b](b)[/b] Prove that equality holds above for infinitely many triples of rational numbers $x$, $y$, $z$, each different from $1$, and satisfying $xyz=1$. [i]Author: Walther Janous, Austria[/i]
The sum of $2025$ non-negative real numbers is $1$. Prove that they can be organized in a circle in such a way that the sum of all the $2025$ products of pairs of neighbouring numbers isn't greater than $\frac{1}{2025}$.
Given that $a,b$, and $c$ are positive real numbers such that $ab + bc + ca \geq 1$, prove that \[ \frac{1}{a^2} + \frac{1}{b^2} + \frac{1}{c^2} \geq \frac{\sqrt{3}}{abc} .\]
Determine the least real number $k$ such that the inequality $$\left(\frac{2a}{a-b}\right)^2+\left(\frac{2b}{b-c}\right)^2+\left(\frac{2c}{c-a}\right)^2+k \geq 4\left(\frac{2a}{a-b}+\frac{2b}{b-c}+\frac{2c}{c-a}\right)$$ holds for all real numbers $a,b,c$. [i]Proposed by Mohammad Jafari[/i]
Let $a, b, c \in \mathbb R$. Prove that \[(a^2 + ab + b^2)(b^2 + bc + c^2)(c^2 + ca + a^2) \geq (ab + bc + ca)^3.\] When does the equality hold?
Let $C=\{4,6,8,9,10,\ldots\}$ be the set of composite positive integers. For each $n\in C$ let $a_n$ be the smallest positive integer $k$ such that $k!$ is divisible by $n$. Determine whether the following series converges: $$\sum_{n\in C}\left(\frac{a_n}{n}\right)^n.$$ [i]Proposed by Orif Ibrogimov, ETH Zurich and National University of Uzbekistan[/i]