A real number $\alpha$ is given. Find all functions $f : R^+ \to R^+$ satisfying $\alpha x^2f\left(\frac{1}{x}\right) +f(x) =\frac{x}{x+1}$ for all $x > 0$.

Product of square trinomials $ x ^ 2 + a_1x + b_1 $, $ x ^ 2 + a_2x + b_2 $, $ \dots $, $ x ^ 2 + a_n x + b_n $ equals polynomial $ P (x) = x ^ {2n} + c_1x ^ {2n-1} + c_2x ^ {2n-2} + \dots + c_ {2n-1} x + c_ {2n} $, where the coefficients $ c_1 $, $ c_2 $, $ \dots $, $ c_ {2n} $ are positive. Prove that for some $ k $ ($ 1 \leq k \leq n $) the coefficients $ a_k $ and $ b_k $ are positive.

The function $f(x,y)$, defined on the set of all non-negative integers, satisfies (i) $f(0,y)=y+1$ (ii) $f(x+1,0)=f(x,1)$ (iii) $f(x+1,y+1)=f(x,f(x+1,y))$ Find f(3,2005), f(4,2005)

If a point $A_1$ is in the interior of an equilateral triangle $ABC$ and point $A_2$ is in the interior of $\triangle{A_1BC}$, prove that \[\operatorname{I.Q.} (A_1BC) > \operatorname{I.Q.} (A_2BC),\] where the [i]isoperrimetric quotient[/i] of a figure $F$ is defined by \[\operatorname{I.Q.}(F) = \frac{\operatorname{Area}(F)}{[\operatorname{Perimeter}(F)]^2}.\]

Let $ C_1$ and $ C_2$ be circles defined by \[ (x \minus{} 10)^2 \plus{} y^2 \equal{} 36\]and \[ (x \plus{} 15)^2 \plus{} y^2 \equal{} 81,\]respectively. What is the length of the shortest line segment $ \overline{PQ}$ that is tangent to $ C_1$ at $ P$ and to $ C_2$ at $ Q$? $ \textbf{(A)}\ 15 \qquad \textbf{(B)}\ 18 \qquad \textbf{(C)}\ 20 \qquad \textbf{(D)}\ 21 \qquad \textbf{(E)}\ 24$

Let $a,b,c \in\mathbb{R^*_+}$.Prove the inequality $\frac{a^2+4}{b+c}+\frac{b^2+9}{c+a}+\frac{c^2+16}{a+b}\ge9$.

There is a single coin on each square of a $5 \times 5$ board. All the coins look the same. Two of them are fakes and have equal weight. Genuine coins are heavier than fake ones and also weigh the same. The fake coins are on the squares sharing just one vertice. Is it possible to determine for sure a) 13 genuine coins; b) 15 genuine coins; and c) 17 genuine coins in a single weighing on a balance with no unit weights? [i]Rustem Zhenodarov, Alexandr Gribalko, Sergey Tokarev[/i]

Let $ABCD$ be a cyclic quadrilateral. Suppose that $E$ is the intersection of $AB$ and $CD, F$ is the intersection of $AD$ and $CB, I$ is the intersection of $AC$ and $BD$. The circumcircles $(FAB), (FCD)$ meet $FI$ at $K, L$. Prove that $EK = EL$ Nguyễn Minh Hà

Altitudes $BE$ and $CF$ of an acute-angled triangle $ABC$ meet at point $H$. The perpendicular from $H$ to $EF$ meets the line $\ell$ passing through $A$ and parallel to $BC$ at point $P$. The bisectors of two angles between $\ell$ and $HP$ meet $BC$ at points $S$ and $T$. Prove that the circumcircles of triangles $ABC$ and $PST$ are tangent.

In a $7\times 7\times 7$ cube, the unit cubes are colored white, black and gray colors so that for any two colors the number of cubes of these two colors are different. In this case, $N$ parallel rows of $7$ cubes were found, each of which there are more white cubes than gray and than black. Likewise, there were $N$ parallel rows of $7$ cubes, each of which contained gray there are more cubes than white and than black, and there are also N parallel rows of $7$ cubes, each of which contains more black cubes than white ones and than gray ones. What is the largest $N$ for which this is possible?

The figure shows a rectangle, its circumscribed circle and four semicircles, which have the rectangle’s sides as diameters. Prove that the combined area of the four dark gray crescentshaped regions is equal to the area of the light gray rectangle. [img]https://1.bp.blogspot.com/-gojv6KfBC9I/XzT9ZMKrIeI/AAAAAAAAMVU/NB-vUldjULI7jvqiFWmBC_Sd8QFtwrc7wCLcBGAsYHQ/s0/2013%2BMohr%2Bp3.png[/img]

Find all second degree polynomial $d(x)=x^{2}+ax+b$ with integer coefficients, so that there exists an integer coefficient polynomial $p(x)$ and a non-zero integer coefficient polynomial $q(x)$ that satisfy: \[\left( p(x) \right)^{2}-d(x) \left( q(x) \right)^{2}=1, \quad \forall x \in \mathbb R.\]

$ABC$ is a triangle and $\angle A=90^{\circ}$. Let $D$ be the meet point of the interior bisector of $\angle A$ and $BC$. And let $I_a$ be the $A-$excenter of $\triangle ABC$. Prove that: \[\frac{AD}{DI_a}\leq\sqrt{2}-1.\]

Let $ A \equal{} \{(a_1,\dots,a_8)|a_i\in\mathbb{N}$ , $ 1\leq a_i\leq i \plus{} 1$ for each $ i \equal{} 1,2\dots,8\}$.A subset $ X\subset A$ is called sparse if for each two distinct elements $ (a_1,\dots,a_8)$,$ (b_1,\dots,b_8)\in X$,there exist at least three indices $ i$,such that $ a_i\neq b_i$. Find the maximal possible number of elements in a sparse subset of set $ A$.

A circle is tangent internally by $6$ circles so that each one is tangent internally to two adjacent ones and the radii of opposite circles are pairwise equal. Prove that the sum of the radii of the inner circles is equal to the diameter of the given circle.

Do there exist infinitely many triplets of positive integers $(a, b, c)$ such that the following two conditions hold: 1. $\gcd(a, b, c) = 1$; 2. $a+b+c, a^2+b^2+c^2$ and $abc$ are all perfect squares? [i](Proposed by Ivan Chan Guan Yu)[/i]

For positive real numbers $a,b,c$ with $abc=1$ prove that $\left(a+\frac{1}{b}\right)^{2}+\left(b+\frac{1}{c}\right)^{2}+\left(c+\frac{1}{a}\right)^{2}\geq 3(a+b+c+1)$

Let $\{a_n\}$ be a sequence of nondecreasing positive integers such that $\textstyle\frac{r}{a_r} = k+1$ for some positive integers $k$ and $r$. Prove that there exists a positive integer $s$ such that $\textstyle\frac{s}{a_s} = k$.

Three angles of a non-convex, non-self-intersecting quadrilateral are equal to $45$ degrees (i.e. the last equals $225$ degrees). Prove that the midpoints of its sides are vertices of a square. (V Proizvolov)

A student wishes to determine the thickness of a rectangular piece of aluminum foil but cannot measure it directly. She can measure its density $(d)$, length $(l)$, mass $(m)$ and width $(w)$. Which relationship will give the thickness? $\textbf{(A)}\hspace{.05in}\frac{m}{d \cdot l \cdot w} \qquad\textbf{(B)}\hspace{.05in}\frac{m \cdot l \cdot w}{d} \qquad\textbf{(C)}\hspace{.05in}\frac{d \cdot l \cdot w}{m} \qquad\textbf{(D)}\hspace{.05in}\frac{d \cdot m }{l \cdot w} \qquad$

An apple orchard’s layout is a rectangular grid of unit squares. Some pairs of adjacent squares have a thick wall of grape vines between them. The orchard wants to post some robot sentries to guard its prized apple trees. Each sentry occupies a single square of the layout, and from there it can guard both its square and any square in the same row and column that it can see, where only walls and the edges of the orchard block its sight. A sample layout (not the layout of the actual orchard, which is not given) is shown below. Although a square may be guarded by multiple sentries, the sentries have not been programmed to avoid attacking other sentries. Thus, no sentry may be placed on a square guarded by another sentry. The orchard’s expert has found a way to guard all the squares of the orchard by placing 1000 sentries. However, the contractor shipped 2020 sentries. Show that it is impossible for the orchard to place all 2020 of the sentries without two of them attacking each other.

Let $ABC$ be a triangle with incenter $I$. Points $K$ and $L$ are chosen on segment $BC$ such that the incircles of $\triangle ABK$ and $\triangle ABL$ are tangent at $P$, and the incircles of $\triangle ACK$ and $\triangle ACL$ are tangent at $Q$. Prove that $IP=IQ$. [i]Ankan Bhattacharya[/i]

Let $\mathcal P$ be a finite set of squares on an infinite chessboard. Kelvin the Frog notes that $\mathcal P$ may be tiled with only $1 \times 2$ dominoes, while Alex the Kat notes that $\mathcal P$ may be tiled with only $2 \times 1$ dominoes. The dominoes cannot be rotated in each tiling. Prove that the area of $\mathcal P$ is a multiple of 4.

Farmer John has a $47 \times 53$ rectangular square grid. He labels the first row $1, 2, \cdots, 47$, the second row $48, 49, \cdots, 94$, and so on. He plants corn on any square of the form $47x + 53y$, for non-negative integers $x, y$. Given that the unplanted squares form a contiguous region $R$, find the perimeter of $R$.

Prove that there exist infinitely many non prime positive integers $n$ such that $7^{n-1} - 3^{n-1}$ is divisible by $n$. Lê Anh Vinh