Circle $C$(the center is $C$.) is inside the $\angle XOY$ and it is tangent to the two sides of the angle. Let $C_1$ be the circle that passes through the center of $C$ and tangent to two sides of angle and let $A$ be one of the endpoint of diameter of $C_1$ that passes through $C$ and $B$ be the intersection of this diameter and circle $C.$ Prove that the cirlce that $A$ is the center and $AB$ is the radius is also tangent to the two sides of $\angle XOY.$

A non-self-intersecting polygon is nearly convex if precisely one of its interior angles is greater than $180^\circ$. One million distinct points lie in the plane in such a way that no three of them are collinear. We would like to construct a nearly convex one-million-gon whose vertices are precisely the one million given points. Is it possible that there exist precisely ten such polygons?

The planar diagram below, with equilateral triangles and regular hexagons, sides length $2$ cm, is folded along the dashed edges of the polygons, to create a closed surface in three-dimensional Euclidean spaces. Edges on the periphery of the planar diagram are identified (or glued) with precisely one other edge on the periphery in a natural way. Thus, for example, $BA$ will be joined to $QP$ and $AC$ will be joined to $DC$. Find the volume of the three-dimensional region enclosed by the resulting surface. [img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvMy9jL2ZiZjc1ZjY5Nzk5YzRiMjhjODNlZDBiZjU1MzljYzZkNTVhOGQ3LnBuZw==&rn=VlRSTUMgMjAxNS5wbmc=[/img]

[b]p1.[/b] Show that for every $n \ge 6$, a square in the plane may be divided into $n$ smaller squares, not necessarily all of the same size. [b]p2.[/b] Let $n$ be the $4018$-digit number $111... 11222...2225$, where there are $2008$ ones and $2009$ twos. Prove that $n$ is a perfect square. (Giving the square root of $n$ is not sufficient. You must also prove that its square is $n$.) [b]p3.[/b] Let $n$ be a positive integer. A game is played as follows. The game begins with $n$ stones on the table. The two players, denoted Player I and Player II (Player I goes first), alternate in removing from the table a nonzero square number of stones. (For example, if $n = 26$ then in the first turn Player I can remove $1$ or $4$ or $9$ or $16$ or $25$ stones.) The player who takes the last stone wins. Determine if the following sentence is TRUE or FALSE and prove your answer: There are infinitely many starting values n such that Player II has a winning strategy. (Saying that Player II has a winning strategy means that no matter how Player I plays, Player II can respond with moves that lead to a win for Player II.) [b]p4.[/b] Consider a convex quadrilateral $ABCD$. Divide side $AB$ into $8$ equal segments $AP_1$, $P_1P_2$, $...$ , $P_7B$. Divide side $DC$ into $8$ equal segments $DQ_1$, $Q_1Q_2$, $...$ , $Q_7C$. Similarly, divide each of sides $AD$ and $BC$ into $8$ equal segments. Draw lines to form an $8 \times 8$ “checkerboard” as shown in the picture. Color the squares alternately black and white. (a) Show that each of the $7$ interior lines $P_iQ_i$ is divided into $8$ equal segments. (b) Show that the total area of the black regions equals the total area of the white regions. [img]https://cdn.artofproblemsolving.com/attachments/1/4/027f02e26613555181ed93d1085b0e2de43fb6.png[/img] [b]p5.[/b] Prove that exactly one of the following two statements is true: A. There is a power of $10$ that has exactly $2008$ digits in base $2$. B. There is a power of $10$ that has exactly $2008$ digits in base $5$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

(a) The numbers $1, 2,... , 100$ are divided into two groups so that the sum of all numbers in one group is equal to that in the other. Prove that one can remove two numbers from each group so that the sums of all numbers in each group are still the same. (b) The numbers $1, 2 , ... , n$ are divided into two groups so that the sum of all numbers in one group is equal to that in the other . Is it true that for every such$ n > 4$ one can remove two numbers from each group so that the sums of all numbers in each group are still the same? (A Shapovalov) [(a) for Juniors, (a)+(b) for Seniors]

A bag contains ten red marbles and some number of blue marbles. If two marbles are chosen without replacement, the probability that they are both red is $\frac{5}{17}$. How many marbles are in the bag?

Let points $A,B,$ and $C$ lie on a line such that $AB=1, BC=1,$ and $AC=2.$ Let $C_1$ be the circle centered at $A$ passing through $B,$ and let $C_2$ be the circle centered at $A$ passing through $C.$ Find the area of the region outside $C_1,$ but inside $C_2.$

Let $n$ be a positive integer, prove that : [b](a)[/b] $\log_{10}(n + 1) > \frac{3}{10n} +\log_{10}n ;$ [b](b)[/b] $ \log n! > \frac{3n}{10}\left( \frac 12+\frac 13 +\cdots +\frac 1n -1\right).$

Let all roots of an $n$-th degree polynomial $P(z)$ with complex coefficients lie on the unit circle in the complex plane. Prove that all roots of the polynomial $$2zP'(z)-nP(z)$$ lie on the same circle.

Let $p$ be an odd prime and let $$F(n)=1+2n+3n^2+\ldots+(p-1)n^{p-2}.$$Prove that if $a$ and $b$ are distinct integers in $\{0,1,2,\ldots,p-1\}$ then $F(a)$ and $F(b)$ are not congruent modulo $p$.

An equilateral triangle $ABC$ is given. On the line through $B$ parallel to $AC$ there is a point $D$, such that $D$ and $C$ are on the same side of the line $AB$. The perpendicular bisector of $CD$ intersects the line $AB$ in $E$. Prove that triangle $CDE$ is equilateral.

Some regular polygons are inscribed in a circle. Fedir turned some of them, so all polygons have a common vertice. Prove that the number of vertices did not increase.

Find $10$ different positive integers such that each of them is a divisor of their sum (S Fomin, Leningrad)

Ten localities are served by two international airlines such that there exists a direct service (without stops) between any two of these localities and all airline schedules offer round-trip service between the cities they serve. Prove that at least one of the airlines can offer two disjoint round trips each containing an odd number of landings.

A cowboy is 4 miles south of a stream which flows due east. He is also 8 miles west and 7 miles north of his cabin. He wishes to water his horse at the stream and return home. The shortest distance (in miles) he can travel and accomplish this is $ \textbf{(A)}\ 4\plus{}\sqrt{185} \qquad \textbf{(B)}\ 16 \qquad \textbf{(C)}\ 17 \qquad \textbf{(D)}\ 18 \qquad \textbf{(E)}\ \sqrt{32}\plus{}\sqrt{137}$

Let $f:\mathbb{Q}\rightarrow \mathbb{Q}$ a monotonic bijective function. a)Prove that there exist a unique continuous function $F:\mathbb{R}\rightarrow \mathbb{R}$ such that $F(x)=f(x),\ (\forall)x\in \mathbb{Q}$. b)Give an example of a non-injective polynomial function $G:\mathbb{R}\rightarrow \mathbb{R}$ such that $G(\mathbb{Q})\subset \mathbb{Q}$ and it's restriction defined on $\mathbb{Q}$ is injective.

$P(x)$ is a fifth degree polynomial. $P(2018)=1$, $P(2019)=2$ $P(2020)=3$, $P(2021)=4$, $P(2022)=5$. $P(2017)=?$

$ABCD$ is a rectangle. $E$ is a point on $AB$ between $A$ and $B$, and $F$ is a point on $AD$ between $A$ and $D$. The area of the triangle $EBC$ is $16$, the area of the triangle $EAF$ is $12$ and the area of the triangle $FDC$ is 30. Find the area of the triangle $EFC$.

A circle is divided by the chord $AB$ into two segments and one of them is rotated about the point $A$ by a certain angle, the point $B$ being taken to $B'$. Prove that the line segments joining the midpoints of the two arcs (i.e. the arc $AB$ which had not been rotated and the rotated arc $AB'$) with the midpoint of $BB'$ are perpendicular. (F. Nazyrov, 11th form student, Obninsk)

The length of a rectangle is increased by $ 10\%$ and the width is decreased by $ 10\%$. What percent of the old area is the new area? $ \textbf{(A)}\ 90 \qquad \textbf{(B)}\ 99 \qquad \textbf{(C)}\ 100 \qquad \textbf{(D)}\ 101 \qquad \textbf{(E)}\ 110$

On the board are written the natural numbers from $1$ to $2001$ inclusive. You have to delete some numbers so that among those that remain undeleted it is impossible to choose two different numbers such that the result of their multiplication is equal to one of the numbers that remain undeleted. What is the minimum number of numbers that must be deleted? For that amount, present an example showing which numbers are erased. Justify why, if fewer numbers are deleted, the desired property is not obtained.

Prove that there are no positive integers $n$ and $k\le n$ such that the numbers $$\binom nk,\binom n{k+1},\binom n{k+2},\binom n{k+3}$$in this order form an arithmetic progression.

Let $ ABC$, $ l$ and $ P$ be arbitrary triangle, line and point. $ A',B',C'$ are reflections of $ A,B,C$ in point $ P$. $ A''$ is a point on $ B'C'$ such that $ AA''\parallel l$. $ B'',C''$ are defined similarly. Prove that $ A'',B'',C''$ are collinear.

[u]Round 1[/u] [b]1.1.[/b] There are $99$ dogs sitting in a long line. Starting with the third dog in the line, if every third dog barks three times, and all the other dogs each bark once, how many barks are there in total? [b]1.2.[/b] Indigo notices that when she uses her lucky pencil, her test scores are always $66 \frac23 \%$ higher than when she uses normal pencils. What percent lower is her test score when using a normal pencil than her test score when using her lucky pencil? [b]1.3.[/b] Bill has a farm with deer, sheep, and apple trees. He mostly enjoys looking after his apple trees, but somehow, the deer and sheep always want to eat the trees' leaves, so Bill decides to build a fence around his trees. The $60$ trees are arranged in a $5\times 12$ rectangular array with $5$ feet between each pair of adjacent trees. If the rectangular fence is constructed $6$ feet away from the array of trees, what is the area the fence encompasses in feet squared? (Ignore the width of the trees.) [u]Round 2[/u] [b]2.1.[/b] If $x + 3y = 2$, then what is the value of the expression $9^x * 729^y$? [b]2.2.[/b] Lazy Sheep loves sleeping in, but unfortunately, he has school two days a week. If Lazy Sheep wakes up each day before school's starting time with probability $1/8$ independent of previous days, then the probability that Lazy Sheep wakes up late on at least one school day over a given week is $p/q$ for relatively prime positive integers $p, q$. Find $p + q$. [b]2.3.[/b] An integer $n$ leaves remainder $1$ when divided by $4$. Find the sum of the possible remainders $n$ leaves when divided by $20$. [u]Round 3[/u] [b]3.1. [/b]Jake has a circular knob with three settings that can freely rotate. Each minute, he rotates the knob $120^o$ clockwise or counterclockwise at random. The probability that the knob is back in its original state after $4$ minutes is $p/q$ for relatively prime positive integers $p, q$. Find $p + q$. [b]3.2.[/b] Given that $3$ not necessarily distinct primes $p, q, r$ satisfy $p+6q +2r = 60$, find the sum of all possible values of $p + q + r$. [b]3.3.[/b] Dexter's favorite number is the positive integer $x$, If $15x$ has an even number of proper divisors, what is the smallest possible value of $x$? (Note: A proper divisor of a positive integer is a divisor other than itself.) [u]Round 4[/u] [b]4.1.[/b] Three circles of radius $1$ are each tangent to the other two circles. A fourth circle is externally tangent to all three circles. The radius of the fourth circle can be expressed as $\frac{a\sqrt{b}-\sqrt{c}}{d}$ for positive integers $a, b, c, d$ where $b$ is not divisible by the square of any prime and $a$ and $d$ are relatively prime. Find $a + b + c + d$. [b]4.2. [/b]Evaluate $$\frac{\sqrt{15}}{3} \cdot \frac{\sqrt{35}}{5} \cdot \frac{\sqrt{63}}{7}... \cdot \frac{\sqrt{5475}}{73}$$ [b]4.3.[/b] For any positive integer $n$, let $f(n)$ denote the number of digits in its base $10$ representation, and let $g(n)$ denote the number of digits in its base $4$ representation. For how many $n$ is $g(n)$ an integer multiple of $f(n)$? PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h2784571p24468619]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $A$ be an integral domain and $A[X]$ be its associated ring of polynomials. For every integer $n \ge 2$ we define the map $\varphi_n : A[X] \to A[X],$ $\varphi_n(f)=f^n$ and we assume that the set $$M= \Big\{ n \in \mathbb{Z}_{\ge 2} : \varphi_n \mathrm{~is~an~endomorphism~of~the~ring~} A[X] \Big\}$$ is nonempty. Prove that there exists a unique prime number $p$ such that $M=\{p,p^2,p^3, \ldots\}.$