Given an integer , determine the maximum value of product of non-negative real numbers when subjected to the condition \begin{align*} \sum_{k=1}^n \frac{x_k}{1+x_k} =1 \end{align*}
BALKAN-SL 2011
Balkan MO Shortlist 2011.
Other problems
Let satisfying . Prove, that \begin{align*} \sum \frac{1}{x^2(y+1)} \geq \frac{3}{4(x+y+z)} \end{align*}
Is it possible to partition the set of positive integer numbers into two classes, none of which contains an infinite arithmetic sequence (with a positive ratio)? What is we impose the extra condition that in each class of the partition, the set of difference \begin{align*} \left{ \min { n \in \mathcal{C} \mid n >m } -m \mid m \in \mathcal{C} \right } \end{align*} be bounded?
Let be a triangle and let be its circumcentre. The internal and external bisectrices of the angle meet the line at points and , respectively. Let further and respectively denote the midpoints of the segments and . The circles and meet again at point . Show that the angles and are equal.
Given a triangle , the line parallel to the side and tangent to the incircle of the triangle meets the sides and at the points and , the points and are dened similarly. Show that
Given an odd number , let \begin{align*} S ={ k \mid 1 \le k < n , \gcd(k,n) =1 } \end{align*} and let \begin{align*} T = { k \mid k \in S , \gcd(k+1,n) =1 } \end{align*} For each , let be the remainder left by upon division by . Prove \begin{align*} \prod {k \in T} \left( r_k - r{n-k} \right) \equiv |S| ^{|T|} \pmod{n} \end{align*}
Let such that is a prime. Show \begin{align*} p \mid 7^{\tfrac{p-1}{2}} +1 \end{align*}