Consider the set of all integer points in $Z^3$. Sasha and Masha play such a game. At first, Masha marks an arbitrary point. After that, Sasha marks all the points on some a plane perpendicular to one of the coordinate axes and at no point, which Masha noted. Next, they continue to take turns (Masha can't to select previously marked points, Sasha cannot choose the planes on which there are points said Masha). Masha wants to mark $n$ consecutive points on some line that parallel to one of the coordinate axes, and Sasha seeks to interfere with it. Find all $n$, in which Masha can achieve the desired result.

Let $I$ be the center of a circle inscribed in triangle $ABC$. The circle circumscribed about the triangle $BIC$ intersects lines $AB$ and $AC$ at points $E$ and $F$, respectively. Prove that the line $EF$ touches the circle inscribed in the triangle $ABC$.

Around a circle, $20$ distinct positive integers are written. Alex divides each number by its neighbor, moving clockwise around the circle, and records the remainders obtained in each case. Teo performs a similar process but moves counterclockwise around the circle and records the remainders he obtains. If Alex finds only two distinct remainders among the $20$ he records, determine the number of distinct remainders Teo will record.

Let $F$ be a field whose characteristic is not $2$, let $F^*=F\setminus\left\{0\right\}$ be its multiplicative group and let $T$ be the subgroup of $F^*$ constituted by its finite order elements. Prove that if $T$ is finite, then $T$ is cyclic and its order is even.

The tetrahedron $SABC$ has the following property: there exist five spheres, each tangent to the edges $SA, SB, SC, BC, CA, AB,$ or to their extensions. a) Prove that the tetrahedron $SABC$ is regular. b) Prove conversely that for every regular tetrahedron five such spheres exist.

We write one of the numbers $0$ and $1$ into each unit square of a chessboard with $40$ rows and $7$ columns. If any two rows have different sequences, at most how many $1$s can be written into the unit squares? $ \textbf{(A)}\ 198 \qquad\textbf{(B)}\ 128 \qquad\textbf{(C)}\ 82 \qquad\textbf{(D)}\ 40 \qquad\textbf{(E)}\ \text{None of above} $

Let $N$ be a positive integer. Consider a $N \times N$ array of square unit cells. Two corner cells that lie on the same longest diagonal are colored black, and the rest of the array is white. A [i]move[/i] consists of choosing a row or a column and changing the color of every cell in the chosen row or column. What is the minimal number of additional cells that one has to color black such that, after a finite number of moves, a completely black board can be reached?

Let $ABCD$ be a convex cyclic quadrilateral with diagonals $AC$ and $BD$. Each of the four vertixes are reflected across the diagonal on which the do not lie. (a) Investigate when the four points thus obtained lie on a straight line and give as simple an equivalent condition as possible to the cyclic quadrilateral $ABCD$ for it. (b) Show that in all other cases the four points thus obtained lie on one circle. (Theresia Eisenkölbl)

Two circles \(\Gamma\) and \(\Sigma\) intersect at two distinct points \(A\) and \(B\). A line through \(B\) intersects \(\Gamma\) and \(\Sigma\) again at \(C\) and \(D\), respectively. Suppose that \(CA=CD\). Show that the centre of \(\Sigma\) lies on \(\Gamma\).

Consider a $m*n$ board. On each box there's a non-negative integrer number assigned. An operation consists on choosing any two boxes with $1$ side in common, and add to this $2$ numbers the same integrer number (it can be negative), so that both results are non-negatives. What conditions must be satisfied initially on the assignment of the boxes, in order to have, after some operations, the number $0$ on every box?.

A line passing through the center $M$ of the equilateral triangle $ABC$ intersects sides $BC$ and $CA$, respectively, in points $D$ and $E$. Circumcircles of triangle $AEM$ and $BDM$ intersects, besides point $M$, also at point $P$. Prove that the center of circumcircle of triangle $DEP$ lies on the perpendicular bisector of the segment $AB$.

Cookie Monster says a positive integer $n$ is $crunchy$ if there exist $2n$ real numbers $x_1,x_2,\ldots,x_{2n}$, not all equal, such that the sum of any $n$ of the $x_i$'s is equal to the product of the other $n$ of the $x_i$'s. Help Cookie Monster determine all crunchy integers. [i]Yannick Yao[/i]

Let $\Omega$ be a circle in a plane. $2022$ pink points and $2565$ blue points are placed inside $\Omega$ such that no point has two colors and no two points are collinear with the center of $\Omega$. Prove that there exists a sector of $\Omega$ such that the angle at the center is acute and the number of blue points inside the sector is greater than the number of pink points by exactly $100$. (Note: such sector may contain no pink points.)

For what value of $ n$ is $ i\plus{}2i^2\plus{}3i^3\plus{}\cdots\plus{}ni^n\equal{}48\plus{}49i$? Note: here $ i\equal{}\sqrt{\minus{}1}$. $ \textbf{(A)}\ 24 \qquad \textbf{(B)}\ 48 \qquad \textbf{(C)}\ 49 \qquad \textbf{(D)}\ 97 \qquad \textbf{(E)}\ 98$

A rabbit, a skunk and a turtle are running a race. The skunk finishes the race in 6 minutes. The rabbit runs 3 times as quickly as the skunk. The rabbit runs 5 times as quickly as the turtle. How long does the turtle take to finish the race?

Prove that every positive rational number can be expressed uniquely as a finite sum of the form $$a_1+\frac{a_2}{2!}+\frac{a_3}{3!}+\dots+\frac{a_n}{n!},$$ where $a_n$ are integers such that $0 \leq a_n \leq n-1$ for all $n > 1$.

Let $G$ be a finite group with $n$ elements and $K$ a subset of $G$ with more than $\frac{n}{2}$ elements. Show that for any $g\in G$ one can find $h,k\in K$ such that $g=h\cdot k$.

The circumference of a circle is divided into $45$ arcs, each of length $1.$ Initially, there are $15$ snakes, each of length $1,$ occupying every third arc. Every second, each snake independently moves either one arc left or one arc right, each with probability $\tfrac{1}{2}.$ If two snakes ever touch, they merge to form a single snake occupying the arcs of both of the previous snakes, and the merged snake moves as one snake. Compute the expected number of seconds until there is only one snake left.

The sum of the reciprocals of the roots of the equation $ ax^2 \plus{} bx \plus{} c \equal{} 0$ is: $ \textbf{(A)}\ \frac {1}{a} \plus{} \frac {1}{b} \qquad \textbf{(B)}\ \minus{} \frac {c}{b} \qquad \textbf{(C)}\ \frac {b}{c} \qquad \textbf{(D)}\ \minus{} \frac {a}{b} \qquad \textbf{(E)}\ \minus{} \frac {b}{c}$

A positive integer $n$ is divisible by $3$ and $5$, but not by $2$. If $n > 20$, what is the smallest possible value of $n$?

Let $a,\ b$ be positive constants. Evaluate \[\int_0^1 \frac{\ln \frac{(x+a)^{x+a}}{(x+b)^{x+b}}}{(x+a)(x+b)\ln (x+a)\ln (x+b)}\ dx.\]

The Baltic Sea has $2016$ harbours. There are two-way ferry connections between some of them. It is impossible to make a sequence of direct voyages $C_1 - C_2 - ... - C_{1062}$ where all the harbours $C_1, . . . , C_{1062}$ are distinct. Prove that there exist two disjoint sets $A$ and $B$ of $477$ harbours each, such that there is no harbour in $A$ with a direct ferry connection to a harbour in $B.$

Sammy has a wooden board, shaped as a rectangle with length $2^{2014}$ and height $3^{2014}$. The board is divided into a grid of unit squares. A termite starts at either the left or bottom edge of the rectangle, and walks along the gridlines by moving either to the right or upwards, until it reaches an edge opposite the one from which the termite started. Depicted below are two possible paths of the termite. [img]https://cdn.artofproblemsolving.com/attachments/3/0/39f3b2aa9c61ff24ffc22b968790f4c61da6f9.png[/img] The termite’s path dissects the board into two parts. Sammy is surprised to find that he can still arrange the pieces to form a new rectangle not congruent to the original rectangle. This rectangle has perimeter $P$. How many possible values of $P$ are there?

Some of the points in the plane are white and some are blue (every point of the plane is either white or blue). Prove that for every positive number $r$: (a) there are at least two points with different color such that the distance between them is equal to $r$; (b) there are at least two points with the same color and the distance between them is equal to $r$; (c) will the statements above be true if the plane is replaced with the real line?

If $i^2=-1$, then $(1+i)^{20}-(1-i)^{20}$ equals $ \textbf{(A)}\ -1024 \qquad\textbf{(B)}\ -1024i \qquad\textbf{(C)}\ 0 \qquad\textbf{(D)}\ 1024 \qquad\textbf{(E)}\ 1024i $