A triangle $ABC$ is given in the plane with $AB = \sqrt{7},$ $BC = \sqrt{13}$ and $CA = \sqrt{19},$ circles are drawn with centers at $A,B$ and $C$ and radii $\frac{1}{3},$ $\frac{2}{3}$ and $1,$ respectively. Prove that there are points $A',B',C'$ on these three circles respectively such that triangle $ABC$ is congruent to triangle $A'B'C'.$

A square $ R$ of sidelength $ 250$ lies inside a square $ Q$ of sidelength $ 500$. Prove that: One can always find two points $ A$ and $ B$ on the perimeter of $ Q$ such that the segment $ AB$ has no common point with the square $ R$, and the length of this segment $ AB$ is greater than $ 521$.

How many ways are there to color the $8$ regions of a three-set Venn Diagram with $3$ colors such that each color is used at least once? Two colorings are considered the same if one can be reached from the other by rotation and/or reflection.

Consider a regular $2^k$-gon with center $O$ and label its sides clockwise by $l_1,l_2,...,l_{2^k}$. Reflect $O$ with respect to $l_1$, then reflect the resulting point with respect to $l_2$ and do this process until the last side. Prove that the distance between the final point and $O$ is less than the perimeter of the $2^k$-gon. [i]Proposed by Hesam Rajabzade[/i]

A [i]beautiful configuration[/i] of points is a set of $n$ colored points, such that if a triangle with vertices in the set has an angle of at least $120$ degrees, then exactly 2 of its vertices are colored with the same color. Determine the maximum possible value of $n$.

The eleven members of a cricket team are numbered $1,2,...,11$. In how many ways can the entire cricket team sit on the eleven chairs arranged around a circular table so that the numbers of any two adjacent players differ by one or two ?

On the table lay a pencil, sharpened at one end. The student can rotate the pencil around one of its ends at $45^{\circ}$ clockwise or counterclockwise. Can the student, after a few turns of the pencil, go back to the starting position so that the sharpened end and the not sharpened are reversed?

Let $A_1A_2 ...A_{360}$ be a regular $360$-gon with centre $S$. For each of the triangles $A_1A_{50}A_{68}$ and $A_1A_{50}A_{69}$ determine, whether its images under some $120$ rotations with centre $S$ can have (as triangles) all the $360$ points $A_1, A_2, ..., A_{360}$ as vertices.

Is it possible to find a set of $100$ (or $200$) points on the boundary of a cube such that this set remains fixed under all rotations which leave the cube fixed ?

Given triangle $ABC$, squares $ABEF, BCGH, CAIJ$ are constructed externally on side $AB, BC, CA$, respectively. Let $AH \cap BJ = P_1$, $BJ \cap CF = Q_1$, $CF \cap AH = R_1$, $AG \cap CE = P_2$, $BI \cap AG = Q_2$, $CE \cap BI = R_2$. Prove that triangle $P_1 Q_1 R_1$ is congruent to triangle $P_2 Q_2 R_2$.

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]

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.$

Consider the area encircled by $x^2=4y,x^2=-4y,x=4,x=-4$, rotate it around $y$-axis, the volume of the revolved body is $V_1$. Then consider the figure formed by all points $(x,y)$ that $x^2+y^2\leq16,x^2+(y-2)^2\geq4,x^2+(y-2)^2\geq4$, rotate it around $y$-axis, the volume of the revolved body is $V_2$. The relationship between $V_1$ and $V_2$ is $\text{(A)}V_1=\frac{1}{2}V_2\qquad\text{(B)}V_1=\frac{2}{3}V_2\qquad\text{(C)}V_1=V_2\qquad\text{(D)}V_1=2V_2$

A massless string is wrapped around a frictionless pulley of mass $M$. The string is pulled down with a force of 50 N, so that the pulley rotates due to the pull. Consider a point $P$ on the rim of the pulley, which is a solid cylinder. The point has a constant linear (tangential) acceleration component equal to the acceleration of gravity on Earth, which is where this experiment is being held. What is the weight of the cylindrical pulley, in Newtons? [i](Proposed by Ahaan Rungta)[/i] [hide="Note"] This problem was not fully correct. Within friction, the pulley cannot rotate. So we responded: [quote]Excellent observation! This is very true. To submit, I'd say just submit as if it were rotating and ignore friction. In some effects such as these, I'm pretty sure it turns out that friction doesn't change the answer much anyway, but, yes, just submit as if it were rotating and you are just ignoring friction. [/quote]So do this problem imagining that the pulley does rotate somehow. [/hide]

A needle (a segment) lies on a plane. One can rotate it $45^{\circ}$ round any of its endpoints. Is it possible that after several rotations the needle returns to initial position with the endpoints interchanged?

An airplane wants to go from a point on the equator, and at each moment it will go to the northeast with speed $v$. Suppose the radius of earth is $R$. a) Will the airplane reach to the north pole? If yes how long it will take to reach the north pole? b) Will the airplne rotate finitely many times around the north pole? If yes how many times?

A square is divided in four parts by two perpendicular lines, in such a way that three of these parts have areas equal to 1. Show that the square has area equal to 4.

Let $H$ be the unit hemisphere $\{(x,y,z):x^2+y^2+z^2=1,z\geq 0\}$, $C$ the unit circle $\{(x,y,0):x^2+y^2=1\}$, and $P$ the regular pentagon inscribed in $C$. Determine the surface area of that portion of $H$ lying over the planar region inside $P$, and write your answer in the form $A \sin\alpha + B \cos\beta$, where $A,B,\alpha,\beta$ are real numbers.

Let $ABCD$ be a convex quadrilateral such that \[\begin{array}{rl} E,F \in [AB],& AE = EF = FB \\ G,H \in [BC],& BG = GH = HC \\ K,L \in [CD],& CK = KL = LD \\ M,N \in [DA],& DM = MN = NA \end{array}\] Let \[[NG] \cap [LE] = \{P\}, [NG]\cap [KF] = \{Q\},\] \[{[}MH] \cap [KF] = \{R\}, [MH]\cap [LE]=\{S\}\] Prove that [list=a][*]$Area(ABCD) = 9 \cdot Area(PQRS)$ [*] $NP=PQ=QG$ [/list]

A rectangle that is inscribed in a larger rectangle (with one vertex on each side) is called [i]unstuck[/i] if it is possible to rotate (however slightly) the smaller rectangle about its center within the confines of the larger. Of all the rectangles that can be inscribed unstuck in a 6 by 8 rectangle, the smallest perimeter has the form $\sqrt{N}$, for a positive integer $N$. Find $N$.

In a circle, parallel chords of lengths 2, 3, and 4 determine central angles of $\alpha$, $\beta$, and $\alpha + \beta$ radians, respectively, where $\alpha + \beta < \pi$. If $\cos \alpha$, which is a positive rational number, is expressed as a fraction in lowest terms, what is the sum of its numerator and denominator?

Consider an $n$-by-$n$ board of unit squares for some odd positive integer $n$. We say that a collection $C$ of identical dominoes is a [i]maximal grid-aligned configuration[/i] on the board if $C$ consists of $(n^2-1)/2$ dominoes where each domino covers exactly two neighboring squares and the dominoes don't overlap: $C$ then covers all but one square on the board. We are allowed to slide (but not rotate) a domino on the board to cover the uncovered square, resulting in a new maximal grid-aligned configuration with another square uncovered. Let $k(C)$ be the number of distinct maximal grid-aligned configurations obtainable from $C$ by repeatedly sliding dominoes. Find the maximum value of $k(C)$ as a function of $n$. [i]Proposed by Holden Mui[/i]

We are given a combination lock consisting of $6$ rotating discs. Each disc consists of digits $0, 1, 2,\ldots , 9$ in that order (after digit $9$ comes $0$). Lock is opened by exactly one combination. A move consists of turning one of the discs one digit in any direction and the lock opens instantly if the current combination is correct. Discs are initially put in the position $000000$, and we know that this combination is not correct. [list] a) What is the least number of moves necessary to ensure that we have found the correct combination? b) What is the least number of moves necessary to ensure that we have found the correct combination, if we know that none of the combinations $000000, 111111, 222222, \ldots , 999999$ is correct?[/list] [i]Proposed by Ognjen Stipetić and Grgur Valentić[/i]

$d$ and $n$ are positive integers such that $d \mid n$. The n-number sets $(x_1, x_2, \cdots x_n)$ satisfy the following condition: (1) $0 \leq x_1 \leq x_2 \leq \cdots \leq x_n \leq n$ (2) $d \mid (x_1+x_2+ \cdots x_n)$ Prove that in all the n-number sets that meet the conditions, there are exactly half satisfy $x_n=n$.

In the coordinate space, define a square $S$, defined by the inequality $|x|\leq 1,\ |y|\leq 1$ on the $xy$-plane, with four vertices $A(-1,\ 1,\ 0),\ B(1,\ 1,\ 0),\ C(1,-1,\ 0), D(-1,-1,\ 0)$. Let $V_1$ be the solid by a rotation of the square $S$ about the line $BD$ as the axis of rotation, and let $V_2$ be the solid by a rotation of the square $S$ about the line $AC$ as the axis of rotation. (1) For a real number $t$ such that $0\leq t<1$, find the area of cross section of $V_1$ cut by the plane $x=t$. (2) Find the volume of the common part of $V_1$ and $V_2$.