Prove that if the function $f$ is defined on the set of positive real numbers, its values are real, and $f$ satisfies the equation $$f\left( \frac{x+y}{2}\right) + f\left(\frac{2xy}{x+y} \right) =f(x)+f(y)$$ for all positive $x,y$, then $$2f(\sqrt{xy})=f(x)+f(y)$$ for every pair $x,y$ of positive numbers.

A triangle is inscribed in a circle. The vertices of the triangle divide the circle into three arcs of lengths $3$, $4$, and $5$. What is the area of the triangle? $\textbf{(A)}\ 6 \qquad \textbf{(B)}\ \frac{18}{\pi^2} \qquad \textbf{(C)}\ \frac{9}{\pi^2}\left(\sqrt{3}-1\right) \qquad \textbf{(D)}\ \frac{9}{\pi^2}\left(\sqrt{3}+1\right) \qquad \textbf{(E)}\ \frac{9}{\pi^2}\left(\sqrt{3}+3\right)$

Let $k>1$ be the given natural number and $p\in \mathbb{P}$ such that $n=kp+1$ is composite number. Given that $n\mid 2^{n-1}-1.$ Prove that $n<2^k.$

Consider the set $\mathcal{T}$ of all triangles whose sides are distinct prime numbers which are also in arithmetic progression. Let $\triangle \in \mathcal{T}$ be the triangle with least perimeter. If $a^{\circ}$ is the largest angle of $\triangle$ and $L$ is its perimeter, determine the value of $\frac{a}{L}$.

Let be a sequence $ \left( a_n \right)_{n\geqslant 1} $ of real numbers defined recursively as $$ a_n=2007+1004n^2-a_{n-1}-a_{n-2}-\cdots -a_2-a_1. $$ Calculate: $$ \lim_{n\to\infty} \frac{1}{n}\int_1^{a_n} e^{1/\ln t} dt $$

If $f:\mathbb{R} \rightarrow \mathbb{R}$ satisfies $f(x^2 +f(y))=y+xf(x)$ for all $x,y \in \mathbb{R}$, find $f(x)$.

Let $ K$ be a subset of a group $ G$ that is not a union of lift cosets of a proper subgroup. Prove that if $ G$ is a torsion group or if $ K$ is a finite set, then the subset \[ \bigcap _{k \in K} k^{-1}K\] consists of the identity alone. [i]L. Redei[/i]

The infinite sequence $a_0,a _1, a_2, \dots$ of (not necessarily distinct) integers has the following properties: $0\le a_i \le i$ for all integers $i\ge 0$, and \[\binom{k}{a_0} + \binom{k}{a_1} + \dots + \binom{k}{a_k} = 2^k\] for all integers $k\ge 0$. Prove that all integers $N\ge 0$ occur in the sequence (that is, for all $N\ge 0$, there exists $i\ge 0$ with $a_i=N$).

Is there a nine-digit number without zero digits, the remainder of dividing which on each of its digits is different?

We denote with $p_n(k)$ the number of permutations of the numbers $1,2,...,n$ that have exactly $k$ fixed points. a) Prove that $\sum_{k=0}^n kp_n (k)=n!$. b) If $s$ is an arbitrary natural number, then: $\sum_{k=0}^n k^s p_n (k)=n!\sum_{i=1}^m R(s,i)$, where with $R(s,i)$ we denote the number of partitions of the set $\{1,2,...,s\}$ into $i$ non-empty non-intersecting subsets and $m=min(s,n)$.

In a triangle $ABC$, the angle bisector of $\widehat{ABC}$ meets $[AC]$ at $D$, and the angle bisector of $\widehat{BCA}$ meets $[AB]$ at $E$. Let $X$ be the intersection of the lines $BD$ and $CE$ where $|BX|=\sqrt 3|XD|$ ve $|XE|=(\sqrt 3 - 1)|XC|$. Find the angles of triangle $ABC$.

There are 8 points in the plane.we write down the area of each triangle having all vertices amoung these points(totally 56 numbers).Let them be $a_1,a_2,\dots a_{56}$.Prove that there is a choice of plus or minus such that: $$\pm a_1 \pm a_2 \dots \pm a_{56}=0$$

Two circles have radius $2$ and $3$, and the distance between their centers is $10$. Let $E$ be the intersection of their two common external tangents, and $I$ be the intersection of their two common internal tangents. Compute $EI$. (A [i]common external tangent[/i] is a tangent line to two circles such that the circles are on the same side of the line, while a [i]common internal tangent[/i] is a tangent line to two circles such that the circles are on opposite sides of the line). [i]Proposed by Connor Gordon)[/i]

As the figure is shown, place a $2\times 5$ grid table in horizontal or vertical direction, and then remove arbitrary one $1\times 1$ square on its four corners. The eight different shapes consisting of the remaining nine small squares are called [i]banners[/i]. [asy] defaultpen(linewidth(0.4)+fontsize(10));size(50); pair A=(-1,1),B=(-1,3),C=(-1,5),D=(-3,5),E=(-5,5),F=(-7,5),G=(-9,5),H=(-11,5),I=(-11,3),J=(-11,1),K=(-9,1),L=(-7,1),M=(-5,1),N=(-3,1),O=(-5,3),P=(-7,3),Aa=(-1,7),Ba=(-1,9),Ca=(-1,11),Da=(-3,11),Ea=(-5,11),Fa=(-7,11),Ga=(-9,11),Ha=(-11,11),Ia=(-11,9),Ja=(-11,7),Ka=(-9,7),La=(-7,7),Ma=(-5,7),Na=(-3,7),Oa=(-5,9),Pa=(-7,9); draw(B--C--H--J--N^^B--I^^D--N^^E--M^^F--L^^G--K); draw(Aa--Ca--Ha--Ja--Aa^^Ba--Ia^^Da--Na^^Ea--Ma^^Fa--La^^Ga--Ka); [/asy] [asy] defaultpen(linewidth(0.4)+fontsize(10));size(50); pair A=(-1,1),B=(-1,3),C=(-1,5),D=(-3,5),E=(-5,5),F=(-7,5),G=(-9,5),H=(-11,5),I=(-11,3),J=(-11,1),K=(-9,1),L=(-7,1),M=(-5,1),N=(-3,1),O=(-5,3),P=(-7,3),Aa=(-1,7),Ba=(-1,9),Ca=(-1,11),Da=(-3,11),Ea=(-5,11),Fa=(-7,11),Ga=(-9,11),Ha=(-11,11),Ia=(-11,9),Ja=(-11,7),Ka=(-9,7),La=(-7,7),Ma=(-5,7),Na=(-3,7),Oa=(-5,9),Pa=(-7,9); draw(B--Ca--Ea--M--N^^B--O^^C--E^^Aa--Ma^^Ba--Oa^^Da--N); draw(L--Fa--Ha--J--L^^Ga--K^^P--I^^F--H^^Ja--La^^Pa--Ia); [/asy] Here is a fixed $9\times 18$ grid table. Find the number of ways to cover the grid table completely with 18 [i]banners[/i].

A real number $a$ is chosen randomly and uniformly from the interval $[-20, 18]$. The probability that the roots of the polynomial \[x^4 + 2ax^3 + (2a-2)x^2 + (-4a+3)x - 2\] are all real can be written in the form $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

For positive integers $m,n \geq 2$, let $S_{m,n} = \{(i,j): i \in \{1,2,\ldots,m\}, j\in \{1,2,\ldots,n\}\}$ be a grid of $mn$ lattice points on the coordinate plane. Determine all pairs $(m,n)$ for which there exists a simple polygon $P$ with vertices in $S_{m,n}$ such that all points in $S_{m,n}$ are on the boundary of $P$, all interior angles of $P$ are either $90^{\circ}$ or $270^{\circ}$ and all side lengths of $P$ are $1$ or $3$.