On the domain $0\leq \theta \leq 2\pi:$ (a) Prove that $\sin^{2}\theta \cdot \sin 2\theta$ takes its maximum at $\frac{\pi}{3}$ and $\frac{4 \pi}{3}$ (and hence its minimum at $\frac{2 \pi}{3}$ and $\frac{ 5 \pi}{3}$). (b) Show that $$| \sin^{2} \theta \cdot \sin^{3} 2\theta \cdot \sin^{3} 4 \theta \cdots \sin^{3} 2^{n-1} \theta \cdot \sin 2^{n} \theta |$$ takes its maximum at $\frac{4 \pi}{3}$ (the maximum may also be attained at other points). (c) Derive the inequality: $$ \sin^{2} \theta \cdot \sin^{2} 2\theta \cdots \sin^{2} 2^{n} \theta \leq \left( \frac{3}{4} \right)^{n}.$$

If $a,b,c$ are positive real numbers such that $a+b+c=abc$ prove that $$\frac{abc}{3\sqrt{2}}\left ( \sum_{cyc}\frac{\sqrt{a^3+b^3}}{ab+1} \right )\geq \sum_{cyc}\frac{a}{a^2+1}$$

Across all $x \in \mathbb{R}$, find the maximum value of the expression $$\sin x + \sin 3x + \sin 5x.$$

The real numbers $a,b,c$ satisfy the condition: for all $x$, such that for $ -1 \le x \le 1$, the inequality $$| ax^2 + bx + c | \le 1$$ is held. Prove that for the same $x$ , $$| cx^2 + bx + a | \le 2$$

Let $ a,b,c$ be nonnegative real numbers. Suppose that $ a\plus{}b\plus{}c\ge abc$. Prove that: $ a^2\plus{}b^2\plus{}c^2 \ge abc.$

A polynomial $p(x)$ of degree $n\ge 2$ has exactly $n$ real roots, counted with multiplicity. We know that the coefficient of $x^n$ is $1$, all the roots are less than or equal to $1$, and $p(2)=3^n$. What values can $p(1)$ take?

Find the greatest value of $p$ and the smallest value of $q$ such that for any triangle in the plane, the inequality \[p<\frac{a+m}{b+n}<q\] holds, where $a,b$ are it's two sides and $m,n$ their corresponding medians.

Find the number of $16$-tuples $(x_1, x_2,..., x_{16})$ such that (i) $x_i = \pm 1$ for $i = 1,..., 16$, (ii) $0 \le x_1 + x_2 +... + x_r < 4$, for $r = 1, 2,... , 15$, (iii) $x_1 + x_2 +...+ x_{10} = 4$

Let $A > 1$ and $B > 1$ be real numbers and (xn) be a sequence of numbers in the interval $[1,AB]$. Prove that there exists a sequence $(y_n)$ of numbers in the interval $[1,A]$ such that $$\frac{x_m}{x_n}\le B\frac{y_m}{y_n} \,\,\, for \,\,\, all \,\,\, m,n = 1,2,...$$

Let $S$ be the set $\{1,2,3,...,19\}$. For $a,b \in S$, define $a \succ b$ to mean that either $0 < a - b \leq 9$ or $b - a > 9$. How many ordered triples $(x,y,z)$ of elements of $S$ have the property that $x \succ y$, $y \succ z$, and $z \succ x$? $ \textbf{(A)} \ 810 \qquad \textbf{(B)} \ 855 \qquad \textbf{(C)} \ 900 \qquad \textbf{(D)} \ 950 \qquad \textbf{(E)} \ 988$

Some of $n$ towns are connected by two-way airlines. There are $m$ airlines in total. For $i = 1, 2, \cdots, n$, let $d_i$ be the number of airlines going from town $i$. If $1\le d_i \le 2010$ for each $i = 1, 2,\cdots, 2010$, prove that \[\displaystyle\sum_{i=1}^n d_i^2\le 4022m- 2010n\] Find all $n$ for which equality can be attained. [i]Proposed by Aleksandar Ilic[/i]

This problem is given by my teacher. :wink: [size=120]Seven skiers numbered 1,2,3,4,5,6,7 set out in turn at the starting point,each one slides the same distance at a constant speed. During this period,everyone just had two "beyond" experience.(going beyond one skier or be went beyond by another skier is called a "beyond" experience). When the race ended,we would decide the rank according to the order that skiers reached the ending. Prove that:there are two different rank at most.[/size]

Let $k$ be a positive integer. Find the maximum value of \[a^{3k-1}b+b^{3k-1}c+c^{3k-1}a+k^2a^kb^kc^k,\] where $a$, $b$, $c$ are non-negative reals such that $a+b+c=3k$.

Prove that in the set consisting of $\binom{2n}{n}$ people we can find a group of $n+1$ people in which everyone knows everyone or noone knows noone.

The polynomial $ f(x)\equal{}ax^2\plus{}bx\plus{}c$ has real coefficients and satisfies $ \left|f(x)\right|\le 1$ for all $ x\in [0, 1]$. Find the maximal value of $ |a|\plus{}|b|\plus{}|c|$.

Find the largest positive real number $p$ (if it exists) such that the inequality \[x^2_1+ x_2^2+ \cdots + x^2_n\ge p(x_1x_2 + x_2x_3 + \cdots + x_{n-1}x_n)\] is satisfied for all real numbers $x_i$, and $(a) n = 2; (b) n = 5.$ Find the largest positive real number $p$ (if it exists) such that the inequality holds for all real numbers $x_i$ and all natural numbers $n, n \ge 2.$

In terms of $n\ge2$, find the largest constant $c$ such that for all nonnegative $a_1,a_2,\ldots,a_n$ satisfying $a_1+a_2+\cdots+a_n=n$, the following inequality holds: \[\frac1{n+ca_1^2}+\frac1{n+ca_2^2}+\cdots+\frac1{n+ca_n^2}\le \frac{n}{n+c}.\] [i]Calvin Deng.[/i]

Jeremy has a magic scale, each side of which holds a positive integer. He plays the following game: each turn, he chooses a positive integer $n$. He then adds $n$ to the number on the left side of the scale, and multiplies by $n$ the number on the right side of the scale. (For example, if the turn starts with $4$ on the left and $6$ on the right, and Jeremy chooses $n = 3$, then the turn ends with $7$ on the left and $18$ on the right.) Jeremy wins if he can make both sides of the scale equal. (a) Show that if the game starts with the left scale holding $17$ and the right scale holding $5$, then Jeremy can win the game in $4$ or fewer turns. (b) Prove that if the game starts with the right scale holding $b$, where $b\geq 2$, then Jeremy can win the game in $b-1$ or fewer turns.

Let $x_i,$ $1 \leq i \leq n$ be real numbers with $n \geq 3.$ Let $p$ and $q$ be their symmetric sum of degree $1$ and $2$ respectively. Prove that: i) $p^2 \cdot \frac{n-1}{n}-2q \geq 0$ ii) $\left|x_i - \frac{p}{n}\right| \leq \sqrt{p^2 - \frac{2nq}{n-1}} \cdot \frac{n-1}{n}$ for every meaningful $i$.

Determine all functions $ f: \mathbb{R} \to \mathbb{R}$ satisfying the condition $ f(xy) \le xf(y)$ for all real numbers $ x$ and $ y$.

If $ABC$ is acute triangle, prove distance from each vertex to corresponding excentre is less than sum of two greatest side of triangle

If $a$,$b$,$c$ are positive reals, prove that $$\frac{a+bc}{a+a^2}+\frac{b+ca}{b+b^2}+\frac{c+ab}{c+c^2} \geq 3$$

[b]Problem 3.[/b] Let $n\geq 3$ is given natural number, and $M$ is the set of the first $n$ primes. For any nonempty subset $X$ of $M$ with $P(X)$ denote the product of its elements. Let $N$ be a set of the kind $\ds\frac{P(A)}{P(B)}$, $A\subset M, B\subset M, A\cap B=\emptyset$ such that the product of any 7 elements of $N$ is integer. What is the maximal number of elements of $N$? [i]Alexandar Ivanov[/i]

Let $p, q$ be real numbers with $0 < p < q$ and let $t_1, t_2, \cdots, t_n$ be real numbers in the interval $[p, q]$. Denote by $A$ and $B$ the arithmetic means of $t_1, t_2, \cdots, t_n$ and of $t_1^2, t_2^2,\cdots , t_n^2$, respectively. Prove that \[\frac{A^2}{B}\ge\frac{4pq}{(p + q)^2}.\]

Let $ a, b, c $ be positive real numbers such that $ ab+bc+ca=1 $. Prove that \[ \sqrt{ a^2 + b^2 + \frac{1}{c^2}} + \sqrt{ b^2 + c^2 + \frac{1}{a^2}} + \sqrt{ c^2 + a^2 + \frac{1}{b^2}} \ge \sqrt{33} \]