Find all pairs $(n,r)$ with $n$ a positive integer and $r$ a real such that $2x^2+2x+1$ divides $(x+1)^n - r$.

A class has $n > 1$ boys and $n$ girls. For each arrangement $X$ of the class in a line let $f(X)$ be the number of ways of dividing the line into two non-empty segments, so that in each segment the number of boys and girls is equal. Let the number of arrangements with $f(X) = 0$ be $A$, and the number of arrangements with $f(X) = 1$ be $B$. Show that $B = 2A$.

Let $\Gamma$ be a circle and let $d$ be a line such that $\Gamma$ and $d$ have no common points. Further, let $AB$ be a diameter of the circle $\Gamma$; assume that this diameter $AB$ is perpendicular to the line $d$, and the point $B$ is nearer to the line $d$ than the point $A$. Let $C$ be an arbitrary point on the circle $\Gamma$, different from the points $A$ and $B$. Let $D$ be the point of intersection of the lines $AC$ and $d$. One of the two tangents from the point $D$ to the circle $\Gamma$ touches this circle $\Gamma$ at a point $E$; hereby, we assume that the points $B$ and $E$ lie in the same halfplane with respect to the line $AC$. Denote by $F$ the point of intersection of the lines $BE$ and $d$. Let the line $AF$ intersect the circle $\Gamma$ at a point $G$, different from $A$. Prove that the reflection of the point $G$ in the line $AB$ lies on the line $CF$.

Given $a, b, p$ arbitrary integers. Prove that there always exist relatively prime (i.e. that have no common divisor) $k$ and $l$, that $(ak + bl)$ is divisible by $p$.

For any function $f(x)$, in the same rectangular coordinates, figures of function $y=f(x-1)$ and $y=f(-x+1)$ $\text{(A)}$ are symmetrical about $x$-axis $\text{(B)}$ are symmetrical about line $x=1$ $\text{(C)}$ are symmetrical about line $x=-1$ $\text{(D)}$ are symmetrical about $y$-axis

Find all square numbers $ S_1$ and $ S_2$ such that $ S_1 \minus{} S_2 \equal{} 1989.$

In a triangle $ABC$ with incircle $\omega$ and incenter $I$ , the segments $AI$ , $BI$ , $CI$ cut $\omega$ at $D$ , $E$ , $F$ , respectively. Rays $AI$ , $BI$ , $CI$ meet the sides $BC$ , $CA$ , $AB$ at $L$ , $M$ , $N$ respectively. Prove that: \[AL+BM+CN \leq 3(AD+BE+CF)\] When does equality occur?

A composite positive integer is a product $ab$ with $a$ and $b$ not necessarily distinct integers in $\{2,3,4,\dots\}$. Show that every composite positive integer is expressible as $xy+xz+yz+1$, with $x,y,z$ positive integers.

Let $S=\{-100,-99,-98,\ldots,99,100\}$. Choose a $50$-element subset $T$ of $S$ at random. Find the expected number of elements of the set $\{|x|:x\in T\}$.

There are $2010$ red cards and $2010$ white cards. All of these $4020$ cards are shuffled and dealt in two randomly to each of the $2010$ round table players. The game consists of several rounds, each of which players simultaneously hand over cards to each other according to the following rules. If a player holds at least one red card, he passes one red card to the player sitting to his left, otherwise he transfers one white card to the left. The game ends after the round when each player has one red card and one white card. Determine as many rounds as possible.

Let $ x,y,z$ be positive real numbers,satisfying equality $ x^{2}\plus{}y^{2}\plus{}z^{2}\equal{}25$. Find the minimal possible value of the expression $ \frac{xy}{z} \plus{} \frac{yz}{x} \plus{} \frac{zx}{y}$.

Is it possible to divide the integers from $1$ to $100$ inclusive into $50$ pairs such that for $1\le k\le 50$, the difference between the two numbers in the $k$-th pair is $k$? (V Proizvolov)

Given $r\in\mathbb{R}$. Alice and Bob plays the following game: An equation with blank is written on the blackboard as below: $$S=|\Box-\Box|+|\Box-\Box|+|\Box-\Box|$$ Every round, Alice choose a real number from $[0,1]$ (not necessary to be different from the numbers chosen before) and Bob fill it in an empty box. After 6 rounds, every blank is filled and $S$ is determined at the same time. If $S\ge r$ then Alice wins, otherwise Bob wins. Find all $r$ such that Alice can guarantee her victory.

Three players $A,B$ and $C$ play a game with three cards and on each of these $3$ cards it is written a positive integer, all $3$ numbers are different. A game consists of shuffling the cards, giving each player a card and each player is attributed a number of points equal to the number written on the card and then they give the cards back. After a number $(\geq 2)$ of games we find out that A has $20$ points, $B$ has $10$ points and $C$ has $9$ points. We also know that in the last game B had the card with the biggest number. Who had in the first game the card with the second value (this means the middle card concerning its value).

Given positive integers $n_1<n_2<...<n_{2000}<10^{100}$. Prove that we can choose from the set $\{n_1,...,n_{2000}\}$ nonempty, disjont sets $A$ and $B$ which have the same number of elements, the same sum and the same sum of squares.

A [i]windmill[/i] is a closed line segment of unit length with a distinguished endpoint, the [i]pivot[/i]. Let $S$ be a finite set of $n$ points such that the distance between any two points of $S$ is greater than $c$. A configuration of $n$ windmills is [i]admissible[/i] if no two windmills intersect and each point of $S$ is used exactly once as a pivot. An admissible configuration of windmills is initially given to Geoff in the plane. In one operation Geoff can rotate any windmill around its pivot, either clockwise or counterclockwise and by any amount, as long as no two windmills intersect during the process. Show that Geoff can reach any other admissible configuration in finitely many operations, where (i) $c = \sqrt 3$, (ii) $c = \sqrt 2$. [i]Proposed by Michael Ren[/i]