The vertices of 100-gon (i.e., polygon with 100 sides) are colored alternately white or black. One of the vertices contains a checker. Two players in turn do two things: move the checker into other vertice along the side of 100-gon and then erase some side. The game ends when it is impossible to move the checker. At the end of the game if the checker is in the white vertice then the first player wins. Otherwise the second player wins. Does any of the players have winning strategy? If yes, then who? [i]Remark.[/i] The answer may depend on initial position of the checker.

Let $ABCD$ be a parallelogram, $E$ a point on the line $AB$, beyond $B, F$ a point on the line $AD$, beyond $D$, and $K$ the point of intersection of the lines $ED$ and $BF$. Prove that quadrilaterals $ABKD$ and $CEKF$ have the same area.

On the sides $AB$ and $AC$ of the triangle $ABC$, the points $P$ and $Q$ are chosen, respectively, so that $PQ\parallel BC$. Segments $BQ$ and $CP$ intersect at point $O$. Point $A'$ is symmetric to point $A$ relative to line $BC$. The segment $A'O$ intersects the circumcircle $w$ of the triangle $APQ$ at the point $S$. Prove that circumcircle of $BSC$ is tangent to the circle $w$.

Let $S$ be the set of all 3-tuples $(a,b,c)$ that satisfy $a+b+c=3000$ and $a,b,c>0$. If one of these 3-tuples is chosen at random, what's the probability that $a,b$ or $c$ is greater than or equal to 2,500?

At a math contest there are $2n$ students participating. Each of them submits a problem to the jury, which thereafter gives each students one of the $2n$ problems submitted. One says that the contest is [i]fair[/i] is there are $n$ participants which receive their problems from the other $n$ participants. Prove that the number of distributions of the problems in order to obtain a fair contest is a perfect square.

How many ways can we pick four $3$-element subsets of $\{1, 2, ..., 6\}$ so that each pair of subsets share exactly one element?

The $X{}$ pentomino consists of five $1\times1$ squares where four squares are all adjacent to the fifth one. Is it possible to cut nine such pentominoes from an $8\times 8$ chessboard, not necessarily cutting along grid lines? (The picture shows how to cut three such $X{}$ pentominoes.) [i]Alexandr Gribalko[/i]

Let $\displaystyle M$ be a set composed of $\displaystyle n$ elements and let $\displaystyle \mathcal P (M)$ be its power set. Find all functions $\displaystyle f : \mathcal P (M) \to \{ 0,1,2,\ldots,n \}$ that have the properties (a) $\displaystyle f(A) \neq 0$, for $\displaystyle A \neq \phi$; (b) $\displaystyle f \left( A \cup B \right) = f \left( A \cap B \right) + f \left( A \Delta B \right)$, for all $\displaystyle A,B \in \mathcal P (M)$, where $\displaystyle A \Delta B = \left( A \cup B \right) \backslash \left( A \cap B \right)$.

Let $P_1$, $P_2$, $P_3$ be pairwise distinct parabolas in the plane. Find the maximum possible number of intersections between two or more of the $P_i$. In other words, find the maximum number of points that can lie on two or more of the parabolas $P_1$, $P_2$, $P_3$ .

For which of the following $ n$, $ n\times n$ chessboard cannot be covered using at most one unit square piece and many L-shaped pieces (an L-shaped piece is a 2x2 piece with one square removed)? $\textbf{(A)}\ 96 \qquad\textbf{(B)}\ 97 \qquad\textbf{(C)}\ 98 \qquad\textbf{(D)}\ 99 \qquad\textbf{(E)}\ 100$

Prove that there are infinitely many positive integers $k$ such that $k(k+1)(k+2)(k+3)$ has no prime divisor of the form $8t+5.$

Let $n$ be a positive integer. Each cell on an $n \times n$ board will be filled with a positive integer less than or equal to $2n-1$ such that for each index $i$ with $1 \leq i \leq n$, the $2n-1$ cells in the $i^{\text{th}}$ row or $i^{\text{th}}$ collumn contain distinct integers. (a) Is this filling possible for $n=4$? (b) Is this filling possible for $n=5$?

Liam writes the number $0$ on a board, then performs a series of turns. Each turn, he chooses a nonzero integer so that for every nonzero integer $N,$ he chooses $N$ with $3^{- |N|}$ probability. He adds his chosen integer $N$ to the last number written on the board, yielding a new number. He writes the new number on the board and uses it for the next turn. Liam repeats the process until either $8$ or $9$ is written on the board, at which point he stops. Given that Liam eventually stopped, find the probability the last number he wrote on the board was $9.$

The difference of fractions $\frac{2024}{2023} - \frac{2023}{2024}$ was represented as an irreducible fraction $\frac{p}{q}$. Find the value of $p$.

Let $ f(x) \equal{} x^8 \plus{} 4x^6 \plus{} 2x^4 \plus{} 28x^2 \plus{} 1.$ Let $ p > 3$ be a prime and suppose there exists an integer $ z$ such that $ p$ divides $ f(z).$ Prove that there exist integers $ z_1, z_2, \ldots, z_8$ such that if \[ g(x) \equal{} (x \minus{} z_1)(x \minus{} z_2) \cdot \ldots \cdot (x \minus{} z_8),\] then all coefficients of $ f(x) \minus{} g(x)$ are divisible by $ p.$

Let $ 0 \leq x \leq 2\pi$. Prove the inequality $ \sqrt {\frac {\sin^{2}x}{1 + \cos^{2}x}} + \sqrt {\frac {\cos^{2}x}{1 + \sin^{2}x}}\geq 1 $

A subsum of $n$ real numbers $a_1,\dots,a_n$ is a sum of elements of a subset of the set $\{a_1,\dots,a_n\}$. In other words a subsum is $\epsilon_1a_1+\dots+\epsilon_na_n$ in which for each $1\leq i \leq n$ ,$\epsilon_i$ is either $0$ or $1$. Years ago, there was a valuable list containing $n$ real not necessarily distinct numbers and their $2^n-1$ subsums. Some mysterious creatures from planet Tarator has stolen the list, but we still have the subsums. (a) Prove that we can recover the numbers uniquely if all of the subsums are positive. (b) Prove that we can recover the numbers uniquely if all of the subsums are non-zero. (c) Prove that there's an example of the subsums for $n=1392$ such that we can not recover the numbers uniquely. Note: If a subsum is sum of element of two different subsets, it appears twice. Time allowed for this question was 75 minutes.

Let $ABCD$ be a circumscribed quadrilateral, assume $ABCD$ is not a kite. Denote the circumcenters of triangle $ABC,BCD,CDA,DAB$ by $O_D,O_A,O_B,O_C$ respectively. a. Prove that $O_AO_BO_CO_D$ is circumscribed. b. Let the angle bisector of $\angle BAD$ intersect the angle bisector of $\angle O_BO_AO_D$ in $X$. Similarly define the points $Y,Z,W$. Denote the incenters of $ABCD, O_AO_BO_CO_D$ by $I,J$ respectively. Express the angles $\angle ZYJ,\angle XYI$ in terms of angles of quadrilateral $ABCD$.

[hide=D stands for Dedekind, Z stands for Zermelo]they had two problem sets under those two names[/hide] [b]D1.[/b] A Giant Hopper is $200$ meters away from you. It can hop $50$ meters. How many hops would it take for it to reach you? [b]D2.[/b] A rope of length $6$ is used to form the edges of an equilateral triangle (a triangle with equal side lengths). What is the length of one of these edges? [b]D3 / Z1.[/b] Point $E$ is on side $AB$ of rectangle $ABCD$. Find the area of triangle $ECD$ divided by the area of rectangle $ABCD$. [b]D4 / Z2.[/b] Garb and Grunt have two rectangular pastures of area $30$. Garb notices that his has a side length of $3$, while Grunt’s has a side length of $5$. What’s the positive difference between the perimeters of their pastures? [b]D5.[/b] Let points $A$ and $B$ be on a circle with radius $6$ and center $O$. If $\angle AOB = 90^o$, find the area of triangle $AOB$. [b]D6 / Z3.[/b] A scalene triangle (the $3$ side lengths are all different) has integer angle measures (in degrees). What is the largest possible difference between two angles in the triangle? [b]D7.[/b] Square $ABCD$ has side length $6$. If triangle $ABE$ has area $9$, find the sum of all possible values of the distance from $E$ to line $CD$. [b]D8 / Z4.[/b] Let point $E$ be on side $\overline{AB}$ of square $ABCD$ with side length $2$. Given $DE = BC+BE$, find $BE$. [b]Z5.[/b] The two diagonals of rectangle $ABCD$ meet at point $E$. If $\angle AEB = 2\angle BEC$, and $BC = 1$, find the area of rectangle $ABCD$. [b]Z6.[/b] In $\vartriangle ABC$, let $D$ be the foot of the altitude from $A$ to $BC$. Additionally, let $X$ be the intersection of the angle bisector of $\angle ACB$ and $AD$. If $BD = AC = 2AX = 6$, find the area of $ABC$. [b]Z7.[/b] Let $\vartriangle ABC$ have $\angle ABC = 40^o$. Let $D$ and $E$ be on $\overline{AB}$ and $\overline{AC}$ respectively such that DE is parallel to $\overline{BC}$, and the circle passing through points $D$, $E$, and $C$ is tangent to $\overline{AB}$. If the center of the circle is $O$, find $\angle DOE$. [b]Z8.[/b] Consider $\vartriangle ABC$ with $AB = 3$, $BC = 4$, and $AC = 5$. Let $D$ be a point of $AC$ other than $A$ for which $BD = 3$, and $E$ be a point on $BC$ such that $\angle BDE = 90^o$. Find $EC$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In Survev.io, Calvin observes that he has exactly twice as much blue ammo as red ammo. After firing one blue bullet and $9$ red bullets, he remarks that the amount of blue ammo he has is divisible by $5$ and the amount of red ammo he has is divisible by $7$. Find the least amount of red ammo he could have started with.

Which of the two numbers is bigger : $\sqrt{1997}+2\sqrt{1999} + 2\sqrt{2001} + \sqrt{2003}$ or $2\sqrt{1998} +2\sqrt{2000}+2\sqrt{2002}$ ?

Let triangle $ABC$ have $\angle BAC = 45^{\circ}$ and circumcircle $\Gamma$ and let $M$ be the intersection of the angle bisector of $\angle BAC$ with $\Gamma$. Let $\Omega$ be the circle tangent to segments $\overline{AB}$ and $\overline{AC}$ and internally tangent to $\Gamma$ at point $T$. Given that $\angle TMA = 45^{\circ}$ and that $TM = \sqrt{100 - 50 \sqrt{2}}$, the length of $BC$ can be written as $a \sqrt{b}$, where $b$ is not divisible by the square of any prime. Find $a + b$.

Niki has $15$ dollars more than twice as much money as her sister Amy. If Niki gives Amy $30$ dollars, then Niki will have hals as much money as her sister. How many dollars does Niki have?

From a point $P$ outside of a circle with centre $O$, tangent segments $\overline{PA}$ and $\overline{PB}$ are drawn. If $\frac1{\left|\overline{OA}\right|^2}+\frac1{\left|\overline{PA}\right|^2}=\frac1{16}$, then $\left|\overline{AB}\right|=$? $\textbf{(A)}~4$ $\textbf{(B)}~6$ $\textbf{(C)}~8$ $\textbf{(D)}~10$

From a square of side length $1$, four identical triangles are removed, one at each corner, leaving a regular octagon. What is the area of the octagon?