Given is a fixed regular pentagon $ABCDE$ with side $1$. Let $M$ be an arbitrary point inside or on it. Let the distance from $M$ to the closest vertex be $r_1$, to the next closest be $r_2$ and so on, so that the distances from $M$ to the five vertices satisfy $r_1\le r_2\le r_3\le r_4\le r_5$. Find (a) the locus of $M$ which gives $r_3$ the minimum possible value, and (b) the locus of $M$ which gives $r_3$ the maximum possible value.

Suppose that $ a_1,\cdots , a_{25}$ are non-negative integers, and $ k$ is the smallest of them. Prove that $$\big[\sqrt{a_1}\big]+\big[\sqrt{a_2}\big]+\cdots+\big[\sqrt{a_{25}}\big ]\geq\big[\sqrt{a_1+a_2+\cdots+a_{25}+200k}\big].$$ (As usual, $[x]$ denotes the integer part of the number $x$ , that is, the largest integer not exceeding $x$.)

Let $n\geqslant 3$ be an integer. Prove that there exists a set $S$ of $2n$ positive integers satisfying the following property: For every $m=2,3,...,n$ the set $S$ can be partitioned into two subsets with equal sums of elements, with one of subsets of cardinality $m$.

A rectangle with sides of lengths $a$ and $b$ ($a > b$) is cut into rightangled triangles so that any two of these triangles either have a common side, a common vertex or no common points. Moreover, any common side of two triangles is a leg of one of them and the hypotenuse of the other. Prove that $a > 2b$. (A Shapovalov)

Bradley is driving at a constant speed. When he passes his school, he notices that in $20$ minutes he will be exactly $\frac14$ of the way to his destination, and in $45$ minutes he will be exactly $\frac13$ of the way to his destination. Find the number of minutes it takes Bradley to reach his destination from the point where he passes his school.

Let be a twice-differentiable function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ that has the properties that: $ \text{(i) supp} f''=f\left(\mathbb{R}\right) $ $ \text{(ii)}\exists g:\mathbb{R}\longrightarrow\mathbb{R}\quad\forall x\in\mathbb{R}\quad f(x+1)=f(x)+f'\left( g(x)\right)\text{ and } f'(x+1)=f'(x)+f''\left( g(x)\right) $ Prove that: [b]a)[/b] any such $ g $ is injective. [b]b)[/b] $ f $ is of class $ C^{\infty } , $ and for any natural number $ n, $ any real number $ x $ and any such $ g, $ $$f^{(n)}(x+1)=f^{(n)}(x)+f^{(n+1)}\left( g(x)\right) . $$ [i]Laurențiu Panaitopol[/i]

Two people $A$ and $B$ play the following game: They take from $\{0, 1, 2, 3,..., 1024\}$ alternately $512$, $256$, $128$, $64$, $32$, $16$, $8$, $4$, $2$, $1$, numbers away where $A$ first removes $512$ numbers, $B$ removes $256$ numbers etc. Two numbers $a, b$ remain ($a < b$). $B$ pays $A$ the amount $b - a$. $A$ would like to win as much as possible, $B$ would like to lose as little as possible. What profit does $A$ make if does every player play optimally according to their goals? The result must be justified.

Let $x,y,z,t$ be positive numbers.Prove that $\frac{xyzt}{(x+y)(z+t)}\leq\frac{(x+z)^2(y+t)^2}{4(x+y+z+t)^2}.$

In a triangle the sum of squares of the sides is $96$. What is the maximum possible value of the sum of the medians?

Let $ABC$ be a scalene triangle with $\angle BCA = 90^{\circ}$, and let $D$ be the foot of the altitude from $C$. Let $X$ be a point in the interior of the segment $CD$. Let $K$ be the point on the segment $AX$ such that $BK = BC$. Similarly, let $L$ be the point on the segment $BX$ such that $AL = AC$. The circumcircle of triangle $DKL$ intersects segment $AB$ at a second point $T$ (other than $D$). Prove that $\angle ACT = \angle BCT$.

Let $N$ be a natural number and $x_1, \ldots , x_n$ further natural numbers less than $N$ and such that the least common multiple of any two of these $n$ numbers is greater than $N$. Prove that the sum of the reciprocals of these $n$ numbers is always less than $2$: $\sum^n_{i=1} \frac{1}{x_i} < 2.$

Let $\alpha,\ \beta$ be real numbers. Find the ranges of $\alpha,\ \beta$ such that the improper integral $\int_1^{\infty} \frac{x^{\alpha}\ln x}{(1+x)^{\beta}}$ converges.

Denote by $\lfloor x\rfloor$ the greatest positive integer less than or equal to $x$. Let $m\ge2$ be an integer, and let $s$ be a real number between $0$ and $1$. Define an infinite sequence of real numbers $a_1, a_2, a_3,\ldots$ by setting $a_1 = s$ and $ak = ma_{k-1}-(m-1)\lfloor a_{k-1}\rfloor$ for all $k\ge2$. For example, if $m = 3$ and $s = \tfrac58$, then we get $a_1 = \tfrac58$, $a_2 = \tfrac{15}8$, $a_3 = \tfrac{29}8$, $a_4 = \tfrac{39}8$, and so on. Call the sequence $a_1, a_2, a_3,\ldots$ $\textbf{orderly}$ if we can find rational numbers $b, c$ such that $\lfloor a_n\rfloor = \lfloor bn + c\rfloor$ for all $n\ge1$. With the example above where $m = 3$ and $s = \tfrac58$, we get an orderly sequence since $\lfloor a_n\rfloor = \left\lfloor\tfrac{3n}2-\tfrac32\right\rfloor$ for all $n$. Show that if $s$ is an irrational number and $m\ge2$ is any integer, then the sequence $a_1, a_2, a_3,\ldots$ is $\textbf{not}$ an orderly sequence.

2500 chess kings have to be placed on a $100 \times 100$ chessboard so that [b](i)[/b] no king can capture any other one (i.e. no two kings are placed in two squares sharing a common vertex); [b](ii)[/b] each row and each column contains exactly 25 kings. Find the number of such arrangements. (Two arrangements differing by rotation or symmetry are supposed to be different.) [i]Proposed by Sergei Berlov, Russia[/i]

Calculate to the first order in $\epsilon$ the effect that the influence of the flattening of the earth ($\epsilon\approx 1/300$) on the gravitational field of the earth has on the distance of the moon (assuming the earth to be homogeneous).

Given a matrix $\{a_{ij}\}_{i,j=0}^{9}$, $a_{ij}=10i+j+1$. Andrei is going to cover its entries by $50$ rectangles $1\times 2$ (each such rectangle contains two adjacent entries) so that the sum of $50$ products in these rectangles is minimal possible. Help him. [i]A. Badzyan[/i]

The length of the middle line of a trapezoid is $4$ and the angles at one of the bases are $40^\circ$ and $50^\circ$. Determine the lengths of the bases if the distance between their midpoints is $1$.

Consider the following layouts of nine triangles with the letters $A, B, C, D, E, F, G, H, I$ in its interior. [asy] /* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki, go to User:Azjps/geogebra */ import graph; size(200); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = 1.740000000000003, xmax = 8.400000000000013, ymin = 3.500000000000005, ymax = 9.360000000000012; /* image dimensions */ draw((5.020000000000005,8.820000000000011)--(2.560000000000003,4.580000000000005)--(7.461947712046029,4.569577506690286)--cycle); /* draw figures */ draw((5.020000000000005,8.820000000000011)--(2.560000000000003,4.580000000000005)); draw((2.560000000000003,4.580000000000005)--(7.461947712046029,4.569577506690286)); draw((7.461947712046029,4.569577506690286)--(5.020000000000005,8.820000000000011)); draw((3.382989341689345,5.990838871467448)--(4.193333333333338,4.580000000000005)); draw((4.202511849578174,7.405966442513598)--(5.828619600041468,4.573707435672692)); draw((5.841878190157451,7.408513542990484)--(4.193333333333338,4.580000000000005)); draw((6.656214943659867,5.990342259816768)--(5.828619600041468,4.573707435672692)); draw((4.202511849578174,7.405966442513598)--(5.841878190157451,7.408513542990484)); draw((3.382989341689345,5.990838871467448)--(6.656214943659867,5.990342259816768)); label("\textbf{A}",(4.840000000000007,8.020000000000010),SE*labelscalefactor,fontsize(22)); label("\textbf{B}",(3.980000000000006,6.640000000000009),SE*labelscalefactor,fontsize(22)); label("\textbf{C}",(4.820000000000007,7.000000000000010),SE*labelscalefactor,fontsize(22)); label("\textbf{D}",(5.660000000000008,6.580000000000008),SE*labelscalefactor,fontsize(22)); label("\textbf{E}",(3.160000000000005,5.180000000000006),SE*labelscalefactor,fontsize(22)); label("\textbf{F}",(4.020000000000006,5.600000000000008),SE*labelscalefactor,fontsize(22)); label("\textbf{G}",(4.800000000000007,5.200000000000007),SE*labelscalefactor,fontsize(22)); label("\textbf{H}",(5.680000000000009,5.620000000000007),SE*labelscalefactor,fontsize(22)); label("\textbf{I}",(6.460000000000010,5.140000000000006),SE*labelscalefactor,fontsize(22)); /* dots and labels */ clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */[/asy] A sequence of letters, each letter chosen from$ A, B, C, D, E, F, G, H, I$ is said to be [i]triangle-friendly[/i] if the first and last letter of the sequence is $C$, and for every letter except the first letter, the triangle containing this letter shares an edge with the triangle containing the previous letter in the sequence. For example, the letter after $C$ must be either $A, B$, or $D$. For example, $CBF BC$ is triangle-friendly, but $CBF GH$ and $CBBHC$ are not. [list] [*] (a) Determine the number of triangle-friendly sequences with $2012$ letters. [*] (b) Determine the number of triangle-friendly sequences with exactly $2013$ letters.[/list]

Let $ ABC$ be an equilateral triangle and $ P$ in its interior. The distances from $ P$ to the triangle's sides are denoted by $ a^2, b^2,c^2$ respectively, where $ a,b,c>0$. Find the locus of the points $ P$ for which $ a,b,c$ can be the sides of a non-degenerate triangle.

Find the sum of all the positive divisors of $27000$.

Find all positive integers $n$ such that the decimal representation of $n^2$ consists of odd digits only.

$a_{n}$ is a sequence that $a_{1}=1,a_{2}=2,a_{3}=3$, and \[a_{n+1}=a_{n}-a_{n-1}+\frac{a_{n}^{2}}{a_{n-2}}\] Prove that for each natural $n$, $a_{n}$ is integer.

Two circles $ (O_1)$ and $ (O_2)$ touch externally at the point $C$ and internally at the points $A$ and $B$ respectively with another circle $(O)$. Suppose that the common tangent of $ (O_1)$ and $ (O_2)$ at $C$ meets $(O)$ at $P$ such that $PA=PB$. Prove that $PO$ is perpendicular to $AB$.

Joe is given a permutation $p = (a_1, a_2, a_3, a_4, a_{5})$ of $(1, 2, 3, 4, 5)$. A [i]swap[/i] is an ordered pair $(i, j)$ with $1 \le i < j \le 5$, and this allows Joe to swap the positions $i$ and $j$ in the permutation. For example, if Joe starts with the permutation $(1, 2, 3, 4, 5)$, and uses the swaps $(1, 2)$ and $(1, 3)$, the permutation becomes \[(1, 2, 3, 4, 5) \rightarrow (2, 1, 3, 4, 5) \rightarrow (3, 1, 2, 4, 5). \]Out of all $\tbinom{5}{2} = 10$ swaps, Joe chooses $4$ of them to be in a set of swaps $S$. Joe notices that from $p$ he could reach any permutation of $(1, 2, 3, 4, 5)$ using only the swaps in $S$. How many different sets are possible? [i]Proposed by Yang Liu[/i]

Given an integer $ n > 3.$ Prove that there exists a set $ S$ consisting of $ n$ pairwisely distinct positive integers such that for any two different non-empty subset of $ S$:$ A,B, \frac {\sum_{x\in A}x}{|A|}$ and $ \frac {\sum_{x\in B}x}{|B|}$ are two composites which share no common divisors.