Mr. A owns a home worth $ \$ 10000$. He sells it to Mr. B at a $ 10\%$ profit based on the worth of the house. Mr. B sells the house back to Mr. A at a $ 10\%$ loss. Then: $ \textbf{(A)}\ \text{A comes out even} \qquad\textbf{(B)}\ \text{A makes }\$ 1100\text{ on the deal}\qquad \textbf{(C)}\ \text{A makes }\$ 1000\text{ on the deal}$ $ \textbf{(D)}\ \text{A loses }\$ 900\text{ on the deal} \qquad\textbf{(E)}\ \text{A loses }\$ 1000\text{ on the deal}$

For how many nonempty subsets $S \subseteq \{1, 2, \ldots , 10\}$ is the sum of all elements in $S$ even? [i]Proposed by Andrew Wen[/i]

Consider two disjoint finite sets of positive integers, $A$ and $B$, have $n$ and $m$ elements, respectively. It is knows that all $k$ belonging to $A \cup B$ satisfies at least one of the conditions $k + 17 \in A$ and $k - 31 \in B$. Prove that $17n = 31m$.

The vertices of the regular $n$-gon are marked. Two players play the following game: they, in turn, select a vertex and connect it by a segment to either the adjacent vertex or the center of the $n$-gon. The winner is a player if after his move it is possible to get any vertex from any other vertex moving along segments. For each integer $n\geqslant 3$ determine who has a winning strategy.

A white equilateral triangle is split into $n^2$ equal smaller triangles by lines that are parallel to the sides of the triangle. Denote a [i]line of triangles[/i] to be all triangles that are placed between two adjacent parallel lines that forms the grid. In particular, a triangle in a corner is also considered to be a line of triangles. We are to paint all triangles black by a sequence of operations of the following kind: choose a line of triangles that contains at least one white triangle and paint this line black (a possible situation with $n=6$ after four operations is shown in Figure 1; arrows show possible next operations in this situation). Find the smallest and largest possible number of operations.

$(GDR 4)$ Find the maximal number of regions into which a sphere can be partitioned by $n$ circles.

In the acute triangle $ABC$ point $M$ is the midpoint of $AC$ and $N$ is the foot of the height of $A$ on $BC$. Point $D$ is on the circumcircle of triangle $BMN$ such that $AD$ and $BM$ are parallel and $AC$ is between the points $B$ and $D$. Prove that $BD=BC$.

Determine all positive integers $a$, $b$, $c$, $p$, where $p$ and $p+2$ are odd primes and \[2^ap^b=(p+2)^c-1.\]

Ria writes down the numbers $1,2,\cdots, 101$ in red and blue pens. The largest blue number is equal to the number of numbers written in blue and the smallest red number is equal to half the number of numbers in red. How many numbers did Ria write with red pen?

Prove that from any finite set of points on the plane, you can remove a point from the bottom in such a way that the remaining set can be split into two parts of smaller diameter. (Diameter is the maximum distance between points of the set.) [hide=original wording]Докажите, что из любого конечного множества точек на плоскости можно так удалитьо дну точку, что оставшееся множество можно разбить на две части меньшего диаметра. (Диаметр—это максимальное расстояние между точками множества.)[/hide]

Let $\alpha = \cos^{-1} \left( \frac35 \right)$ and $\beta = \sin^{-1} \left( \frac35 \right) $. $$\sum_{n=0}^{\infty}\sum_{m=0}^{\infty} \frac{\cos(\alpha n +\beta m)}{2^n3^m}$$ can be written as $\frac{A}{B}$ for relatively prime positive integers $A$ and $B$. Find $1000A +B$.

Given $a_1, a_2, ... , a_n$. Define $$b_k = \frac{a_1 + a_2 + ... + a_k}{k}$$ for $1 \le k\le n.$ Let $$C = (a_1 - b_1)^2 + (a_2 - b_2)^2 + ... + (a_n - b_n)^2, D = (a_1 - b_n)^2 + (a_2 - b_n)^2 + ... + (a_n - b_n)^2$$ Prove that $C \le D \le 2C$.

Juan and Pedro play alternately on the given grid. Each one in turn traces $1$ to $5$ routes different from the ones outlined above, that join $A$ with $B$, moving only to the right and upwards on the grid lines. Juan starts playing. The one who traces a route that passes through $C$ or $D$ loses. Prove that one of them can win regardless of how the other plays. [img]https://cdn.artofproblemsolving.com/attachments/2/7/6a24ca9c4c1c710bd41e44bfcab3d3b61b6d4f.png[/img]

The positive function $p(n)$ is defined as the number of ways that the positive integer $n$ can be written as a sum of positive integers. Show that, for all positive integers $n \ge 2$, \[2^{\lfloor \sqrt{n}\rfloor}< p(n) < n^{3 \lfloor\sqrt{n}\rfloor }.\]

If the three points of contact of a circle inscribed in a triangle are joined, the angles of the resulting triangle: $ \textbf{(A)}\ \text{are always equal to }60^\circ \\ \textbf{(B)}\ \text{are always one obtuse angle and two unequal acute angles} \\ \textbf{(C)}\ \text{are always one obtuse angle and two equal acute angles} \\ \textbf{(D)}\ \text{are always acute angles} \\ \textbf{(E)}\ \text{are always unequal to each other}$

Let $ABC$ be a triangle and its circumcircle be $\omega$. Let $I$ be the incentre of the $ABC$. Let the line $BI$ meet $AC$ at $E$ and $\omega$ at $M$ for the second time. The line $CI$ meet $AB$ at $F$ and $\omega$ at $N$ for the second time. Let the circumcircles of $BFI$ and $CEI$ meet again at point $K$. Prove that the lines $BN$, $CM$, $AK$ are concurrent.