Found problems: 1671
Let $P(x),\ Q(x)$ be polynomials such that :
\[\int_0^2 \{P(x)\}^2dx=14,\ \int_0^2 P(x)dx=4,\ \int_0^2 \{Q(x)\}^2dx=26,\ \int_0^2 Q(x)dx=2.\]
Find the maximum and the minimum value of $\int_0^2 P(x)Q(x)dx$.
Let $a,b,c$ be positive real numbers with $a^2+b^2+c^2 \geq 3$. Prove that:
$$\frac{(a+1)(b+2)}{(b+1)(b+5)}+\frac{(b+1)(c+2)}{(c+1)(c+5)}+\frac{(c+1)(a+2)}{(a+1)(a+5)} \geq \frac{3}{2}.$$
Given that $3 \sin x + 4 \cos x = 5$, where $x$ is in $(0, \frac{\pi}{2})$ , find $2 \sin x + \cos x + 4 \tan x$.
The area of the smallest equilateral triangle with one vertex on each of the sides of the right triangle with side lengths $2\sqrt3$, $5$, and $\sqrt{37}$, as shown, is $\tfrac{m\sqrt{p}}{n}$, where $m$, $n$, and $p$ are positive integers, $m$ and $n$ are relatively prime, and $p$ is not divisible by the square of any prime. Find $m+n+p$.
[asy]
size(5cm);
pair C=(0,0),B=(0,2*sqrt(3)),A=(5,0);
real t = .385, s = 3.5*t-1;
pair R = A*t+B*(1-t), P=B*s;
pair Q = dir(-60) * (R-P) + P;
fill(P--Q--R--cycle,gray);
draw(A--B--C--A^^P--Q--R--P);
dot(A--B--C--P--Q--R);
[/asy]
The numbers $1, 2, \ldots, n$ are written on a blackboard. Each minute, a student goes up to the board, chooses two numbers $x$ and $y$, erases them, and writes the number $2x+2y$ on the board. This continues until only one number remains. Prove that this number is at least $\frac{4}{9}n^3$.
[i]Brian Hamrick.[/i]
In a triangle $ABC$, let $A_{1}$, $B_{1}$, $C_{1}$ be the points where the excircles touch the sides $BC$, $CA$ and $AB$ respectively. Prove that $A A_{1}$, $B B_{1}$ and $C C_{1}$ are the sidelenghts of a triangle.
[i]Proposed by L. Emelyanov[/i]
Let $a,b,c$ be positive real numbers such that $abc=1$. Prove that
$$\sqrt{\frac{a^3}{1+bc}}+\sqrt{\frac{b^3}{1+ac}}+\sqrt{\frac{c^3}{1+ab}}\geq 2$$
Are there any triples $(a,b,c)$, for which the equality holds?
[i]Proposed by Konstantinos Metaxas.[/i]
Find all functions $ f: \mathbb{R} \rightarrow \mathbb{R}$ satisfying \[ f(x^3\plus{}y^3)\equal{}xf(x^2)\plus{}yf(y^2)\] for all real numbers $ x$ and $ y$.
[i]Hery Susanto, Malang[/i]
Niki and Kyle play a triangle game. Niki first draws $\triangle ABC$ with area $1$, and Kyle picks a point $X$ inside $\triangle ABC$. Niki then draws segments $\overline{DG}$, $\overline{EH}$, and $\overline{FI}$, all through $X$, such that $D$ and $E$ are on $\overline{BC}$, $F$ and $G$ are on $\overline{AC}$, and $H$ and $I$ are on $\overline{AB}$. The ten points must all be distinct. Finally, let $S$ be the sum of the areas of triangles $DEX$, $FGX$, and $HIX$. Kyle earns $S$ points, and Niki earns $1-S$ points. If both players play optimally to maximize the amount of points they get, who will win and by how much?
Suppose $x_1,x_2,x_3,\dotsc$ is a strictly decreasing sequence of positive real numbers such that the series $x_1+x_2+x_3+\cdots$ diverges.
Is it necessary true that the series $\sum_{n=2}^{\infty}{\min \left\{ x_n,\frac{1}{n\log (n)}\right\} }$ diverges?
Let $a,b,c$ be non-negative real numbers such that $a^2+b^2+c^2 \le 3$ then prove that;
$$(a+b+c)(a+b+c-abc)\ge2(a^2b+b^2c+c^2a)$$
For any integer $n \ge 1$, show that
$$\sum_{k=1}^{n} \frac{2^k}{\sqrt{k+0.5}} \le 2^{n+1}\sqrt{n+1}-\frac{4n^{3/2}}{3}$$
Positive reals $a,b,c$ satisfy $ab+bc+ca=abc$. Prove that:
$\frac{a^4+b^4}{ab(a^3+b^3)} + \frac{b^4+c^4}{bc(b^3+c^3)}+\frac{c^4+a^4}{ca(c^3+a^3)} \geq 1$
Prove that for positive real numbers $a, b, c$ such that $abc=1$, the following inequality holds:
$$\frac{a}{b(a+b)}+\frac{b}{c(b+c)}+\frac{c}{a(c+a)} \ge \frac32$$
(I. Voronovich)
Find all $4$-tuple of real numbers $(x, y, z, w)$ that satisfy the following system of equations:
$$x^2 + y^2 + z^2 + w^2 = 4$$
$$\frac{1}{x^2} +\frac{1}{y^2} +\frac{1}{z^2 }+\frac{1}{w^2} = 5 -\frac{1}{(xyzw)^2}$$
Find all functions $f:\mathbb Z\rightarrow \mathbb Z$ such that, for all integers $a,b,c$ that satisfy $a+b+c=0$, the following equality holds:
\[f(a)^2+f(b)^2+f(c)^2=2f(a)f(b)+2f(b)f(c)+2f(c)f(a).\]
(Here $\mathbb{Z}$ denotes the set of integers.)
[i]Proposed by Liam Baker, South Africa[/i]
Let $x,y,z$ be positive numbers such that
\[ {1\over x}+{1\over y}+{1\over z}=1. \]
Show that
\[ \sqrt{x+yz}+\sqrt{y+zx}+\sqrt{z+xy}\ge\sqrt{xyz}+\sqrt{x}+\sqrt{y}+\sqrt{z} \]
Let $P$ be a non-zero polynomial with non-negative real coefficients, let $N$ be a positive integer, and let $\sigma$ be a permutation of the set $\{1,2,...,n\}$. Determine the least value the sum
\[\sum_{i=1}^{n}\frac{P(x_i^2)}{P(x_ix_{\sigma(i)})}\] may achieve, as $x_1,x_2,...,x_n$ run through the set of positive real numbers.
[i]Fedor Petrov[/i]
Let $a$, $b$, $c$, and $d$ be positive real numbers such that
\[\begin{array}{c@{\hspace{3pt}} c@{\hspace{3pt}} c@{\hspace{3pt}} c@{\hspace{3pt}}c}a^2+b^2&=&c^2+d^2&=&2008,\\ ac&=&bd&=&1000.\end{array}\]If $S=a+b+c+d$, compute the value of $\lfloor S\rfloor$.
a) Prove that if $x,y>0$ then
\[ \frac x{y^2} + \frac y{x^2} \geq \frac 1x + \frac 1y. \]
b) Prove that if $a,b,c$ are positive real numbers, then
\[ \frac {a+b}{c^2} + \frac {b+c}{a^2} + \frac {c+a}{b^2} \geq 2 \left( \frac 1a + \frac 1b + \frac 1c \right). \]
Prove that in acute-angled traingle ABC if $r$ is inradius and $R$ is radius of circumcircle then: \[a^2+b^2+c^2\geq 4(R+r)^2\]
Let $x,y,z$ be positive real numbers. Prove that
\[ \sum_{cyclic} \frac{xy}{xy+x^2+y^2} ~\le~ \sum_{cyclic} \frac{x}{2x+z} \]
[i](Proposed by Šefket Arslanagić, Bosnia and Herzegovina)[/i]
Let $a,b,c$ be positive reals. Prove that
\[ \frac{(a-b)(a-c)}{2a^2 + (b+c)^2} + \frac{(b-c)(b-a)}{2b^2 + (c+a)^2} + \frac{(c-a)(c-b)}{2c^2 + (a+b)^2} \geq 0. \]
[i]Calvin Deng.[/i]
Prove that if $x$, $y$, $z$ are positive real numbers and $xyz = 1$ then
\[\frac{x^3}{x^2+y}+\frac{y^3}{y^2+z}+\frac{z^3}{z^2+x}\geq \dfrac {3} {2}.\]
[i]A. Golovanov[/i]
(1) Let $a,b$ be coprime positive integers. Prove that there exists constants $\lambda$ and $\beta$ such that for all integers $m$,
$$\left| \sum\limits_{k=1}^{m-1} \left\{ \frac{ak}{m} \right\}\left\{ \frac{bk}{m} \right\} - \lambda m \right| \le \beta$$
(2) Prove that there exists $N$ such that for all $p>N$ (where $p$ is a prime number), and any positive integers $a,b,c$ positive integers satisfying $p\nmid (a+b)(b+c)(c+a)$, there are at least $\lfloor \frac{p}{12} \rfloor$ solutions $k\in \{1,\cdots,p-1\}$ such that $$ \left\{\frac{ak}{p}\right\} + \left\{\frac{bk}{p}\right\} + \left\{\frac{ck}{p}\right\} \le 1 $$