Find all the functions $f : \mathbb R^+ \to \mathbb R$ satisfying the identity \[f(x)f(y)=y^{\alpha}f\left(\frac x2 \right) + x^{\beta} f\left(\frac y2 \right) \qquad \forall x,y \in \mathbb R^+\] Where $\alpha,\beta$ are given real numbers.

Positive integers $a$ and $b$ satisfy the equality $a+d(a)=b^2+2$ where $d(n)$ denotes the number of divisors of $n$. Prove that $a+b$ is even.

Prove that in any convex polygon where all pairwise distances between vertices are distinct, there exists a vertex such that the closest vertex of the polygon is adjacent to it. [i]Proposed by D. Shiryayev, S. Berlov[/i]

Writing down the first $4$ rows of the Pascal triangle in the usual way and then adding up the numbers in vertical columns, we obtain $7$ numbers as shown above. If we repeat this procedure with the first $1024$ rows of the Pascal triangle, how many of the $2047$ numbers thus obtained will be odd? [img]https://cdn.artofproblemsolving.com/attachments/8/a/4dc4a815d8b002c9f36a6da7ad6e1c11a848e9.png[/img]

There are 60 empty boxes $B_1,\ldots,B_{60}$ in a row on a table and an unlimited supply of pebbles. Given a positive integer $n$, Alice and Bob play the following game. In the first round, Alice takes $n$ pebbles and distributes them into the 60 boxes as she wishes. Each subsequent round consists of two steps: (a) Bob chooses an integer $k$ with $1\leq k\leq 59$ and splits the boxes into the two groups $B_1,\ldots,B_k$ and $B_{k+1},\ldots,B_{60}$. (b) Alice picks one of these two groups, adds one pebble to each box in that group, and removes one pebble from each box in the other group. Bob wins if, at the end of any round, some box contains no pebbles. Find the smallest $n$ such that Alice can prevent Bob from winning. [i]Czech Republic[/i]

Let $m$ and $n$ be positive integers. Player $A$ has a field of $m \times n$, and player $B$ has a $1 \times n$ field (the first is the number of rows). On the first move, each player places on each square of his field white or black chip as he pleases. At each next on the move, each player can change the color of randomly chosen pieces on your field to the opposite, provided that in no row for this move will not change more than one chip (it is allowed not to change not a single chip). The moves are made in turn, player $A$ starts. Player $A$ wins if there is such a position that in the only row player $B$'s squares, from left to right, are the same as in some row of player's field $A$. Prove that player $A$ has the ability to win for any game of player $B$ if and only if $n <2m$.

At the exterior of the square $ ABCD $ it is constructed the isosceles triangle $ ABE $ with $ \angle ABE=120^{\circ} . M $ is the intersection of the bisector line of the angle $ \angle EAB $ with its perpendicular that passes through $ B; N $ is the intersection of the $ AB $ with its perpendicular that passe through $ M; P $ is the intersection of $ CN $ with $ MB. $ If $ G $ is the center of gravity of the triangle $ ABE, $ prove that $ PG $ and $ AE $ are parallel.

If $a,b,c$ are non-negative real numbers such that $a+b+c=3m,(m\ge1)$ then prove that $$(a^a+b^a+c^a)(a^b+b^b+c^b)(a^c+b^c+c^c)\ge27m^{3m}$$ [i]Proposed by Dorin Mărghidanu[/i]

What fraction of the Earth's volume lies above the $45$ degrees north parallel? You may assume the Earth is a perfect sphere. The volume in question is the smaller piece that we would get if the sphere were sliced into two pieces by a plane.

At a conference, six people place their name badges in a hat, which is shaken up; one badge is then distributed to each person such that each distribution is equally likely. Each turn, every person who does not yet have their own badge finds the person whose badge they have and takes that person's badge. For example, if Alice has Bob's badge and Bob has Charlie's badge, Alice would have Charlie's badge after a turn. Compute the probability that everyone will eventually end up with their own badge.

Given positive integers $a_1$, $a_2$, $...$, $a_m$ ($m \ge 1$). Consider the sequence $\{u_n\}_{n=1}^{\infty}$, with $$u_n = a_1^n + a_2^n + ... + a_m^n.$$ We know that this sequence has a finite number of prime divisors. Prove that $a_1 = a_2 = ...= a_m$.

Find the maximum value of real number $A$ such that $$3x^2 + y^2 + 1 \geq A(x^2 + xy + x)$$ for all positive integers $x, y.$

Suppose the altitudes of a triangle are $10, 12$ and $15$. What is its semi-perimeter?

Points $ P,Q,R$ are given in the plane. It is known that there is a triangle $ ABC$ such that $ P$ is the midpoint of $ BC$, $ Q$ the point on side $ CA$ with $ \frac{CQ}{QA}\equal{}2$, and $ R$ the point on side $ AB$ with $ \frac{AR}{RB}\equal{}2$. Determine with proof how the triangle $ ABC$ may be reconstructed from $ P,Q,R$.

Let $ABC$ be a triangle such that $AC\not= BC,AB<AC$ and let $K$ be it's circumcircle. The tangent to $K$ at the point $A$ intersects the line $BC$ at the point $D$. Let $K_1$ be the circle tangent to $K$ and to the segments $(AD),(BD)$. We denote by $M$ the point where $K_1$ touches $(BD)$. Show that $AC=MC$ if and only if $AM$ is the bisector of the $\angle DAB$. [i]Neculai Roman[/i]

Let $N$ be a positive integer. In each of the $N^2$ unit squares of an $N\times N$ board, one of the two diagonals is drawn. The drawn diagonals divide the $N\times N$ board into $K$ regions. For each $N$, determine the smallest and the largest possible values of $K$. [asy] draw((0,0)--(3,0)--(3,3)--(0,3)--cycle); draw((1,0)--(1,3), dotted); draw((2,0)--(2,3), dotted); draw((0,1)--(3,1), dotted); draw((0,2)--(3,2), dotted); draw((1,0)--(0,1)--(2,3)--(3,2)--(2,1)--(0,3)); draw((1,1)--(2,0)--(3,1)); label("$1$",(0.35,2)); label("$2$",(1,2.65)); label("$3$",(2,2)); label("$4$",(2.65,2.65)); label("$5$",(0.35,0.35)); label("$6$",(1.3,1.3)); label("$7$",(2.65,0.35)); label("Example with $N=3$, $K=7$",(0,-0.3)--(3,-0.3),S); [/asy]