For a positive integer $n$, we consider an $n \times n$ board and tiles with dimensions $1 \times 1, 1 \times 2, ..., 1 \times n$. In how many ways exactly can $\frac12 n (n + 1)$ cells of the board are colored red, so that the red squares can all be covered by placing the $n$ tiles all horizontally, but also by placing all $n$ tiles vertically? Two colorings that are not identical, but by rotation or reflection from the board into each other count as different.

As shown in the figure below, point $E$ lies on the opposite half-plane determined by line $CD$ from point $A$ so that $\angle CDE = 110^\circ$. Point $F$ lies on $\overline{AD}$ so that $DE=DF$, and $ABCD$ is a square. What is the degree measure of $\angle AFE?$ [asy] size(6cm); pair A = (0,10); label("$A$", A, N); pair B = (0,0); label("$B$", B, S); pair C = (10,0); label("$C$", C, S); pair D = (10,10); label("$D$", D, SW); pair EE = (15,11.8); label("$E$", EE, N); pair F = (3,10); label("$F$", F, N); filldraw(D--arc(D,2.5,270,380)--cycle,lightgray); dot(A^^B^^C^^D^^EE^^F); draw(A--B--C--D--cycle); draw(D--EE--F--cycle); label("$110^\circ$", (15,9), SW); [/asy] $\textbf{(A) }160\qquad\textbf{(B) }164\qquad\textbf{(C) }166\qquad\textbf{(D) }170\qquad\textbf{(E) }174$

Let $ABC$ ($BC > AC$) be an acute triangle with circumcircle $k$ centered at $O$. The tangent to $k$ at $C$ intersects the line $AB$ at the point $D$. The circumcircles of triangles $BCD, OCD$ and $AOB$ intersect the ray $CA$ (beyond $A$) at the points $Q, P$ and $K$, respectively, such that $P \in (AK)$ and $K \in (PQ)$. The line $PD$ intersects the circumcircle of triangle $BKQ$ at the point $T$, so that $P$ and $T$ are in different halfplanes with respect to $BQ$. Prove that $TB = TQ$.

There are $n$ holes in a circle. The holes are numbered $1,2,3$ and so on to $n$. In the beginning, there is a peg in every hole except for hole $1$. A peg can jump in either direction over one adjacent peg to an empty hole immediately on the other side. After a peg moves, the peg it jumped over is removed. The puzzle will be solved if all pegs disappear except for one. For example, if $n=4$ the puzzle can be solved in two jumps: peg $3$ jumps peg $4$ to hole $1$, then peg $2$ jumps the peg in $1$ to hole $4$. (See illustration below, in which black circles indicate pegs and white circles are holes.) [center][img]http://i.imgur.com/4ggOa8m.png[/img][/center] [list=a] [*]Can the puzzle be solved for $n=5$? [*]Can the puzzle be solved for $n=2014$? [/list] In each part (a) and (b) either describe a sequence of moves to solve the puzzle or explain why it is impossible to solve the puzzle.

Henry's Hamburger Heaven orders its hamburgers with the following condiments: ketchup, mustard, mayonnaise, tomato, lettuce, pickles, cheese, and onions. A customer can choose one, two, or three meat patties, and any collection of condiments. How many different kinds of hamburgers can be ordered? $ \textbf{(A)}\ 24 \qquad \textbf{(B)}\ 256\qquad \textbf{(C)}\ 768\qquad \textbf{(D)}\ 40,\!320\qquad \textbf{(E)}\ 120,\!960$

Let $ABC$ be an isosceles triangle with $AB = AC$. Suppose $P,Q,R$ are points on segments $AC, AB, BC$ respectively such that $AP = QB$, $\angle PBC = 90^\circ - \angle BAC$ and $RP = RQ$. Let $O_1, O_2$ be the circumcenters of $\triangle APQ$ and $\triangle CRP$. Prove that $BR = O_1O_2$. [i]Proposed by Atul Shatavart Nadig[/i]

Given a table in a form of the regular $1000$-gon with sidelength $1$. A Beetle initially is in one of its vertices. All $1000$ vertices are numbered in some order by numbers $1$, $2$, $\ldots$, $1000$ so that initially the Beetle is in the vertex $1$. The Beetle can move only along the edges of $1000$-gon and only clockwise. He starts to move from vertex $1$ and he is moving without stops until he reaches vertex $2$ where he has a stop. Then he continues his journey clockwise from vertex $2$ until he reaches the vertex $3$ where he has a stop, and so on. The Beetle finishes his journey at vertex $1000$. Find the number of ways to enumerate all vertices so that the total length of the Beetle's journey is equal to $2017$.

Points $D$ and $E$ are chosen on the exterior of $\vartriangle ABC$ such that $\angle ADC = \angle BEC = 90^o$. If $\angle ACB = 40^o$, $AD = 7$, $CD = 24$, $CE = 15$, and $BE = 20$, what is the measure of $\angle ABC $ in,degrees?

Call arrangement of $m$ number on the circle [b]$m$-negative[/b], if all numbers are equal to $-1$. On the first step Andrew chooses one number on circle and multiplies it by $-1$. All other steps are similar: instead of the next number(clockwise) he writes its product with the number, written on the previous step. Prove that if $n$-negative arrangement in $k$ steps becomes $n$-negative again, then $(2^n - 1)$-negative after $(2^k - 1)$ steps becomes $(2^n - 1)$-negative again.

A quadruple $(a; b; c; d)$ of positive integers with $a \leq b \leq c \leq d$ is called good if we can colour each integer red, blue, green or purple, in such a way that $i$ of each $a$ consecutive integers at least one is coloured red; $ii$ of each $b$ consecutive integers at least one is coloured blue; $iii$ of each $c$ consecutive integers at least one is coloured green; $iiii$ of each $d$ consecutive integers at least one is coloured purple. Determine all good quadruples with $a = 2.$

The following sequence of letters is written on a board: \[ \text{TNOTNOTNO...TNOTN} \] where the sequence repeats 2024 times. At each step, one of the following operations can be performed: 1. Take two different adjacent letters and replace them with two copies of the missing letter. 2. Take three consecutive identical letters and remove them. After a certain number of steps, only two identical letters remain. Determine which letter it is possible to reach.

$p$ parallel lines are drawn in the plane and $q$ lines perpendicular to them are also drawn. How many rectangles are bounded by the lines?

Three points $K, L$ and $M$ are given in the plane. It is known that they are the midpoints of three successive sides of an erased quadrilateral and that these three sides have the same length. Reconstruct the quadrilateral.

Let $ABC$ be a isosceles triangle, with $AB=AC$. A line $r$ that pass through the incenter $I$ of $ABC$ touches the sides $AB$ and $AC$ at the points $D$ and $E$, respectively. Let $F$ and $G$ be points on $BC$ such that $BF=CE$ and $CG=BD$. Show that the angle $\angle FIG$ is constant when we vary the line $r$.

Solve the following system of equations over the real numbers: $2x_1 = x_5 ^2 - 23$ $4x_2 = x_1 ^2 + 7$ $6x_3 = x_2 ^2 + 14$ $8x_4 = x_3 ^2 + 23$ $10x_5 = x_4 ^2 + 34$

Find all triples (p,a,m); p is a prime number, $a,m\in \mathbb{N}$, which satisfy: $a\leq 5p^2$ and $(p-1)!+a=p^m$.

In the figure, $ABC$ and $CDE$ are right-angled and isosceles triangles. Segments $AD$ and $BC$ intersect at $P$, and segments $CD$ and $BE$ intersect at $Q$. (a) Show that segment$ PQ$ is parallel to segment $AE$. (b) If $BP = 4$ and $DQ = 9$, find the measure of segment $BD$. [img]https://cdn.artofproblemsolving.com/attachments/d/3/4c2c7514d71bbac68d58fc6de9ec2649e58957.png[/img]

Points $M$, $N$, $P$ are selected on sides $\overline{AB}$, $\overline{AC}$, $\overline{BC}$, respectively, of triangle $ABC$. Find the area of triangle $MNP$ given that $AM=MB=BP=15$ and $AN=NC=CP=25$. [i]Proposed by Evan Chen[/i]

Let $ABC$ be a triangle, and let $P$ be a point inside it such that $\angle PAC = \angle PBC$. The perpendiculars from $P$ to $BC$ and $CA$ meet these lines at $L$ and $M$, respectively, and $D$ is the midpoint of $AB$. Prove that $DL = DM.$

Given positive integer $n$, find the biggest real number $C$ which satisfy the condition that if the sum of the reciprocals of a set of integers (They can be the same.) that are greater than $1$ is less than $C$, then we can divide the set of numbers into no more than $n$ groups so that the sum of reciprocals of every group is less than $1$.

Let $\Omega$ be the circumcircle of a triangle $ABC$ with $\angle BAC > 90^{\circ}$ and $AB > AC$. The tangents of $\Omega$ at $B$ and $C$ cross at $D$ and the tangent of $\Omega$ at $A$ crosses the line $BC$ at $E$. The line through $D$, parallel to $AE$, crosses the line $BC$ at $F$. The circle with diameter $EF$ meets the line $AB$ at $P$ and $Q$ and the line $AC$ at $X$ and $Y$. Prove that one of the angles $\angle AEB$, $\angle PEQ$, $\angle XEY$ is equal to the sum of the other two.

Let $n$ points $A_1, A_2, \ldots, A_n$, ($n>2$), be considered in the space, where no four points are coplanar. Each pair of points $A_i, A_j$ are connected by an edge. Find the maximal value of $n$ for which we can paint all edges by two colors – blue and red such that the following three conditions hold: [b]I.[/b] Each edge is painted by exactly one color. [b]II.[/b] For $i = 1, 2, \ldots, n$, the number of blue edges with one end $A_i$ does not exceed 4. [b]III.[/b] For every red edge $A_iA_j$, we can find at least one point $A_k$ ($k \neq i, j$) such that the edges $A_iA_k$ and $A_jA_k$ are blue.

Let $[0, 1]$ be the set $\{x \in \mathbb{R} : 0 \leq x \leq 1\}$. Does there exist a continuous function $g : [0, 1] \to [0, 1]$ such that no line intersects the graph of $g$ infinitely many times, but for any positive integer $n$ there is a line intersecting $g$ more than $n$ times? [i]Proposed by Ethan Tan[/i]

Ten distinct points are placed on a circle. All ten of the points are paired so that the line segments connecting the pairs do not intersect. In how many different ways can this pairing be done? [asy] import graph; size(12cm); real labelscalefactor = 0.5; pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); pen dotstyle = black; draw((2.46,0.12)--(3.05,-0.69)); draw((2.46,1.12)--(4,-1)); draw((5.54,0.12)--(4.95,-0.69)); draw((3.05,1.93)--(5.54,1.12)); draw((4.95,1.93)--(4,2.24)); draw((8.05,1.93)--(7.46,1.12)); draw((7.46,0.12)--(8.05,-0.69)); draw((9,2.24)--(9,-1)); draw((9.95,-0.69)--(9.95,1.93)); draw((10.54,1.12)--(10.54,0.12)); draw((15.54,1.12)--(15.54,0.12)); draw((14.95,-0.69)--(12.46,0.12)); draw((13.05,-0.69)--(14,-1)); draw((12.46,1.12)--(14.95,1.93)); draw((14,2.24)--(13.05,1.93)); label("1",(-1.08,2.03),SE*labelscalefactor); label("2",(-0.3,1.7),SE*labelscalefactor); label("3",(0.05,1.15),SE*labelscalefactor); label("4",(0.00,0.38),SE*labelscalefactor); label("5",(-0.33,-0.12),SE*labelscalefactor); label("6",(-1.08,-0.4),SE*labelscalefactor); label("7",(-1.83,-0.19),SE*labelscalefactor); label("8",(-2.32,0.48),SE*labelscalefactor); label("9",(-2.3,1.21),SE*labelscalefactor); label("10",(-1.86,1.75),SE*labelscalefactor); dot((-1,-1),dotstyle); dot((-0.05,-0.69),dotstyle); dot((0.54,0.12),dotstyle); dot((0.54,1.12),dotstyle); dot((-0.05,1.93),dotstyle); dot((-1,2.24),dotstyle); dot((-1.95,1.93),dotstyle); dot((-2.54,1.12),dotstyle); dot((-2.54,0.12),dotstyle); dot((-1.95,-0.69),dotstyle); dot((4,-1),dotstyle); dot((4.95,-0.69),dotstyle); dot((5.54,0.12),dotstyle); dot((5.54,1.12),dotstyle); dot((4.95,1.93),dotstyle); dot((4,2.24),dotstyle); dot((3.05,1.93),dotstyle); dot((2.46,1.12),dotstyle); dot((2.46,0.12),dotstyle); dot((3.05,-0.69),dotstyle); dot((9,-1),dotstyle); dot((9.95,-0.69),dotstyle); dot((10.54,0.12),dotstyle); dot((10.54,1.12),dotstyle); dot((9.95,1.93),dotstyle); dot((9,2.24),dotstyle); dot((8.05,1.93),dotstyle); dot((7.46,1.12),dotstyle); dot((7.46,0.12),dotstyle); dot((8.05,-0.69),dotstyle); dot((14,-1),dotstyle); dot((14.95,-0.69),dotstyle); dot((15.54,0.12),dotstyle); dot((15.54,1.12),dotstyle); dot((14.95,1.93),dotstyle); dot((14,2.24),dotstyle); dot((13.05,1.93),dotstyle); dot((12.46,1.12),dotstyle); dot((12.46,0.12),dotstyle); dot((13.05,-0.69),dotstyle);[/asy]

Let $x$, $y$ and $z$ be positive real numbers such that $xyz = 1$. Prove that $$\left(1+x\right)\left(1+y\right)\left(1+z\right)\geq 2\left(1+\sqrt[3]{\frac{x}{z}}+\sqrt[3]{\frac{y}{x}}+\sqrt[3]{\frac{z}{y}}\right).$$