A $ 9 \times 12$ rectangle is partitioned into unit squares. The centers of all the unit squares, except for the four corner squares and eight squares sharing a common side with one of them, are coloured red. Is it possible to label these red centres $ C_1,C_2,\ldots ,C_{96}$ in such way that the following to conditions are both fulfilled i) the distances $C_1C_2,\ldots ,C_{95}C_{96}, C_{96}C_{1}$ are all equal to $ \sqrt {13}$, ii) the closed broken line $ C_1C_2\ldots C_{96}C_1$ has a centre of symmetry? [i]Bulgaria[/i]

An octomino is made by joining $8$ congruent squares edge to edge. Three examples are shown below. How many octominoes have at least $2$ lines of symmetry? [asy] size(8cm,0); filldraw((0,1)--(0,2)--(1,2)--(1,1)--cycle,grey); filldraw((0,2)--(0,3)--(1,3)--(1,2)--cycle,grey); filldraw((0,3)--(0,4)--(1,4)--(1,3)--cycle,grey); filldraw((1,0)--(1,1)--(2,1)--(2,0)--cycle,grey); filldraw((1,1)--(1,2)--(2,2)--(2,1)--cycle,grey); filldraw((1,2)--(1,3)--(2,3)--(2,2)--cycle,grey); filldraw((1,3)--(1,4)--(2,4)--(2,3)--cycle,grey); filldraw((2,2)--(2,3)--(3,3)--(3,2)--cycle,grey); filldraw((4,0)--(4,1)--(5,1)--(5,0)--cycle,grey); filldraw((4,1)--(4,2)--(5,2)--(5,1)--cycle,grey); filldraw((4,2)--(4,3)--(5,3)--(5,2)--cycle,grey); filldraw((4,3)--(4,4)--(5,4)--(5,3)--cycle,grey); filldraw((5,1)--(5,2)--(6,2)--(6,1)--cycle,grey); filldraw((5,3)--(5,4)--(6,4)--(6,3)--cycle,grey); filldraw((6,2)--(6,3)--(7,3)--(7,2)--cycle,grey); filldraw((6,3)--(6,4)--(7,4)--(7,3)--cycle,grey); filldraw((8,3)--(8,4)--(9,4)--(9,3)--cycle,grey); filldraw((9,3)--(9,4)--(10,4)--(10,3)--cycle,grey); filldraw((10,3)--(10,4)--(11,4)--(11,3)--cycle,grey); filldraw((11,2)--(11,3)--(12,3)--(12,2)--cycle,grey); filldraw((11,3)--(11,4)--(12,4)--(12,3)--cycle,grey); filldraw((12,2)--(12,3)--(13,3)--(13,2)--cycle,grey); filldraw((12,3)--(12,4)--(13,4)--(13,3)--cycle,grey); filldraw((13,3)--(13,4)--(14,4)--(14,3)--cycle,grey); [/asy]

On every card of a deck of cards a regular 17-gon is displayed with all sides and diagonals, and the vertices are numbered from 1 through 17. On every card all edges (sides and diagonals) are colored with a color 1,2,...,105 such that the following property holds: for every 15 vertices of the 17-gon the 105 edges connecting these vertices are colored with different colors on at least one of the cards. What is the minimum number of cards in the deck?

Find the sum of all the digits in the decimal representations of all the positive integers less than $1000.$

Let $ABC$ be an acute scalene triangle with $O$ as its circumcenter. Point $P$ lies inside triangle $ABC$ with $\angle PAB = \angle PBC$ and $\angle PAC = \angle PCB$. Point $Q$ lies on line $BC$ with $QA = QP$. Prove that $\angle AQP = 2\angle OQB$.

Each vertex of convex pentagon $ABCDE$ is to be assigned a color. There are $6$ colors to choose from, and the ends of each diagonal must have different colors. How many different colorings are possible? $ \textbf{(A)}\ 2520\qquad\textbf{(B)}\ 2880\qquad\textbf{(C)}\ 3120\qquad\textbf{(D)}\ 3250\qquad\textbf{(E)}\ 3750 $

Let $ABC$ be a triangle inscribed in a circle of center $O$ and radius $R$. Let $I$ be the incenter of $ABC$, and let $r$ be the inradius of the same triangle, $O\neq I$, and let $G$ be its centroid. Prove that $IG\perp BC$ if and only if $b=c$ or $b+c=3a$.

Triangle $ABC$ is inscribed in circle $\Omega$. The interior angle bisector of angle $A$ intersects side $BC$ and $\Omega$ at $D$ and $L$ (other than $A$), respectively. Let $M$ be the midpoint of side $BC$. The circumcircle of triangle $ADM$ intersects sides $AB$ and $AC$ again at $Q$ and $P$ (other than $A$), respectively. Let $N$ be the midpoint of segment $PQ$, and let $H$ be the foot of the perpendicular from $L$ to line $ND$. Prove that line $ML$ is tangent to the circumcircle of triangle $HMN$.

Let $O$ be the circumcenter and $H$ the orthocenter of an acute-angled triangle $ABC$ such that $BC>CA$. Let $F$ be the foot of the altitude $CH$ of triangle $ABC$. The perpendicular to the line $OF$ at the point $F$ intersects the line $AC$ at $P$. Prove that $\measuredangle FHP=\measuredangle BAC$.

How many of the twelve pentominoes pictured below have at least one line of symmetry? $ \textbf{(A)}\ 3 \qquad \textbf{(B)}\ 4 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 6 \qquad \textbf{(E)}\ 7$ [asy]unitsize(5mm); defaultpen(linewidth(1pt)); draw(shift(2,0)*unitsquare); draw(shift(2,1)*unitsquare); draw(shift(2,2)*unitsquare); draw(shift(1,2)*unitsquare); draw(shift(0,2)*unitsquare); draw(shift(2,4)*unitsquare); draw(shift(2,5)*unitsquare); draw(shift(2,6)*unitsquare); draw(shift(1,5)*unitsquare); draw(shift(0,5)*unitsquare); draw(shift(4,8)*unitsquare); draw(shift(3,8)*unitsquare); draw(shift(2,8)*unitsquare); draw(shift(1,8)*unitsquare); draw(shift(0,8)*unitsquare); draw(shift(6,8)*unitsquare); draw(shift(7,8)*unitsquare); draw(shift(8,8)*unitsquare); draw(shift(9,8)*unitsquare); draw(shift(9,9)*unitsquare); draw(shift(6,5)*unitsquare); draw(shift(7,5)*unitsquare); draw(shift(8,5)*unitsquare); draw(shift(7,6)*unitsquare); draw(shift(7,4)*unitsquare); draw(shift(6,1)*unitsquare); draw(shift(7,1)*unitsquare); draw(shift(8,1)*unitsquare); draw(shift(6,0)*unitsquare); draw(shift(7,2)*unitsquare); draw(shift(11,8)*unitsquare); draw(shift(12,8)*unitsquare); draw(shift(13,8)*unitsquare); draw(shift(14,8)*unitsquare); draw(shift(13,9)*unitsquare); draw(shift(11,5)*unitsquare); draw(shift(12,5)*unitsquare); draw(shift(13,5)*unitsquare); draw(shift(11,6)*unitsquare); draw(shift(13,4)*unitsquare); draw(shift(11,1)*unitsquare); draw(shift(12,1)*unitsquare); draw(shift(13,1)*unitsquare); draw(shift(13,2)*unitsquare); draw(shift(14,2)*unitsquare); draw(shift(16,8)*unitsquare); draw(shift(17,8)*unitsquare); draw(shift(18,8)*unitsquare); draw(shift(17,9)*unitsquare); draw(shift(18,9)*unitsquare); draw(shift(16,5)*unitsquare); draw(shift(17,6)*unitsquare); draw(shift(18,5)*unitsquare); draw(shift(16,6)*unitsquare); draw(shift(18,6)*unitsquare); draw(shift(16,0)*unitsquare); draw(shift(17,0)*unitsquare); draw(shift(17,1)*unitsquare); draw(shift(18,1)*unitsquare); draw(shift(18,2)*unitsquare);[/asy]

If $y+4 = (x-2)^2, x+4 = (y-2)^2$, and $x \neq y$, what is the value of $x^2+y^2$? $ \textbf{(A) }10\qquad\textbf{(B) }15\qquad\textbf{(C) }20\qquad\textbf{(D) }25\qquad\textbf{(E) }\text{30} $

The cyclic octagon $ABCDEFGH$ has sides $a,a,a,a,b,b,b,b$ respectively. Find the radius of the circle that circumscribes $ABCDEFGH.$

A circle with center $O$ is tangent to the sides of the angle with the vertex $A$ at the points B and C. Let M be a point on the larger of the two arcs $BC$ of this circle (different from $B$ and $C$) such that $M$ does not lie on the line $AO$. Lines $BM$ and $CM$ intersect the line $AO$ at the points $P$ and $Q$ respectively. Let $K$ be the foot of the perpendicular drawn from $P$ to $AC$ and $L$ be the foot of the perpendicular drawn from $Q$ to $AB$. Prove that the lines $OM$ and $KL$ are perpendicular.

At the vertices of a regular hexagon are written six nonnegative integers whose sum is $2003^{2003}$. Bert is allowed to make moves of the following form: he may pick a vertex and replace the number written there by the absolute value of the difference between the numbers written at the two neighboring vertices. Prove that Bert can make a sequence of moves, after which the number 0 appears at all six vertices.

The points $A_1,B_1,C_1$ lie on the sides $BC,CA$ and $AB$ of the triangle $ABC$ respectively. Suppose that $AB_1-AC_1=CA_1-CB_1=BC_1-BA_1$. Let $O_A,O_B$ and $O_C$ be the circumcentres of triangles $AB_1C_1,A_1BC_1$ and $A_1B_1C$ respectively. Prove that the incentre of triangle $O_AO_BO_C$ is the incentre of triangle $ABC$ too.

Given is an acute triangle $ ABC$ and the points $ A_1,B_1,C_1$, that are the feet of its altitudes from $ A,B,C$ respectively. A circle passes through $ A_1$ and $ B_1$ and touches the smaller arc $ AB$ of the circumcircle of $ ABC$ in point $ C_2$. Points $ A_2$ and $ B_2$ are defined analogously. Prove that the lines $ A_1A_2$, $ B_1B_2$, $ C_1C_2$ have a common point, which lies on the Euler line of $ ABC$.

Let $P(A)$ be the arithmetic-means of all elements of set $A = \{ a_1, a_2, \ldots, a_n \}$, namely $P(A) = \frac{1}{n} \sum^{n}_{i=1}a_i$. We denote $B$ "balanced subset" of $A$, if $B$ is a non-empty subset of $A$ and $P(B) = P(A)$. Let set $M = \{ 1, 2, 3, 4, 5, 6, 7, 8, 9 \}$. Find the number of all "balanced subset" of $M$.

Let $ ABCD$ be an isosceles trapezium. Determine the geometric location of all points $ P$ such that \[ |PA| \cdot |PC| \equal{} |PB| \cdot |PD|.\]

Let $w$-circumcircle of triangle $ABC$ with an obtuse angle $C$ and $C '$symmetric point of point $C$ with respect to $AB$. $M$ midpoint of $AB$. $C'M$ intersects $w$ at $N$ ($C '$ between $M$ and $N$). Let $BC'$ second crossing point $w$ in $F$, and $AC'$ again crosses the $w$ at point $E$. $K$-midpoint $EF$. Prove that the lines $AB, CN$ and$ KC'$are concurrent.

Point $C_{1}$ of hypothenuse $AC$ of a right-angled triangle $ABC$ is such that $BC = CC_{1}$. Point $C_{2}$ on cathetus $AB$ is such that $AC_{2} = AC_{1}$; point $A_{2}$ is defined similarly. Find angle $AMC$, where $M$ is the midpoint of $A_{2}C_{2}$.

Given an equilateral triangle $ABC$ and a point $M$ in the plane ($ABC$). Let $A', B', C'$ be respectively the symmetric through $M$ of $A, B, C$. [b]I.[/b] Prove that there exists a unique point $P$ equidistant from $A$ and $B'$, from $B$ and $C'$ and from $C$ and $A'$. [b]II.[/b] Let $D$ be the midpoint of the side $AB$. When $M$ varies ($M$ does not coincide with $D$), prove that the circumcircle of triangle $MNP$ ($N$ is the intersection of the line $DM$ and $AP$) pass through a fixed point.

Lisa and Bart are playing a game. A round table has $n$ lights evenly spaced around its circumference. Some of the lights are on and some of them off; the initial configuration is random. Lisa wins if she can get all of the lights turned on; Bart wins if he can prevent this from happening. On each turn, Lisa chooses the positions at which to flip the lights, but before the lights are flipped, Bart, knowing Lisa’s choices, can rotate the table to any position that he chooses (or he can leave the table as is). Then the lights in the positions that Lisa chose are flipped: those that are off are turned on and those that are on are turned off. Here is an example turn for $n = 5$ (a white circle indicates a light that is on, and a black circle indicates a light that is off): [asy] size(250); defaultpen(linewidth(1)); picture p = new picture; real r = 0.2; pair s1=(0,-4), s2=(0,-8); int[][] filled = {{1,2,3},{1,2,5},{2,3,4,5}}; draw(p,circle((0,0),1)); for(int i = 0; i < 5; ++i) { pair P = dir(90-72*i); filldraw(p,circle(P,r),white); label(p,string(i+1),P,2*P,fontsize(10)); } add(p); add(shift(s1)*p); add(shift(s2)*p); for(int j = 0; j < 3; ++j) for(int i = 0; i < filled[j].length; ++i) filldraw(circle(dir(90-72*(filled[j][i]-1))+j*s1,r)); label("$\parbox{15em}{Initial Position.}$", (-4.5,0)); label("$\parbox{15em}{Lisa says ``1,3,4.'' \\ Bart rotates the table one \\ position counterclockwise. }$", (-4.5,0)+s1); label("$\parbox{15em}{Lights in positions 1,3,4 are \\ flipped.}$", (-4.5,0)+s2);[/asy] Lisa can take as many turns as she needs to win, or she can give up if it becomes clear to her that Bart can prevent her from winning. (a) Show that if $n = 7$ and initially at least one light is on and at least one light is off, then Bart can always prevent Lisa from winning. (b) Show that if $n = 8$, then Lisa can always win in at most 8 turns.

I have $8$ unit cubes of different colors, which I want to glue together into a $2\times 2\times 2$ cube. How many distinct $2\times 2\times 2$ cubes can I make? Rotations of the same cube are not considered distinct, but reflections are.

Given an equilateral triangle $ABC$ and a point $M$ in the plane ($ABC$). Let $A', B', C'$ be respectively the symmetric through $M$ of $A, B, C$. [b]I.[/b] Prove that there exists a unique point $P$ equidistant from $A$ and $B'$, from $B$ and $C'$ and from $C$ and $A'$. [b]II.[/b] Let $D$ be the midpoint of the side $AB$. When $M$ varies ($M$ does not coincide with $D$), prove that the circumcircle of triangle $MNP$ ($N$ is the intersection of the line $DM$ and $AP$) pass through a fixed point.

Let $M$ be a set of points in a plane with at least two elements. Prove that if $M$ has two axes of symmetry $g_1$ and $g_2$ intersecting at an angle $\alpha = q\pi$, where $q$ is irrational, then $M$ must be infinite.