Each cell of the 4x4 board has a grasshopper. When a grasshopper jumps, it moves to one of the adjacent cells (down, up, right, or left). The grasshopper cannot move diagonally or go off the board. At most how many cells can remain empty after each grasshopper jumps once?

Let $n$ be a positive integer. The numbers $\{1, 2, ..., n^2\}$ are placed in an $n \times n$ grid, each exactly once. The grid is said to be [i]Muirhead-able[/i] if the sum of the entries in each column is the same, but for every $1 \le i,k \le n-1$, the sum of the first $k$ entries in column $i$ is at least the sum of the first $k$ entries in column $i+1$. For which $n$ can one construct a Muirhead-able array such that the entries in each column are decreasing? [i]Proposed by Evan Chen[/i]

A survey was taken in Ms. Susan's class to see what grades the class received: [center][img width=35]https://cdn.artofproblemsolving.com/attachments/5/c/e96cb42de6d5e1b100f37bbb71768d399842cb.png[/img][/center] What percent of the class received an "A"? $\textbf{(A) }3\%\qquad\textbf{(B) }5\%\qquad\textbf{(C) }10\%\qquad\textbf{(D) }15\%\qquad\textbf{(E) }27\%$

100 unit squares of an infinite squared plane form a $ 10\times 10$ square. Unit segments forming these squares are coloured in several colours. It is known that the border of every square with sides on grid lines contains segments of at most two colours. (Such square is not necessarily contained in the original $ 10\times 10$ square.) What maximum number of colours may appear in this colouring? [i]Author: S. Berlov[/i]

Find all triples $(a, b, c)$ of positive integers for which $a + (a, b) = b + (b, c) = c + (c, a)$. Here $(a, b)$ denotes the greatest common divisor of integers $a, b$. [i](Proposed by Mykhailo Shtandenko)[/i]

Let $K$, in square units, be the area of a trapezoid such that the shorter base, the altitude, and the longer base, in that order, are in arithmetic progression. Then: $\textbf{(A)}\ K \; \text{must be an integer} \qquad \textbf{(B)}\ K \; \text{must be a rational fraction} \\ \textbf{(C)}\ K \; \text{must be an irrational number} \qquad \textbf{(D)}\ K\; \text{must be an integer or a rational fraction} \qquad$ $\textbf{(E)}\ \text{taken alone neither} \; \textbf{(A)} \; \text{nor} \; \textbf{(B)} \; \text{nor} \; \textbf{(C)} \; \text{nor} \; \textbf{(D)} \; \text{is true}$

$17.$ Let $a,$ $b,$ and $c.$ be such that $a+b+c=0$ and $$P=\frac{a^2}{2a^2+bc}+\frac{b^2}{2b^2+ca}+\frac{c^2}{2c^2+ab}$$ is defined. What is the value of $P ?$

For each positive integer $p$, let $b(p)$ denote the unique positive integer $k$ such that $|k-\sqrt{p}|<\frac{1}{2}$. For example, $b(6) = 2$ and $b(23)=5$. If $S = \textstyle\sum_{p=1}^{2007}b(p)$, find the remainder when S is divided by 1000.

Consider the four lines $y = mx-k^2$ for different integer $k$. Let $(x_i,y_i)$, $i = 1,2,3,4$ be four different points , such that each belongs to two different lines and on each line pass through just the two of them. Lat $x_1\leq x_2\leq x_3\leq x_4$. Show that $x_1 + x_4 =x_2+x_3$ and $y_1y_4 =y_2y_3$.

Let $n$ be a positive integer and consider an arrangement of $2n$ blocks in a straight line, where $n$ of them are red and the rest blue. A swap refers to choosing two consecutive blocks and then swapping their positions. Let $A$ be the minimum number of swaps needed to make the first $n$ blocks all red and $B$ be the minimum number of swaps needed to make the first $n$ blocks all blue. Show that $A+B$ is independent of the starting arrangement and determine its value.

In the tetrahedron $ABCD$ three of the faces are right-angled triangles and the other is not an obtuse triangle. Prove that: (a) the fourth wall of the tetrahedron is a right-angled triangle if and only if exactly two of the plane angles having common vertex with the some of vertices of the tetrahedron are equal. (b) its volume is equal to $\frac16$ multiplied by the multiple of two shortest edges and an edge not lying on the same wall.

Find the minimal $k$ such that every set of $k$ different lines in $\mathbb R^3$ contains either $3$ mutually parallel lines or $3$ mutually intersecting lines or $3$ mutually skew lines.

The real numbers $x_1,\ldots ,x_{2011}$ satisfy \[x_1+x_2=2x_1',\ x_2+x_3=2x_2', \ \ldots, \ x_{2011}+x_1=2x_{2011}'\] where $x_1',x_2',\ldots,x_{2011}'$ is a permutation of $x_1,x_2,\ldots,x_{2011}$. Prove that $x_1=x_2=\ldots =x_{2011}$ .

Let $O$ is the center of the circumcircle of the triangle $ABC$. We know that $AB =1$ and $AO = AC = 2$ . Points $D$ and $E$ lie on extensions of sides $AB$ and $AC$ beyond points $B$ and $C$ respectively such that $OD = OE$ and $BD =\sqrt2 EC$. Find $OD^2$.

Let $A_1A_2...A_{99}$ be a regular $99-$gon and point $A_{100}$ be its center. find the smallest possible natural number $n$ , such that Parsa can color all segments $A_iA_j$ ( $1 \le i < j \le 100$ ) with one of $n$ colors in such a way that no two homochromatic segments intersect each other or share a vertex. [i]Proposed by Josef Tkadlec - Czech Republic[/i]

Jiiri and Mari both wish to tile an $n \times n$ chessboard with cards shown in the picture (each card covers exactly one square). Jiiri wants that for each two cards that have a common edge, the neighbouring parts are of different color, and Mari wants that the neighbouring parts are always of the same color. How many possibilities does Jiiri have to tile the chessboard and how many possibilities does Mari have? [img]https://cdn.artofproblemsolving.com/attachments/7/3/9c076eb17ba7ae7c000a2893c83288a94df384.png[/img]

Jacob likes to watchMickeyMouse Clubhouse! One day, he decides to create his own MickeyMouse head shown below, with two circles $\omega_1$ and $\omega_2$ and a circle $\omega$, and centers $O_1$, $O_2$, and $O$, respectively. Let $\omega_1$ and $\omega$ meet at points $P_1$ and $Q_1$, and let $\omega_2$ and $\omega$ meet at points $P_2$ and $Q_2$. Point $P_1$ is closer to $O_2$ than $Q_1$, and point $P_2$ is closer to $O_1$ than $Q_2$. Given that $P_1$ and $P_2$ lie on $O_1O_2$ such that $O_1P_1 = P_1P_2 = P_2O_2 = 2$, and $Q_1O_1 \parallel Q_2O_2$, the area of $\omega$ can be written as $n \pi$. Find $n$. [img]https://cdn.artofproblemsolving.com/attachments/6/d/d98a05ee2218e80fd84d299d47201669736d99.png[/img]

Twenty-seven players are randomly split into three teams of nine. Given that Zack is on a different team from Mihir and Mihir is on a different team from Andrew, what is the probability that Zack and Andrew are on the same team?

Sequence $ \{ f_n(a) \}$ satisfies $ \displaystyle f_{n\plus{}1}(a) \equal{} 2 \minus{} \frac{a}{f_n(a)}$, $ f_1(a) \equal{} 2$, $ n\equal{}1,2, \cdots$. If there exists a natural number $ n$, such that $ f_{n\plus{}k}(a) \equal{} f_{k}(a), k\equal{}1,2, \cdots$, then we call the non-zero real $ a$ a $ \textbf{periodic point}$ of $ f_n(a)$. Prove that the sufficient and necessary condition for $ a$ being a $ \textbf{periodic point}$ of $ f_n(a)$ is $ p_n(a\minus{}1)\equal{}0$, where $ \displaystyle p_n(x)\equal{}\sum_{k\equal{}0}^{\left[ \frac{n\minus{}1}{2} \right]} (\minus{}1)^k C_n^{2k\plus{}1}x^k$, here we define $ \displaystyle \frac{a}{0}\equal{} \infty$ and $ \displaystyle \frac{a}{\infty} \equal{} 0$.

Find $n$ such that $n - 76$ and $n + 76$ are both cubes of positive integers.

Let $\omega_1$ be the circumcircle of triangle $ABC$ and $O$ be its circumcenter. A circle $\omega_2$ touches the sides $AB, AC$, and touches the arc $BC$ of $\omega_1$ at point $K$. Let $I$ be the incenter of $ABC$. Prove that the line $OI$ contains the symmedian of triangle $AIK$.

If $a, b, c$ are real numbers such that $a+b+c=6$ and $ab+bc+ca = 9$, find the sum of all possible values of the expression $\lfloor a \rfloor + \lfloor b \rfloor + \lfloor c \rfloor$.

Let $S(n)$ denote the sum of digits of $n$ (in decimal representation). Do there exist three different natural numbers $n$, $p$ and $q$ such that $$n +S(n) = p + S(p) = q + S(q)?$$ (M Gerver)

For any positive $a$ and $b$, find positive solutions of the system $$\begin{cases} \dfrac{a^2}{x^2}- \dfrac{b^2}{y^2}=8(y^4-x^4) \\ ax-by=x^4-y^4 \end{cases}$$

Consider a square $8 \times 8$ board with its $64$ cells initially white. Determine the minimum number of colors needed to color the cells (each one with only one color) in such a way that if four cells on the board can be covered by an $L$-shaped tile as shown in the figure, then the four cells are of different colors. [asy] size(3cm); draw((1,0)--(1,1)--(2,1)--(2,0)--(1,0)--(0,0)--(0,1)--(0,2)--(1,2)--(1,1)--(0,1)--(1,1)--(2,1)--(3,1)--(3,0)--(2,0)); [/asy] [b]Note:[/b] The $L$-shaped tile can be rotated or flipped.