Rectangles $BCC_1B_2,$ $CAA_1C_2,$ and $ABB_1A_2$ are erected outside an acute triangle $ABC.$ Suppose that \[\angle BC_1C+\angle CA_1A+\angle AB_1B=180^{\circ}.\] Prove that lines $B_1C_2,$ $C_1A_2,$ and $A_1B_2$ are concurrent.

To complete the grid below, each of the digits 1 through 4 must occur once in each row and once in each column. What number will occupy the lower right-hand square? \[ \begin{tabular}{|c|c|c|c|}\hline 1 & & 2 & \\ \hline 2 & 3 & & \\ \hline & &&4\\ \hline & &&\\ \hline\end{tabular} \] $\textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3\qquad \textbf{(D)}\ 4\qquad \textbf{(E)}\ \text{cannot be determined}$

Let $\mathbb X$ be the set of all bijective functions from the set $S=\{1,2,\cdots, n\}$ to itself. For each $f\in \mathbb X,$ define \[T_f(j)=\left\{\begin{aligned} 1, \ \ \ & \text{if} \ \ f^{(12)}(j)=j,\\ 0, \ \ \ & \text{otherwise}\end{aligned}\right.\] Determine $\sum_{f\in\mathbb X}\sum_{j=1}^nT_{f}(j).$ (Here $f^{(k)}(x)=f(f^{(k-1)}(x))$ for all $k\geq 2.$)

Let $p$ and $a$ be positive integer numbers having no common divisors except of $1$. Prove that $p$ is prime if and only if all the coefficients of the polynomial \[ F(x) = (x-a)^p - (x^p - a) \] are divisible by $p$.

Let $k$ be a fixed natural number. In the infinite number of real line, each integer is colored with color ..., red, green, blue, red, green, blue, ... and so on. A number of flea settles at first at integer points. On each turn, a flea will jump over the other tick so that the distance $k$ is the original distance. Formally, we may choose $2$ tails $A, B$ that are spaced $n$ and move $A$ to the different side of $B$ so the current distance is $kn$. Some fleas may occupy the same point because we consider the size of fleas very small. Determine all the values of $k$ so that, whatever the initial position of the ticks, we always get a position where all ticks land on the same color.

Find the real numbers $ x, y, z $ satisfying the system of equations $$(z - x)(x - y) = a $$ $$(x - y)(y - z) = b$$ $$(y - z)(z - x) = c$$ where $ a, b, c $ are given real numbers.

Find all functions $f: R \to R$ such that, for any $x, y \in R$: $f\left( f\left( x \right)-y \right)\cdot f\left( x+f\left( y \right) \right)={{x}^{2}}-{{y}^{2}}$

The acronym AMC is shown in the rectangular grid below with grid lines spaced $1$ unit apart. In units, what is the sum of the lengths of the line segments that form the acronym AMC$?$ [asy] import olympiad; unitsize(25); for (int i = 0; i < 3; ++i) { for (int j = 0; j < 9; ++j) { pair A = (j,i); } } for (int i = 0; i < 3; ++i) { for (int j = 0; j < 9; ++j) { if (j != 8) { draw((j,i)--(j+1,i), gray(0.6)+dashed); } if (i != 2) { draw((j,i)--(j,i+1), gray(0.6)+dashed); } } } draw((0,0)--(2,2),linewidth(2)); draw((2,0)--(2,2),linewidth(2)); draw((1,1)--(2,1),linewidth(2)); draw((3,0)--(3,2),linewidth(2)); draw((5,0)--(5,2),linewidth(2)); draw((4,1)--(3,2),linewidth(2)); draw((4,1)--(5,2),linewidth(2)); draw((6,0)--(8,0),linewidth(2)); draw((6,2)--(8,2),linewidth(2)); draw((6,0)--(6,2),linewidth(2)); [/asy] $\textbf{(A) } 17 \qquad \textbf{(B) } 15 + 2\sqrt{2} \qquad \textbf{(C) } 13 + 4\sqrt{2} \qquad \textbf{(D) } 11 + 6\sqrt{2} \qquad \textbf{(E) } 21$

Let $ n $ be a natural number. How many numbers of the form $ \pm 1\pm 2\pm 3\pm\cdots\pm n $ are there?

It is known that a square can be inscribed in a given right trapezoid so that each of its vertices lies on the corresponding side of the trapezoid (none of the vertices of the square coincides with the vertex of the trapezoid). Construct this inscribed square with a compass and a ruler. (Maria Rozhkova)

Two distinct 2-digit prime numbers $p,q$ can be written one after the other in 2 different ways to form two 4-digit numbers. For example, 11 and 13 yield 1113 and 1311. If the two 4-digit numbers formed are both divisible by the average value of $p$ and $q$, find all possible pairs $\{p,q\}$.

Let $ \mathcal{R}$ be the region consisting of the set of points in the coordinate plane that satisfy both $ |8 \minus{} x| \plus{} y \le 10$ and $ 3y \minus{} x \ge 15$. When $ \mathcal{R}$ is revolved around the line whose equation is $ 3y \minus{} x \equal{} 15$, the volume of the resulting solid is $ \frac {m\pi}{n\sqrt {p}}$, where $ m$, $ n$, and $ p$ are positive integers, $ m$ and $ n$ are relatively prime, and $ p$ is not divisible by the square of any prime. Find $ m \plus{} n \plus{} p$.

When $ \left ( 1 \minus{} \frac{1}{a} \right ) ^6$ is expanded the sum of the last three coefficients is: $ \textbf{(A)}\ 22 \qquad \textbf{(B)}\ 11 \qquad \textbf{(C)}\ 10 \qquad \textbf{(D)}\ \minus{}10 \qquad \textbf{(E)}\ \minus{}11$

A number $N$ has 2009 positive factors. What is the maximum number of positive factors that $N^2$ could have?

A square $ABCD$ lies in the coordinate plane with its vertices $A$ and $C$ lying on different coordinate axes. Prove that one of the vertices $B$ or $D$ lies on the line $y = x$ and the other one on $y = -x$.

The sequence ($a_n$) of natural numbers is defined by $a_1 = 2$ and $a_{n+1}$ equals the sum of tenth powers of the decimal digits of $a_n$ for all $n \ge 1$. Are there numbers which appear twice in the sequence ($a_n$)?

Let $ ABC$ be a triangle inscribed in a circle of radius $ R$, and let $ P$ be a point in the interior of triangle $ ABC$. Prove that \[ \frac {PA}{BC^{2}} \plus{} \frac {PB}{CA^{2}} \plus{} \frac {PC}{AB^{2}}\ge \frac {1}{R}. \] [i]Alternative formulation:[/i] If $ ABC$ is a triangle with sidelengths $ BC\equal{}a$, $ CA\equal{}b$, $ AB\equal{}c$ and circumradius $ R$, and $ P$ is a point inside the triangle $ ABC$, then prove that $ \frac {PA}{a^{2}} \plus{} \frac {PB}{b^{2}} \plus{} \frac {PC}{c^{2}}\ge \frac {1}{R}$.

Let $ABC$ be a triangle inscribed in the circle $(O)$ and $P$ is a point inside the triangle $ABC$. Let $D$ be a point on $(O)$ such that $AD \perp AP$. The line $CD$ cuts the perpendicular bisector of $BC$ at $M$. The line $AD$ cuts the line passing through $B$ and is perpendicular to $BP$ at $Q$. Let $N$ be the reflection of $Q$ through $M$. Prove that $CN \perp CP$.

Let $u_1, u_2, \dots, u_{2019}$ be real numbers satisfying \[u_{1}+u_{2}+\cdots+u_{2019}=0 \quad \text { and } \quad u_{1}^{2}+u_{2}^{2}+\cdots+u_{2019}^{2}=1.\] Let $a=\min \left(u_{1}, u_{2}, \ldots, u_{2019}\right)$ and $b=\max \left(u_{1}, u_{2}, \ldots, u_{2019}\right)$. Prove that \[ a b \leqslant-\frac{1}{2019}. \]

There is a rhombus with acute angle $b$ and side $a$. Two parallel lines, the distance between which is equal to the height of the rhombus, intersect all four sides of the rhombus. What can be the sum of the perimeters of two triangles cut off from a rhombus by straight lines? (These two triangles lie outside the strip between parallel lines.)

The picture shows a triangle divided into $25$ smaller triangles, numbered $1$ to $25$. Is it possible to place the same numbers in the square cells 5$\times 5$ so that any two numbers written in adjacent triangles were are also written in adjacent cells of the square? (The cells of a square are considered adjacent if they have a common side.) [img]https://cdn.artofproblemsolving.com/attachments/4/3/758fe5531ab3e576ef4712c095b393f8dff397.png[/img]

Let $ a_1\equal{}a_2\equal{}1$ and \[ a_{n\plus{}2}\equal{}\frac{n(n\plus{}1)a_{n\plus{}1}\plus{}n^2a_n\plus{}5}{n\plus{}2}\minus{}2\]for each $ n\in\mathbb N$. Find all $ n$ such that $ a_n\in\mathbb N$.

In a row the numbers $1,2,...,2010$ have been written. Two players, taking turns, write $+$ or $\times$ between two consecutive numbers whenever possible. The first player wins if the algebraic sum obtained is divisible by $3$; otherwise, the second player wins. Find a winning strategy for one of the players.

Find all the real numbers $x$ such that $\frac{1}{[x]}+\frac{1}{[2x]}=\{x\}+\frac{1}{3}$ where $[x]$ denotes the integer part of $x$ and $\{x\}=x-[x]$. For example, $[2.5]=2, \{2.5\} = 0.5$ and $[-1.7]= -2, \{-1.7\} = 0.3$

For $i = 1,2, \ldots, 1991$, we choose $n_i$ points and write number $i$ on them (each point has only written one number on it). A set of chords are drawn such that: (i) They are pairwise non-intersecting. (ii) The endpoints of each chord have distinct numbers. If for all possible assignments of numbers the operation can always be done, find the necessary and sufficient condition the numbers $n_1, n_2, \ldots, n_{1991}$ must satisfy for this to be possible.