This graph depicts the torque output of a hypothetical gasoline engine as a function of rotation frequency. The engine is incapable of running outside of the graphed range. [asy] size(200); draw((0,0)--(10,0)--(10,7)--(0,7)--cycle); for (int i=1;i<10;++i) { draw((i,0)--(i,7),dashed+linewidth(0.5)); } for (int j=1;j<7;++j) { draw((0,j)--(10,j),dashed+linewidth(0.5)); } draw((0,0)--(0,-0.3)); draw((4,0)--(4,-0.3)); draw((8,0)--(8,-0.3)); draw((0,0)--(-0.3,0)); draw((0,2)--(-0.3,2)); draw((0,4)--(-0.3,4)); draw((0,6)--(-0.3,6)); label("0",(0,-0.5),S); label("1000",(4,-0.5),S); label("2000",(8,-0.5),S); label("0",(-0.5,0),W); label("10",(-0.5,2),W); label("20",(-0.5,4),W); label("30",(-0.5,6),W); label("I",(1,-1.5),S); label("II",(6,-1.5),S); label("III",(9,-1.5),S); label(scale(0.95)*"Engine Revolutions per Minute",(5,-3.5),N); label(scale(0.95)*rotate(90)*"Output Torque (Nm)",(-1.5,3),W); path A=(0.9,2.7)--(1.213, 2.713)-- (1.650, 2.853)-- (2.087, 3)-- (2.525, 3.183)-- (2.963, 3.471)-- (3.403, 3.888)-- (3.823, 4.346)-- (4.204, 4.808)-- (4.565, 5.277)-- (4.945, 5.719)-- (5.365, 6.101)-- (5.802, 6.298)-- (6.237, 6.275)-- (6.670, 6.007)-- (7.101, 5.600)-- (7.473, 5.229)-- (7.766, 4.808)-- (8.019, 4.374)-- (8.271, 3.894)-- (8.476, 3.445)-- (8.568, 2.874)-- (8.668, 2.325)-- (8.765, 1.897)-- (8.794, 1.479)--(8.9,1.2); draw(shift(0.1*right)*shift(0.2*down)*A,linewidth(3)); [/asy] At what engine RPM (revolutions per minute) does the engine produce maximum power? (A) $\text{I}$ (B) At some point between $\text{I}$ and $\text{II}$ (C) $\text{II}$ (D) At some point between $\text{II}$ and $\text{III}$ (E) $\text{III}$

[asy] for(int a=0; a<4; ++a) { draw((a,0)--(a,3)); } for(int b=0; b<4; ++b) { draw((0,b)--(3,b)); }[/asy] Placing no more than one $x$ in each small square, what is the greatest number of $x$'s that can be put on the grid shown without getting three $x$'s in a row vertically, horizontally, or diagonally? $ \text{(A)}\ 2\qquad\text{(B)}\ 3\qquad\text{(C)}\ 4\qquad\text{(D)}\ 5\qquad\text{(E)}\ 6 $

([b]8[/b]) Evaluate the integral $ \int_0^1\ln x \ln(1\minus{}x)\ dx$.

Let $ABCDEF$ be a regular hexagon with side length $2$. A circle with radius $3$ and center at $A$ is drawn. Find the area inside quadrilateral $BCDE$ but outside the circle. [i]Proposed by Carl Joshua Quines.[/i]

Let $m$ and $n$ be arbitrary non-negative integers. Prove that \[\frac{(2m)!(2n)!}{m! n!(m+n)!}\] is an integer.

$101$ people, sitting at a round table in any order, had $1,2,... , 101$ cards, respectively. A transfer is someone give one card to one of the two people adjacent to him. Find the smallest positive integer $k$ such that there always can through no more than $ k $ times transfer, each person hold cards of the same number, regardless of the sitting order.

$ABC$ is a triangle with a right angle at $C$. $M_1$ and $M_2$ are two arbitrary points inside $ABC$, and $M$ is the midpoint of $M_1M_2$. The extensions of $BM_1,BM$ and $BM_2$ intersect $AC$ at $N_1,N$ and $N_2$ respectively. Prove that $\frac{M_1N_1}{BM_1}+\frac{M_2N_2}{BM_2}\geq 2\frac{MN}{BM}$

Let $ABC$ be a triangle and $G$ its centroid. Let $G_a, G_b$ and $G_c$ be the orthogonal projections of $G$ on sides $BC, CA$, respectively $AB$. If $S_a, S_b$ and $S_c$ are the symmetrical points of $G_a, G_b$, respectively $G_c$ with respect to $G$, prove that $AS_a, BS_b$ and $CS_c$ are concurrent. Liana Topan

In a city of gnomes there are $1000$ identical towers, each of which has $1000$ stories, with exactly one gnome living on each story. Every gnome in the city wears a hat colored in one of $1000$ possible colors and any two gnomes in the same tower have different hats. A pair of gnomes are friends if they wear hats of the same color, one of them lives in the $k$-th story of his tower and the other one in the $(k+1)$-st story of his tower. Determine the maximal possible number of pairs of gnomes which are friends. [i]Authored by Nikola Velov[/i]

The numbers $1, 2, \ldots 49$ are placed in a $7\times 7$ array, and the sum of the numbers in each row and in each column is computed. Some of these $14$ sums are odd while others are even. Let $A$ denote the sum of all the odd sums and $B$ the sum of all even sums. Is it possible that the numbers were placed in the array in such a way that $A = B$?

Simplify $\frac{0.\overline{3}}{1.\overline{3}}$. $\text{(A) }\frac{3}{13}\qquad\text{(B) }\frac{1}{4}\qquad\text{(C) }\frac{3}{11}\qquad\text{(D) }\frac{1}{3}\qquad\text{(E) }\frac{3}{4}$

The square $A_1B_1C_1D_1$ is inscribed in the right triangle $ABC$ (with $C=90$) so that points $A_1$, $B_1$ lie on the legs $CB$ and $CA$ respectively ,and points $C_1$, $D_1$ lie on the hypotenuse $AB$. The circumcircle of triangles $B_1A_1C$ an $AC_1B_1$ intersect at $B_1$ and $Y$. Prove that the lines $A_1X$ and $B_1Y$ meet on the hypotenuse $AB$.

Let $ABC$ be an acute triangle with altitude $\overline{AH}$, and let $P$ be a variable point such that the angle bisectors $k$ and $\ell$ of $\angle PBC$ and $\angle PCB$, respectively, meet on $\overline{AH}$. Let $k$ meet $\overline{AC}$ at $E$, $\ell$ meet $\overline{AB}$ at $F$, and $\overline{EF}$ meet $\overline{AH}$ at $Q$. Prove that as $P$ varies, line $PQ$ passes through a fixed point.

Which is the best value for the mass of the block? (a) $\text{3 kg}$ (b) $\text{5 kg}$ (c) $\text{10 kg}$ (d) $\text{20 kg}$ (e) $\text{30 kg}$

$a,b,c $ are positive real numbers . Prove that $\sqrt[7]{\frac{a}{b+c}+\frac{b}{c+a}} +\sqrt[7]{\frac{b}{c+a}+\frac{c}{b+a}}+\sqrt[7]{\frac{c}{a+b}+\frac{a}{b+c}}\geq 3$

Let $ABCDEFGHI$ be a regular polygon with $9$ sides and the vertices are written in the counterclockwise and let $ABJKLM$ be a regular polygon with $6$ sides and the vertices are written in the clockwise. Prove that $\angle HMG=\angle KEL$. Note: The polygon $ABJKLM$ is inside of $ABCDEFGHI$.

Let $ABC$ be a triangle with incenter $I$. Suppose the reflection of $AB$ across $CI$ and the reflection of $AC$ across $BI$ intersect at a point $X$. Prove that $XI$ is perpendicular to $BC$.

Given $n\ge 3$. consider a sequence $a_1,a_2,...,a_n$, if $(a_i,a_j,a_k)$ with i+k=2j (i<j<k) and $a_i+a_k\ne 2a_j$, we call such a triple a $NOT-AP$ triple. If a sequence has at least one $NOT-AP$ triple, find the least possible number of the $NOT-AP$ triple it contains.

The trapezoid below has bases with lengths 7 and 17 and area 120. Find the difference of the areas of the two triangles. [center] [img]https://i.snag.gy/BlqcSQ.jpg[/img] [/center]

Let $n \ge 2$ be an integer, and let $A_n$ be the set \[A_n = \{2^n - 2^k\mid k \in \mathbb{Z},\, 0 \le k < n\}.\] Determine the largest positive integer that cannot be written as the sum of one or more (not necessarily distinct) elements of $A_n$ . [i]Proposed by Serbia[/i]

Let $m,n$ be positive integers. An $n\times n$ board has rows and columns numbered $1,2,\dots,n$ from left to right and top to bottom, respectively. This board is colored with colors $r_1,r_2,\dots,r_m$ such that the cell at the intersection of $i$th row and $j$th column is colored with $r_{i+j-1}$ where indices are taken modulo $m$. After the board is colored, Ahmet wants to put $n$ stones to the board so that each row and column has exactly one stone, also he wants to put the same amount of stones to each color. Find all pairs $(m,n)$ for which he can accomplish his goal. Proposed by [i]Sena Başaran[/i]

Let $a,b,c$ be positive real numbers so that $a+b+c = \frac{1}{\sqrt{3}}$. Find the maximum value of $$27abc+a\sqrt{a^2+2bc}+b\sqrt{b^2+2ca}+c\sqrt{c^2+2ab}.$$

A square table of size $7\times 7$ with the four corner squares deleted is given. [list=a] [*] What is the smallest number of squares which need to be colored black so that a $5-$square entirely uncolored Greek cross (Figure 1) cannot be found on the table? [*] Prove that it is possible to write integers in each square in a way that the sum of the integers in each Greek cross is negative while the sum of all integers in the square table is positive. [/list] [asy] size(3.5cm); usepackage("amsmath"); MP("\text{Figure }1.", (1.5, 3.5), N); DPA(box((0,1),(3,2))^^box((1,0),(2,3)), black); [/asy]

Without using Dirichlet's theorem, show that there are infinitely many primes ending in the digit $9$.

Is there a power of $2$ that when written in the decimal system has all its digits different from zero and it is possible to reorder them to form another power of $2$?