Suppose that a finite group has exactly $ n$ elements of order $ p,$ where $ p$ is a prime. Prove that either $ n\equal{}0$ or $ p$ divides $ n\plus{}1.$

Find all values of positive integers $a$ and $b$ such that it is possible to put $a$ ones and $b$ zeros in every of vertices in polygon with $a+b$ sides so it is possible to rotate numbers in those vertices with respect to primary position and after rotation one neighboring $0$ and $1$ switch places and in every other vertices other than those two numbers remain the same.

Let $ABCDA'B'C'D'$ be a cube (where $ABCD$ is a square and $AA'\parallel BB'\parallel CC'\parallel DD'$). Furthermore, let $\mathcal R$ be a rotation (with respect some line) that maps vertex $A$ to $B.$ Find the set of all images $X=\mathcal R(C)$ such that $X$ lies on the surface of the cube for some rotation $\mathcal R(A)=B.$

In how many ways a cube can be painted using seven different colors in such a way that no two faces are in same color? $ \textbf{(A)}\ 154 \qquad\textbf{(B)}\ 203 \qquad\textbf{(C)}\ 210 \qquad\textbf{(D)}\ 240 \qquad\textbf{(E)}\ \text{None of the above} $

Let $G$ be the centroid of $\triangle ABC.$ A rotation $120^\circ$ clockwise about $G$ takes $B$ and $C$ to $B_1$ and $C_1$ respectively. A rotation $120^\circ$ counterclockwise about $G$ takes $B$ and $C$ to $B_2$ and $C_2$ respectively. Prove $\triangle AB_1C_2$ and $\triangle AB_2C_1$ are equilateral. [i]Proposed by Evan Chang (squareman), USA [/i] [img]https://cdn.artofproblemsolving.com/attachments/3/b/46b4f09edcf17755df2dea3546881475db6eff.png[/img]

Let $H$ be the orthocenter of $\triangle ABC$. The points $A_{1} \not= A$, $B_{1} \not= B$ and $C_{1} \not= C$ lie, respectively, on the circumcircles of $\triangle BCH$, $\triangle CAH$ and $\triangle ABH$ and satisfy $A_{1}H=B_{1}H=C_{1}H$. Denote by $H_{1}$, $H_{2}$ and $H_{3}$ the orthocenters of $\triangle A_{1}BC$, $\triangle B_{1}CA$ and $\triangle C_{1}AB$, respectively. Prove that $\triangle A_{1}B_{1}C_{1}$ and $\triangle H_{1}H_{2}H_{3}$ have the same orthocenter.

A token starts at the point $(0,0)$ of an $xy$-coordinate grid and them makes a sequence of six moves. Each move is $1$ unit in a direction parallel to one of the coordinate axes. Each move is selected randomly from the four possible directions and independently of the other moves. The probability the token ends at a point on the graph of $|y|=|x|$ is $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

In triangle $ABC,$ $AB=13,$ $BC=14,$ $AC=15,$ and point $G$ is the intersection of the medians. Points $A',$ $B',$ and $C',$ are the images of $A,$ $B,$ and $C,$ respectively, after a $180^\circ$ rotation about $G.$ What is the area if the union of the two regions enclosed by the triangles $ABC$ and $A'B'C'?$

Each grid point of a cartesian plane is colored with one of three colors, whereby all three colors are used. Show that one can always find a right-angled triangle, whose three vertices have pairwise different colors.

For which positive integers $n$ is it possible to cover a $(2n+1) \times (2n+1)$ chessboard which has one of its corner squares cut out with tiles shown in the figure (each tile covers exactly $4$ squares, tiles can be rotated and turned around)? [img]https://cdn.artofproblemsolving.com/attachments/6/5/8fddeefc226ee0c02353a1fc11e48ce42d8436.png[/img]

A $9\times 7$ rectangle is tiled with tiles of the two types: L-shaped tiles composed by three unit squares (can be rotated repeatedly with $90^\circ$) and square tiles composed by four unit squares. Let $n\ge 0$ be the number of the $2 \times 2 $ tiles which can be used in such a tiling. Find all the values of $n$.

Circle $S_1$ has radius $5$. Circle $S_2$ has radius $7$ and has its center lying on $S_1$. Circle $S_3$ has an integer radius and has its center lying on $S_2$. If the center of $S_1$ lies on $S_3$, how many possible values are there for the radius of $S_3$? [i]Ray Li[/i]

Triangle $ABC$ has right angle at $B$, and contains a point $P$ for which $PA = 10$, $PB = 6$, and $\angle APB = \angle BPC = \angle CPA$. Find $PC$. [asy] pair A=(0,5), B=origin, C=(12,0), D=rotate(-60)*C, F=rotate(60)*A, P=intersectionpoint(A--D, C--F); draw(A--P--B--A--C--B^^C--P); dot(A^^B^^C^^P); pair point=P; label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$P$", P, NE);[/asy]

Define $\mathcal{A}=\{(x,y)|x=u+v,y=v, u^2+v^2\le 1\}$. Find the length of the longest segment that is contained in $\mathcal{A}$.

A convex 2012-gon $A_1A_2A_3 \dots A_{2012}$ has the property that for every integer $1 \le i \le 1006$, $\overline{A_iA_{i+1006}}$ partitions the polygon into two congruent regions. Show that for every pair of integers $1 \le j < k \le 1006$, quadrilateral $A_jA_kA_{j+1006}A_{k+1006}$ is a parallelogram. [i]Proposed by Lewis Chen[/i]

Sam colors each tile in a 4 by 4 grid white or black. A coloring is called [i]rotationally symmetric[/i] if the grid can be rotated 90, 180, or 270 degrees to achieve the same pattern. Two colorings are called [i]rotationally distinct[/i] if neither can be rotated to match the other. How many rotationally distinct ways are there for Sam to color the grid such that the colorings are [i]not[/i] rotationally symmetric? [i]Proposed by Gabriel Wu[/i]

Triangle $ABC$ is given. The circle $\omega$ with center $I$ is tangent at points $D,E,F$ to segments $BC,AC,AB$ respectively. When $ABC$ is rotated $180$ degrees about point $I$, triangle $A'B'C'$ results. Lines $AD, B'C'$ meet at $U$, lines $BE, A'C'$ meet at $V$, and lines $CF, A'B'$ meet at $W$. Line $BC$ meets $A'C', A'B'$ at points $D_1, D_2$ respectively. Line $AC$ meets $A'B', B'C'$ at $E_1, E_2$ respectively. Line $AB$ meets $B'C', A'C'$ at $F_1,F_2$ respectively. Six (not necessarily convex) quadrilaterals were colored orange: \[AUIF_2 , C'FIF_2 , BVID_1 , A'DID_2 , CWIE_1 , B'EIE_2\] Six other quadrilaterals were colored green: \[AUIE_2 , C'FIF_1 , BVIF_2 , A'DID_1 , CWID_2 , B'EIE_1\] Prove that the sum of the green areas equals the sum of the orange areas.

Given mobile points $P(0,\ \sin \theta),\ Q(8\cos \theta,\ 0)\ \left(0\leq \theta \leq \frac{\pi}{2}\right)$ on the $x$-$y$ plane. Denote by $D$ the part in which line segment $PQ$ sweeps. Find the volume $V$ generated by a rotation of $D$ around the $x$-axis.

Points $ A’,B,C’ $ are arbitrarily taken on edges $ SA,SB, $ respectively, $ SC $ of a tetrahedron $ SABC. $ Plane forrmed by $ ABC $ intersects the plane $ \rho , $ formed by $ A’B’C’, $ in a line $ d. $ Prove that, meanwhile the plane $ \rho $ rotates around $ d, $ the lines $ AA’,BB’ $ and $ CC’ $ are, and remain concurrent. Find de locus of the respective intersections.

[color=darkblue]Let $ ABCD$ be a trapezoid with $ AB\parallel CD$. Exterior equilateral triangles $ ABE$ and $ CDF$ are constructed. Prove that lines $ AC$, $ BD$ and $ EF$ are concurrent.[/color]

Let $M$ and $N$ be two regular polygonic area.Define $K(M,N)$ as the midpoints of segments $[AB]$ such that $A$ belong to $M$ and $B$ belong to $N$. Find all situations of $M$ and $N$ such that $K(M,N)$ is a regualr polygonic area too.

5. $A$ and $B$ play alternating turns on a $2012 \times 2013$ board with enough pieces of the following types: Type $1$: Piece like Type $2$ but with one square at the right of the bottom square. Type $2$: Piece of $2$ consecutive squares, one over another. Type $3$: Piece of $1$ square. At his turn, $A$ must put a piece of the type $1$ on available squares of the board. $B$, at his turn, must put exactly one piece of each type on available squares of the board. The player that cannot do more movements loses. If $A$ starts playing, decide who has a winning strategy. Note: The pieces can be rotated but cannot overlap; they cannot be out of the board. The pieces of the types $1$, $2$ and $3$ can be put on exactly $3$, $2$ and $1$ squares of the board respectively.

Can an $8\times8$ board be covered with 13 equal 5-celled figures? It's alowed to rotate the figures or turn them over. [size=85](Kyiv mathematical festival 2014)[/size]

Let $n$ be a positive with $n\geq 3$. Consider a board of $n \times n$ boxes. In each step taken the colors of the $5$ boxes that make up the figure bellow change color (black boxes change to white and white boxes change to black) The figure can be rotated $90°, 180°$ or $270°$. Firstly, all the boxes are white.Determine for what values of $n$ it can be achieved, through a series of steps, that all the squares on the board are black.

The vertices of a regular nonagon (9-sided polygon) are to be labeled with the digits $1$ through $9$ in such a way that the sum of the numbers on every three consecutive vertices is a multiple of $3$. Two acceptable arrangements are considered to be indistinguishable if one can be obtained from the other by rotating the nonagon in the plane. Find the number of distinguishable acceptable arrangements.