Twenty cubes have been coloured in the following way: There are two red faces opposite each other, two blue faces opposite each other and two green faces opposite each other. The cubes have been glued together as shown in the figure. Two faces that are glued together always have the same colour. The figure shows the colours of some of the faces. Which colours are possible for the face marked with the symbol $\times$? [img]https://cdn.artofproblemsolving.com/attachments/8/2/6127db5bfdce7a749d730fe3626499582f62ba.png[/img]

There are $n$ matches lying on a table, forming $n$ one-match piles. Adam wants to combine them into a single pile of $n$ matches. He will do this using $n-1$ operations, each of which consists of combining two piles into one. Adam has made a deal with Bartek that every time he combines a pile of $a$ matches with a pile of $b$ matches, he will receive $a\cdot b$ candies from Bartek. What is the greatest number of candies that Adam can receive after performing $n-1$ operations? Justify your answer.

Three ants are at three corners of a rectangle. It is assumed that each ant moves only when the other two are stopped and always parallel to the line defined by them. Will be is it possible that the three ants are simultaneously at midpoints on the sides of the rectangle?

Let $\ell$ and $m$ be two non-coplanar lines in space, and let $P_1$ be a point on $\ell.$ Let $P_2$ be the point on $,m$ closest to $P_1,$ $P_3$ be the point on $\ell$ closest to $P_3,$ $P_4$ be the point on $m$ closest to $P_3,$ and $P_5$ be the point on $\ell$ closest to $P_4.$ Given that $P_1P_2=5, P_2P_3=3,$ and $P_3P_4=2,$ compute $P_4P_5.$

A hexagon $A_1A_2A_3A_4A_5A_6$ has no four concyclic vertices, and its diagonals $A_1A_4$, $A_2A_5$ and $A_3A_6$ concur. Let $l_i $ be the radical axis of circles $A_iA_{i+1}A_{i-2} $ and $A_iA_{i-1}A_{i+2} $ (the points $A_i $ and $A_{i+6} $ coincide). Prove that $l_i, i=1,\cdots,6$, concur.

Given polynomial $P(x) = a_{0}x^{n}+a_{1}x^{n-1}+\dots+a_{n-1}x+a_{n}$. Put $m=\min \{ a_{0}, a_{0}+a_{1}, \dots, a_{0}+a_{1}+\dots+a_{n}\}$. Prove that $P(x) \ge mx^{n}$ for $x \ge 1$. [i]A. Khrabrov [/i]

Prove that if the family of integral curves of the differential equation $$ \frac{dy}{dx} +p(x) y= q(x),$$ where $p(x) q(x) \ne 0$, is cut by the line $x=k$ the tangents at the points of intersection are concurrent.

Start with a positive integer. Double it, subtract $4,$ halve it, then subtract the original integer to get $x.$ What is $x?$

Let $\alpha \leq -2$ be an integer. Prove that for every pair $(\beta_0, \beta_1)$ of integers there exists a uniquely determined sequence $0\leq q_0, \ldots, q_k<\alpha ^ 2 - \alpha$ of integers, such that $q_k\neq 0$ if $(\beta_0, \beta 1)\neq (0,0)$ and $$\beta_i=\sum_{j=0}^k q_j(\alpha - i)^j,\text{ for }i=0,1$$

Let $n \ge 2$ be an integer. There are $n$ houses in a town. All distances between pairs of houses are different. Every house sends a visitor to the house closest to it. Find all possible values of $n$ (with full justification) for which we can design a town with $n$ houses where every house is visited.

Shown is a segment of length $19$, marked with $20$ points dividing the segment into $19$ segments of length $1$. Draw $20$ semicircular arcs, each of whose endpoints are two of the $20$ marked points, satisfying all of the following conditions: [list=1] [*] When the drawing is complete, there will be: [list] [*] $8$ arcs with diameter $1$, [/*] [*] $6$ arcs with diameter $3$, [/*] [*] $4$ arcs with diameter $5$, [/*] [*] $2$ arcs with diameter $7$. [/*] [/list] [/*] [*] Each marked point is the endpoint of exactly two arcs: one above the segment and one below the segment. [/*] [*] No two distinct arcs can intersect except at their endpoints. [/*] [*] No two distinct arcs can connect the same pair of points. (That is, there can be no full circles.) [/*] [/list] Three arcs have already been drawn for you. [asy] size(10cm); draw((0,0)--(19,0)); for(int i=0;i<20;++i){ dot((i,0)); } draw((7,0){down}..{up}(8,0)); draw((12,0){down}..{up}(13,0)); draw((5,0){up}..{down}(10,0)); [/asy]

$\frac{16+8}{4-2}=$ $\text{(A)}\ 4 \qquad \text{(B)}\ 8 \qquad \text{(C)}\ 12 \qquad \text{(D)}\ 16 \qquad \text{(E)}\ 20$

Let $x\neq y$. Two sequences $x,a_1,a_2,a_3,y$ and $b_1,x,b_2,b_3,y,b_4$ are arithmetic sequence. Then $\frac{b_4-b_3}{a_2-a_1}=$________.

Let $n \geq 2$ be an integer. Let $P(x_1, x_2, \ldots, x_n)$ be a nonconstant $n$-variable polynomial with real coefficients. Assume that whenever $r_1, r_2, \ldots , r_n$ are real numbers, at least two of which are equal, we have $P(r_1, r_2, \ldots , r_n) = 0$. Prove that $P(x_1, x_2, \ldots, x_n)$ cannot be written as the sum of fewer than $n!$ monomials. (A monomial is a polynomial of the form $cx^{d_1}_1 x^{d_2}_2\ldots x^{d_n}_n$, where $c$ is a nonzero real number and $d_1$, $d_2$, $\ldots$, $d_n$ are nonnegative integers.) [i]Proposed by Ankan Bhattacharya[/i]

Given a triangle $ABC$, on the side $BC$ which marked the point $E$ such that $BE \ge CE$. Construct on the sides $AB$ and $AC$ the points $D$ and $F$, respectively, such that $\angle DEF = 90 {} ^ \circ$ and the segment $BF$ is bisected by the segment $DE $. (Black Maxim)

The six-digit number $\underline{2}\,\underline{0}\,\underline{2}\,\underline{1}\,\underline{0}\,\underline{A}$ is prime for only one digit $A.$ What is $A?$ $(\textbf{A})\: 1\qquad(\textbf{B}) \: 3\qquad(\textbf{C}) \: 5 \qquad(\textbf{D}) \: 7\qquad(\textbf{E}) \: 9$

For $2k$ real numbers $a_1, a_2, ..., a_k$, $b_1, b_2, ..., b_k$ define a sequence of numbers $X_n$ by \[ X_n = \sum_{i=1}^k [a_in + b_i] \quad (n=1,2,...). \] If the sequence $X_N$ forms an arithmetic progression, show that $\textstyle\sum_{i=1}^k a_i$ must be an integer. Here $[r]$ denotes the greatest integer less than or equal to $r$.

Consider a regular cube with side length $2$. Let $A$ and $B$ be $2$ vertices that are furthest apart. Construct a sequence of points on the surface of the cube $A_1$, $A_2$, $\ldots$, $A_k$ so that $A_1=A$, $A_k=B$ and for any $i = 1,\ldots, k-1$, the distance from $A_i$ to $A_{i+1}$ is $3$. Find the minimum value of $k$.

The integers $a_1,a_2,...,a_{2012}$ are given. Exactly $29$ of them are divisible by $3$. Prove that the sum $a_1^2+a_2^2+...+a_{2012}^2$ is divisible by $3$.

In a village there are only $10$ houses, arranged in a circle of a radius $r$ meters. Each has is the same distance from each of the two closest houses. Every year on Sunday of Pascoa, the village priest makes the Easter visit, leaving the parish house (point $A$) and following the path described in Figure 1. This year the priest decided to take the path represented in the Figure 2. Prove that this year the priest will walk another $10r$ meters. [img]https://cdn.artofproblemsolving.com/attachments/a/9/a6315f4a63f28741ca6fbc75c19a421eb1da06.png[/img]

Let $B'$ and $C'$ be points in the circumcircle of triangle $\triangle ABC$ such that $AB=AB'$ and $AC=AC'$. Let $E$ and $F$ be the foot of altitudes from $B$ and $C$ to $AC$ and $AB$, respectively. Show that $B'E$ and $C'F$ intersect on the circumcircle of triangle $\triangle ABC$.

Twenty cubes of the same size and appearance are made of either aluminum or of heavier duralumin. How can one find the number of duralumin cubes using not more than $11$ weighings on a balance without weights? (We assume that all cubes can be made of aluminum, but not all of duralumin.)

Two planes, $P$ and $Q$, intersect along the line $p$. The point $A$ is given in the plane $P$, and the point $C$ in the plane $Q$; neither of these points lies on the straight line $p$. Construct an isosceles trapezoid $ABCD$ (with $AB \parallel CD$) in which a circle can be inscribed, and with vertices $B$ and $D$ lying in planes $P$ and $Q$ respectively.

Let $n$ be a positive integer and let $k$ be an integer between $1$ and $n$ inclusive. There is a white board of $n \times n$. We do the following process. We draw $k$ rectangles with integer sides lenghts and sides parallel to the ones of the $n \times n$ board, and such that each rectangle covers the top-right corner of the $n \times n$ board. Then, the $k$ rectangles are painted of black. This process leaves a white figure in the board. How many different white figures are possible to do with $k$ rectangles that can't be done with less than $k$ rectangles? Proposed by David Torres Flores

Let $\gamma_1, \gamma_2, \gamma_3$ be mutually externally tangent circles and $\Gamma_1, \Gamma_2, \Gamma_3$ also be mutually externally tangent circles. For each $1 \le i \le 3$, $\gamma_i$ and $\Gamma_{i+1}$ are externally tangent at $A_i$, $\gamma_i$ and $\Gamma_{i+2}$ are externally tangent at $B_i$, and $\gamma_i$ and $\Gamma_i$ do not meet. Show that the six points $A_1, A_2, A_3, B_1, B_2, B_3$ lie on either a line or a circle.