Solve in integers the equation \[ x^2+xy+y^2 = \left(\frac{x+y}{3}+1\right)^3. \]

Four people are playing rock-paper-scissors. They each play one of the three options (rock, paper, or scissors) independently at random, with equal probability of each choice. Compute the probability that someone beats everyone else. (In rock-paper-scissors, a player that plays rock beats a player that plays scissors, a player that plays paper beats a player that plays rock, and a player that plays scissors beats a player that plays paper.)

There's a large pile of cards. On each card a number from $1,2,\ldots n$ is written. It is known that sum of all numbers on all of the cards is equal to $k\cdot n!$ for some $k$. Prove that it is possible to arrange cards into $k$ stacks so that sum of numbers written on the cards in each stack is equal to $n!$.

In a group of nine people each person shakes hands with exactly two of the other people from the group. Let N be the number of ways this handshaking can occur. Consider two handshaking arrangements different if and only if at least two people who shake hands under one arrangement do not shake hands under the other arrangement. Find the remainder when N is divided by 1000.

In Lineland there are $n\geq1$ towns, arranged along a road running from left to right. Each town has a [i]left bulldozer[/i] (put to the left of the town and facing left) and a [i]right bulldozer[/i] (put to the right of the town and facing right). The sizes of the $2n$ bulldozers are distinct. Every time when a left and right bulldozer confront each other, the larger bulldozer pushes the smaller one off the road. On the other hand, bulldozers are quite unprotected at their rears; so, if a bulldozer reaches the rear-end of another one, the first one pushes the second one off the road, regardless of their sizes. Let $A$ and $B$ be two towns, with $B$ to the right of $A$. We say that town $A$ can [i]sweep[/i] town $B$ [i]away[/i] if the right bulldozer of $A$ can move over to $B$ pushing off all bulldozers it meets. Similarly town $B$ can sweep town $A$ away if the left bulldozer of $B$ can move over to $A$ pushing off all bulldozers of all towns on its way. Prove that there is exactly one town that cannot be swept away by any other one.

Triangle $ABC$ is given with angles $\angle ABC = 60^o$ and $\angle BCA = 100^o$. On the sides AB and AC, the points $D$ and $E$ are chosen, respectively, in such a way that $\angle EDC = 2\angle BCD = 2\angle CAB$. Find the angle $\angle BED$.

Let triangle $ABC$ have $\angle A = 70^\circ, \angle B = 60^\circ$, and $\angle C = 50^\circ$. Extend altitude $BH$ past $H$ to point $D$ so that $BD = BC$. Find $\angle BDA$ in degrees.

The numbers $1,...,100$ are written on the board. Tzvi wants to colour $N$ numbers in blue, such that any arithmetic progression of length 10 consisting of numbers written on the board will contain blue number. What is the least possible value of $N$?

Four couples are to be seated in a row. If it is required that each woman may only sit next to her husband or another woman, how many different possible seating arrangements are there?

In a set $X$ of n people, some know each other and others do not, where the relationship to know is symmetric; that is, if $ A$ knows $ B$. then $ B$ knows $ A$. On the other hand, given any$ 4$ people: $A, B, C$ and $D$: if $A$ knows $B$, $B$ knows $C$ and $C$ knows $D$, then it happens at least one of the following three: $A$ knows $C, B$ knows $D$ or $A$ knows $D$. Prove that $X$ can be partition into two sets $Y$ and $Z$ so that all elements of $Y$ know all those of $Z$ or no element in $Y$ knows any in $Z$.

Prove that there aren't any positive integrer numbers $x,y,z$ such that $x^2+y^2=3z^2$.

Consider a sequence of eleven squares that have side lengths $3, 6, 9, 12,\ldots, 33$. Eleven copies of a single square each with area $A$ have the same total area as the total area of the eleven squares of the sequence. Find $A$.

Integers $1,2, ...,2n$ are arbitrarily assigned to boxes labeled with numbers $1, 2,..., 2n$. Now, we add the number assigned to the box to the number on the box label. Show that two such sums give the same remainder modulo $2n$.

Let $ABC$ be a triangle with $\angle A = 90^o$ and let $P$ be a point on the hypotenuse $BC$. Prove that $$\frac{AB^2}{PC}+\frac{AC^2}{PB} \ge \frac{BC^3}{PA^2 + PB \cdot PC}$$

In a mathematical competition, in which $6$ problems were posed to the participants, every two of these problems were solved by more than $\frac 25$ of the contestants. Moreover, no contestant solved all the $6$ problems. Show that there are at least $2$ contestants who solved exactly $5$ problems each. [i]Radu Gologan and Dan Schwartz[/i]

In a regular square room of side length $2\sqrt{2}$ ft, two cats that can see $2$ feet ahead of them are randomly placed into the four corners such that they do not share the same corner. If the probability that they don't see the mouse, also placed randomly into the room can be expressed as $\frac{a-b\pi}{c},$ where $a,b,c$ are positive integers with a greatest common factor of $1,$ then find $a+b+c.$ [i]Proposed by Ada Tsui[/i]

Let $ABC$ be an acute-angled triangle with $BC > AB$, such that the points $A$, $H$, $I$ and $C$ are concyclic (where $H$ is the orthocenter and $I$ is the incenter of triangle $ABC$). The line $AC$ intersects the circumcircle of triangle $BHC$ at point $T$, and the line $BC$ intersects the circumcircle of triangle $AHC$ at point $P$. If the lines $PT$ and $HI$ are parallel, determine the measures of the angles of triangle $ABC$.

Let $P$ be a cubic polynomial with $P(0) = k, P(1) = 2k,$ and $P(-1) = 3k$. What is $P(2) + P(-2)$? $ \textbf{(A) }0 \qquad\textbf{(B) }k \qquad\textbf{(C) }6k \qquad\textbf{(D) }7k\qquad\textbf{(E) }14k\qquad $

There are $110$ points in a unit square. Show that some four of these points reside in a circle whose radius is $1/8.$

For what digit $d$ is the base $9$ numeral $7d35_9$ divisible by $8?$ [i]Proposed by Alex Li[/i]

$p$ is a prime. Find all relatively prime positive integers $m$, $n$ such that \[ \frac{m}{n}+\frac{1}{p^2}=\frac{m+p}{n+p} \]

The integers $1, 2, \dots, 64$ are written in the squares of a $8 \times 8$ chess board, such that for each $1 \le i < 64$, the numbers $i$ and $i+1$ are in squares that share an edge. What is the largest possible sum that can appear along one of the diagonals?

Given is a function $f:\mathbb{R}\rightarrow \mathbb{R}$ such that $|f(x+y)-f(x)-f(y)|\leq 1$. Prove the existence of an additive function $g:\mathbb{R}\rightarrow \mathbb{R}$ (that is $g(x+y)=g(x)+g(y)$) such that $|f(x)-g(x)|\leq 1$ for any $x \in \mathbb{R}$

An equilateral triangle is divided into $n^2$ congruent equilateral triangles. A spider stands at one of the vertices, a fly at another. Alternately each of them moves to a neighbouring vertex. Prove that the spider can always catch the fly.

You are bargaining with a salesperson for the price of an item. Your first offer is $a$ dollars and theirs is $b$ dollars. After you raise your offer by a certain percentage and they lower their offer by the same percentage, you arrive at an agreed price. What is that price, in terms of $a$ and $b$?