A quota of diplomas at the All-Russian Olympiad should be strictly less than $45\%$. More than $20$ students took part in the olympiad. After the olympiad the Authorities declared the results low because the quota of diplomas was significantly less than $45\%$. The Jury responded that the quota was already maximum possible on this olympiad or any other olympiad with smaller number of participants. Then the Authorities ordered to increase the number of participants for the next olympiad so that the quota of diplomas became at least two times closer to $45\%$. Prove that the number of participants should be at least doubled.

Determine for what values of $x$ the expressions $2x + 2$,$x + 4$, $x + 2$ can represent the sidelengths of a right triangle.

Each of the even numbers $2, 4, 6, \ldots, 50$ is divided by $7$. The remainders are recorded. Which histogram displays the number of times each remainder appears? [img]https://i.imgur.com/f1oQExa.png[/img]

Find all positive reals $x,y,z $ such that \[2x-2y+\dfrac1z = \dfrac1{2014},\hspace{0.5em} 2y-2z +\dfrac1x = \dfrac1{2014},\hspace{0.5em}\text{and}\hspace{0.5em} 2z-2x+ \dfrac1y = \dfrac1{2014}.\]

Let $n\geq 2$ be an integer and $a_1,a_2,\cdots,a_n>1$ be real numbers. Prove that the inequality below holds. $$\prod_{i=1}^n\left(a_ia_{i+1}-\frac{1}{a_ia_{i+1}}\right)\geq 2^n\prod_{i=1}^n\left(a_i-\frac{1}{a_i}\right)$$

Is it possible to write a positive integer in every cell of an infinite chessboard, in such a manner that, for all positive integers $m, n$, the sum of numbers in every $m\times n$ rectangle is divisible by $m + n$ ?

In the diagram below, square $ABCD$ with side length 23 is cut into nine rectangles by two lines parallel to $\overline{AB}$ and two lines parallel to $\overline{BC}$. The areas of four of these rectangles are indicated in the diagram. Compute the largest possible value for the area of the central rectangle. [asy] size(250); defaultpen (linewidth (0.7) + fontsize (10)); draw ((0,0)--(23,0)--(23,23)--(0,23)--cycle); label("$A$", (0,23), NW); label("$B$", (23, 23), NE); label("$C$", (23,0), SE); label("$D$", (0,0), SW); draw((0,6)--(23,6)); draw((0,19)--(23,19)); draw((5,0)--(5,23)); draw((12,0)--(12,23)); label("13", (17/2, 21)); label("111",(35/2,25/2)); label("37",(17/2,3)); label("123",(2.5,12.5));[/asy] [i]Proposed by Lewis Chen[/i]

A rectangular array of positive integers has $4$ rows. The sum of the entries in each column is $20$. Within each row, all entries are distinct. What is the maximum possible number of columns?

The limit of the sum of an infinite number of terms in a geometric progression is $ \frac {a}{1 \minus{} r}$ where $ a$ denotes the first term and $ \minus{} 1 < r < 1$ denotes the common ratio. The limit of the sum of their squares is: $ \textbf{(A)}\ \frac {a^2}{(1 \minus{} r)^2} \qquad\textbf{(B)}\ \frac {a^2}{1 \plus{} r^2} \qquad\textbf{(C)}\ \frac {a^2}{1 \minus{} r^2} \qquad\textbf{(D)}\ \frac {4a^2}{1 \plus{} r^2} \qquad\textbf{(E)}\ \text{none of these}$

Compute $\frac{664.02}{9.3}$.

Liquid X does not mix with water. Unless obstructed, it spreads out on the surface of water to form a circular film $0.1$ cm thick. A rectangular box measuring $6$ cm by $3$ cm by $12$ cm is filled with liquid X. Its contents are poured onto a large body of water. What will be the radius, in centimeters, of the resulting circular film? $ \textbf{(A)}\ \frac{\sqrt{216}}{\pi}\qquad\textbf{(B)}\ \sqrt{\frac{216}{\pi}}\qquad\textbf{(C)}\ \sqrt{\frac{2160}{\pi}}\qquad\textbf{(D)}\ \frac{216}{\pi}\qquad\textbf{(E)}\ \frac{2160}{\pi} $

Let $A$ be an even number but not divisible by $10$. The last two digits of $A^{20}$ are: (A): $46$, (B): $56$, (C): $66$, (D): $76$, (E): None of the above.

Let $\Gamma$ be a circle and let $d$ be a line such that $\Gamma$ and $d$ have no common points. Further, let $AB$ be a diameter of the circle $\Gamma$; assume that this diameter $AB$ is perpendicular to the line $d$, and the point $B$ is nearer to the line $d$ than the point $A$. Let $C$ be an arbitrary point on the circle $\Gamma$, different from the points $A$ and $B$. Let $D$ be the point of intersection of the lines $AC$ and $d$. One of the two tangents from the point $D$ to the circle $\Gamma$ touches this circle $\Gamma$ at a point $E$; hereby, we assume that the points $B$ and $E$ lie in the same halfplane with respect to the line $AC$. Denote by $F$ the point of intersection of the lines $BE$ and $d$. Let the line $AF$ intersect the circle $\Gamma$ at a point $G$, different from $A$. Prove that the reflection of the point $G$ in the line $AB$ lies on the line $CF$.

The sum of first $n$ items of squence $(a_n)$ : $S_n$ satisfies that $S_n=2a_n-1$, squence $(b_n)$ satisfies that $b_{k+1}=a_k+b_k$ for all $k=1,2,\cdots$. Find the sum of first $n$ items of $(b_n)$.

Two ants crawl along the perimeter of a polygonal table, so that the distance between them is always $10$ cm. Each side of the table is more than $1$ meter long. At the initial moment both ants are on the same side of the table. (a) [i](2 points)[/i] Suppose that the table is a convex polygon. Is it always true that both ants can visit each point on the perimeter? (b) [i](4 points)[/i] Is it always true (this time without assumption of convexity) that each point on the perimeter can be visited by at least one ant?

We say that $1\leq a\leq101$ is a quadratic polynomial residue modulo $101$ with respect to a quadratic polynomial $f(x)$ with integer coefficients if there exists an integer $b$ such that $101 \mid a-f(b)$. For a quadratic polynomial $f$, we define its quadratic residue set as the set of quadratic residues modulo $101$ with respect to $f(x)$. Compute the number of quadratic residue sets. [i]Proposed by Michael Ren[/i]