The game of circulate is played with a deck of $kn$ cards each with a number in $1,2,\ldots,n$ such that there are $k$ cards with each number. First, $n$ piles numbered $1,2,\ldots,n$ of $k$ cards each are dealt out face down. The player then flips over a card from pile $1$, places that card face up at the bottom of the pile, then next flips over a card from the pile whose number matches the number on the card just flipped. The player repeats this until he reaches a pile in which every card has already been flipped and wins if at that point every card has been flipped. Hamster has grown tired of losing every time, so he decides to cheat. He looks at the piles beforehand and rearranges the $k$ cards in each pile as he pleases. When can Hamster perform this procedure such that he will win the game? [i]Brian Hamrick.[/i]

What is the minimum number of small squares that must be colored black so that a line of symmetry lies on the diagonal $ \overline{BD}$ of square $ ABCD$? [asy]defaultpen(linewidth(1)); for ( int x = 0; x < 5; ++x ) { draw((0,x)--(4,x)); draw((x,0)--(x,4)); } fill((1,0)--(2,0)--(2,1)--(1,1)--cycle); fill((0,3)--(1,3)--(1,4)--(0,4)--cycle); fill((2,3)--(4,3)--(4,4)--(2,4)--cycle); fill((3,1)--(4,1)--(4,2)--(3,2)--cycle); label("$A$", (0, 4), NW); label("$B$", (4, 4), NE); label("$C$", (4, 0), SE); label("$D$", (0, 0), SW);[/asy] $ \textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D)}\ 4\qquad\textbf{(E)}\ 5 $

Let $ S_k $ be the symmetry of the plane with respect to the line $ k $. Prove that equality holds for every lines $ a, b, c $ contained in one plane $$ S_aS_bS_cS_aS_bS_cS_bS_cS_aS_bS_cS_a = S_bS_cS_aS_bS_cS_aS_aS_bS_cS_aS_bS_c$$

$30$ same balls are put into four boxes $ A$, $ B$, $ C$, $ D$ in such a way that sum of number of balls in $ A$ and $ B$ is greater than sum of in $ C$ and $ D$. How many possible ways are there? $\textbf{(A)}\ 2472 \qquad\textbf{(B)}\ 2600 \qquad\textbf{(C)}\ 2728 \qquad\textbf{(D)}\ 2856 \qquad\textbf{(E)}\ \text{None}$

(F.Nilov, A.Zaslavsky) Let $ CC_0$ be a median of triangle $ ABC$; the perpendicular bisectors to $ AC$ and $ BC$ intersect $ CC_0$ in points $ A'$, $ B'$; $ C_1$ is the meet of lines $ AA'$ and $ BB'$. Prove that $ \angle C_1CA \equal{} \angle C_0CB$.

[asy] draw((0,0)--(0,1)--(2,1)--(2,0)--cycle^^(.5,1)--(.5,2)--(1.5,2)--(1.5,1)--(.5,2)^^(.5,1)--(1.5,2)^^(1,2)--(1,0)); //Credit to Zimbalono for the diagram[/asy] The radius of the smallest circle containing the symmetric figure composed of the $3$ unit squares shown above is $\textbf{(A) }\sqrt{2}\qquad\textbf{(B) }\sqrt{1.25}\qquad\textbf{(C) }1.25\qquad\textbf{(D) }\frac{5\sqrt{17}}{16}\qquad \textbf{(E) }\text{None of these}$

[asy]pair A=(-2,0), O=origin, C=(2,0); path X=Arc(O,2,0,180), Y=Arc((-1,0),1,180,0), Z=Arc((1,0),1,180,0), N=X..Y..Z..cycle; filldraw(N, black, black); draw(reflect(A,C)*N); draw(A--C, dashed); label("A",A,W); label("C",C,E); label("O",O,SE); dot((-1,0)); dot(O); dot((1,0)); label("1",(-1,0),NE); label("1",(1,0),NW);[/asy] The large circle has diameter $ \overline{AC}$. The two small circles have their centers on $ \overline{AC}$ and just touch at $ O$, the center of the large circle. If each small circle has radius $ 1$, what is the value of the ratio of the area of the shaded region to the area of one of the small circles? \[ \textbf{(A)}\ \text{between }\frac{1}{2} \text{ and }1 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ \text{between 1 and }\frac{3}{2} \qquad \textbf{(D)}\ \text{between }\frac{3}{2} \text{ and }2 \\ \textbf{(E)}\ \text{cannot be determined from the information given} \]

Suppose that Romeo and Juliet each have a regular tetrahedron to the vertices of which some positive real numbers are assigned. They associate each edge of their tetrahedra with the product of the two numbers assigned to its end points. Then they write on each face of their tetrahedra the sum of the three numbers associated to its three edges. The four numbers written on the faces of Romeo's tetrahedron turn out to coincide with the four numbers written on Juliet's tetrahedron. Does it follow that the four numbers assigned to the vertices of Romeo's tetrahedron are identical to the four numbers assigned to the vertices of Juliet's tetrahedron?

A [i]word[/i] is defined as any finite string of letters. A word is a [i]palindrome[/i] if it reads the same backwards and forwards. Let a sequence of words $W_0, W_1, W_2,...$ be defined as follows: $W_0 = a, W_1 = b$, and for $n \ge 2$, $W_n$ is the word formed by writing $W_{n-2}$ followed by $W_{n-1}$. Prove that for any $n \ge 1$, the word formed by writing $W_1, W_2, W_3,..., W_n$ in succession is a palindrome.

Let $ABC$ be a triangle with $AB=AC$ and let $D$ be the midpoint of $AC$. The angle bisector of $\angle BAC$ intersects the circle through $D,B$ and $C$ at the point $E$ inside the triangle $ABC$. The line $BD$ intersects the circle through $A,E$ and $B$ in two points $B$ and $F$. The lines $AF$ and $BE$ meet at a point $I$, and the lines $CI$ and $BD$ meet at a point $K$. Show that $I$ is the incentre of triangle $KAB$. [i]Proposed by Jan Vonk, Belgium and Hojoo Lee, South Korea[/i]

The vertices $A,B,C$ and $D$ of a square lie outside a circle centred at $M$. Let $AA',BB',CC',DD'$ be tangents to the circle. Assume that the segments $AA',BB',CC',DD'$ are the consecutive sides of a quadrilateral $p$ in which a circle is inscribed. Prove that $p$ has an axis of symmetry.

Seven teams play a soccer tournament in which each team plays every other team exactly once. No ties occur, each team has a $50\%$ chance of winning each game it plays, and the outcomes of the games are independent. In each game, the winner is awarded a point and the loser gets 0 points. The total points are accumilated to decide the ranks of the teams. In the first game of the tournament, team $A$ beats team $B$. The probability that team $A$ finishes with more points than team $B$ is $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Given a right triangle $ABC$ with the hypotenuse $AB$. Let $K$ be any interior point of triangle $ABC$ and points $L, M$ are symmetric of point $K$ wrt lines $BC, AC$ respectively. Specify all possible values for $S_{ABLM} / S_{ABC}$, where $S_{XY ... Z}$ indicates the area of the polygon $XY...Z$ .

Which of the following has the greatest number of line of symmetry? $ \textbf{(A)}\ \text{ Equilateral Triangle}$ $\textbf{(B)}\ \text{Non-square rhombus} $ $\textbf{(C)}\ \text{Non-square rectangle}$ $\textbf{(D)}\ \text{Isosceles Triangle}$ $\textbf{(E)}\ \text{Square} $

Is it true that any two rectangles of equal area can be placed in the plane such that any horizontal line intersecting at least one of them will also intersect the other, and the segments of intersection will be equal?

Find the area of the figure bounded by two curves $y=x^4,\ y=x^2+2$.

Draw the smaller number of line segments connecting points of the figure such that the new figure obtained to have exactly: [img]https://cdn.artofproblemsolving.com/attachments/d/1/098e03714904573a1eacd2d3dc28b4e8c42c7c.png[/img] i) one axis of symmetry ii) two axes of symmetry iii) four axes of symmetry Draw a new figure, at each case.

Cyclic pentagon $ ABCDE$ has side lengths $ AB\equal{}BC\equal{}5$, $ CD\equal{}DE\equal{}12$, and $ AE \equal{} 14$. Determine the radius of its circumcircle.

Let $a, b, c$ be real numbers such that $a+b+c > 0$, $ab+bc+ca > 0$, $abc > 0$. Show that $a, b, c$ are all positive.

Inside the circle are given three points that do not belong to one line. In one step it is allowed to replace one of the points with a symmetric one wrt the line containing the other two points. Is it always possible for a finite number of these steps to ensure that all three points are outside the circle?

Let $\omega$ be the circumcircle of a triangle $ABC$. Denote by $M$ and $N$ the midpoints of the sides $AB$ and $AC$, respectively, and denote by $T$ the midpoint of the arc $BC$ of $\omega$ not containing $A$. The circumcircles of the triangles $AMT$ and $ANT$ intersect the perpendicular bisectors of $AC$ and $AB$ at points $X$ and $Y$, respectively; assume that $X$ and $Y$ lie inside the triangle $ABC$. The lines $MN$ and $XY$ intersect at $K$. Prove that $KA=KT$.

Let $O_1$ and $O_2$ be concentric circles with radii 4 and 6, respectively. A chord $AB$ is drawn in $O_1$ with length $2$. Extend $AB$ to intersect $O_2$ in points $C$ and $D$. Find $CD$.

An angle $x$ is chosen at random from the interval $0^\circ < x < 90^\circ$. Let $p$ be the probability that the numbers $\sin^2 x$, $\cos^2 x$, and $\sin x \cos x$ are not the lengths of the sides of a triangle. Given that $p = d/n$, where $d$ is the number of degrees in $\arctan m$ and $m$ and $n$ are positive integers with $m + n < 1000$, find $m + n$.

We call a pentagon [i]distinguished [/i] if either all side lengths or all angles are equal. We call it [i]very distinguished[/i] if in addition two of the other parts are equal. i.e. $5$ sides and $2$ angles or $2$ sides and $5$ angles.Show that every very distinguished pentagon has an axis of symmetry.

Let $a,b$ be two positive integers, such that $ab\neq 1$. Find all the integer values that $f(a,b)$ can take, where \[ f(a,b) = \frac { a^2+ab+b^2} { ab- 1} . \]