Anton has an isosceles right triangle, which he wants to cut into $9$ triangular parts in the way shown in the picture. What is the largest number of the resulting $9$ parts that can be equilateral triangles? A more formal description of partitioning. Let triangle $ABC$ be given. We choose two points on its sides so that they go in the order $AC_1C_2BA_1A_2CB_1B_2$, and no two coincide. In addition, the segments $C_1A_2$, $A_1B_2$ and $B_1C_2$ must intersect at one point. Then the partition is given by segments $C_1A_2$, $A_1B_2$, $B_1C_2$, $A_1C_2$, $B_1A_2$ and $C_1B_2$. [img]https://cdn.artofproblemsolving.com/attachments/0/5/5dd914b987983216342e23460954d46755d351.png[/img]

Let $n\geq 2$ be a positive integer. The sets $A_{1},A_{2},\ldots, A_{n}$ and $B_{1},B_{2},\ldots, B_{n}$ of positive integers are such that $A_{i}\cap B_{j}$ is non-empty $\forall i,j\in\{1,2,\ldots ,n\}$ and $A_{i}\cap A_{j}=\o$, $B_{i}\cap B_{j}=\o$ $\forall i\neq j\in \{1,2,\ldots, n\}$. We put the elements of each set in a descending order and calculate the differences between consecutive elements in this new order. Find the least possible value of the greatest of all such differences.

For what positive integer values of $x$ is $x^4 + 6x^3 + 11x^2 + 3x + 31$ a perfect square?

Let be a subset of the interval $ (0,1) $ that contains $ 1/2 $ and has the property that if a number is in this subset, then, both its half and its successor's inverse are in the same subset. Prove that this subset contains all the rational numbers of the interval $ (0,1). $

Show that a triangle whose angles $A$, $B$, $C$ satisfy the equality \[ \frac{\sin^2 A + \sin^2 B + \sin^2 C}{\cos^2 A + \cos^2 B + \cos^2 C} = 2 \] is a rectangular triangle.

For each $M$ m-dimensional closed $C^{\infty}$ set , assign a $G(m)$ in some euclidean space $\mathbb{R}^{q}$. Denote by $\mathbb{R} \mathbb{P}^{q}$ a $q$-dimensional real projecive space. A$G(M) \subseteq \times \mathbb{R} \mathbb{P}^{q}$. The set consists of $(x,e)$ pairs for which $x \in M \subseteq \mathbb {P}^{q} $ and $e \subseteq \mathbb {R}^{q+1}= \mathbb{R}^{q} \times \mathbb{R}$ and $\mathrm{a} (0, \ldots,0,1) \in \mathbb{R}^{q+1}$ in a stretched $(m+1)$-dimensional linear subspace. Prove that if $N$ is a $n$-dimensional closed set $C^{\infty}$, then $P=G(M \times M)$ and $Q=G(M) \times G(N)$ are cobordant , that is, there exists a $(2m+2n+1)$-dimensional compact , flanged set $C^{\infty}$ with a disjoint union of $P$ and $Q$.

Let $a\in\mathbb{R}-\{0\}$. Find all functions $f: \mathbb{R}\to\mathbb{R}$ such that $f(a+x) = f(x) - x$ for all $x\in\mathbb{R}$. [i]Dan Schwartz[/i]

Let $a,b,c,x,y,$ and $z$ be complex numbers such that \[a=\dfrac{b+c}{x-2},\qquad b=\dfrac{c+a}{y-2},\qquad c=\dfrac{a+b}{z-2}.\] If $xy+yz+xz=67$ and $x+y+z=2010$, find the value of $xyz$.

Prove that there exist (a) 5 points in the plane so that among all the triangles with vertices among these points there are 8 right-angled ones; (b) 64 points in the plane so that among all the triangles with vertices among these points there are at least 2005 right-angled ones.

Prove that a square of side 2.1 units can be completely covered by seven squares of side 1 unit. Extra: Try to prove that 7 is the minimal amount.

Find all sequences of positive integers $(a_n)_{n\ge 1}$ which satisfy $$a_{n+2}(a_{n+1}-1)=a_n(a_{n+1}+1)$$ for all $n\in \mathbb{Z}_{\ge 1}$. [i](Bogdan Blaga)[/i]

On a lottery ticket a player has to mark $6$ numbers from $36$. Then $6$ numbers from these $36$ are drawn randomly and the ticket wins if none of the numbers that came out is marked on the ticket. Prove that a) it is possible to mark the numbers on $9$ tickets so that one of these tickets always wins, b) it is not possible to mark the numbers on $8$ tickets so that one of tickets always wins.

Let $ABC$ be a non-equilateral triangle and let $M_a$, $M_b$, $M_c$ be the midpoints of the sides $BC$, $CA$, $AB$, respectively. Let $S$ be a point lying on the Euler line. Denote by $X$, $Y$, $Z$ the second intersections of $M_aS$, $M_bS$, $M_cS$ with the nine-point circle. Prove that $AX$, $BY$, $CZ$ are concurrent.

Let $m,n\ge2$ be positive integers. On an $m\times n$ chessboard, some unit squares are occupied by rooks such that each rook attacked by odd number of other rooks. Determine the maximum number of rooks that can be placed on the chessboard.

Let $M$ be an arbitrary positive real number greater than $1$, and let $a_1,a_2,...$ be an infinite sequence of real numbers with $a_n\in [1,M]$ for any $n\in \mathbb{N}$. Show that for any $\epsilon\ge 0$, there exists a positive integer $n$ such that $$\frac{a_n}{a_{n+1}}+\frac{a_{n+1}}{a_{n+2}}+\cdots+\frac{a_{n+t-1}}{a_{n+t}}\ge t-\epsilon$$ holds for any positive integer $t$.

A circle $ \omega$ with center $ O$ is tangent to the rays of an angle $ BAC$ at $ B$ and $ C$. Point $ Q$ is taken inside the angle $ BAC$. Assume that point $ P$ on the segment $ AQ$ is such that $ AQ\perp OP$. The line $ OP$ intersects the circumcircles $ \omega_{1}$ and $ \omega_{2}$ of triangles $ BPQ$ and $ CPQ$ again at points $ M$ and $ N$. Prove that $ OM \equal{} ON$.