Each of the 450 members of a parliament gives a slap in the face to exactly one of his colleagues. Prove that after that they can choose a committee consisting of 150 members, none of whom has been slapped in the face by any other member of the committee. (Folklore)

In triangle $ABC$, $AB = AC$. Point $D$ is the midpoint of side $BC$. Point $E$ lies outside the triangle $ABC$ such that $CE \perp AB$ and $BE = BD$. Let $M$ be the midpoint of segment $BE$. Point $F$ lies on the minor arc $\widehat{AD}$ of the circumcircle of triangle $ABD$ such that $MF \perp BE$. Prove that $ED \perp FD.$ [asy] defaultpen(fontsize(10)); size(6cm); pair A = (3,10), B = (0,0), C = (6,0), D = (3,0), E = intersectionpoints( Circle(B, 3), C--(C+100*dir(B--A)*dir(90)) )[1], M = midpoint(B--E), F = intersectionpoints(M--(M+50*dir(E--B)*dir(90)), circumcircle(A,B,D))[0]; dot(A^^B^^C^^D^^E^^M^^F); draw(B--C--A--B--E--D--F--M^^circumcircle(A,B,D)); pair point = extension(M,F,A,D); pair[] p={A,B,C,D,E,F,M}; string s = "A,B,C,D,E,F,M"; int size = p.length; real[] d; real[] mult; for(int i = 0; i<size; ++i) { d[i] = 0; mult[i] = 1;} d[4] = -50; string[] k= split(s,","); for(int i = 0;i<p.length;++i) { label("$"+k[i]+"$",p[i],mult[i]*dir(point--p[i])*dir(d[i])); }[/asy]

You have to organize a fair procedure to randomly select someone from $ n$ people so that every one of them would be chosen with the probability $ \frac{1}{n}$. You are allowed to choose two real numbers $ 0<p_1<1$ and $ 0<p_2<1$ and order two coins which satisfy the following requirement: the probability of tossing "heads" on the first coin $ p_1$ and the probability of tossing "heads" on the second coin is $ p_2$. Before starting the procedure, you are supposed to announce an upper bound on the total number of times that the two coins are going to be flipped altogether. Describe a procedure that achieves this goal under the given conditions.

The diagram below shows a rectangle and two triangles with areas $20$ and $4$. What is the area of the shaded triangle? [asy] size(3cm); draw((0,0)--(7,0)--(7,5)--(0,5)--(0,0)); draw((4,0)--(0,5)); draw((7,0)--(0,5)); draw((4,0)--(7,5)); filldraw((0,0)--(4,0)--(0,5)--cycle, lightgray); label("$4$",(5.5,0.5)); label("$20$",(4,4)); [/asy] $\textbf{(A) } 12\qquad\textbf{(B) } 14\qquad\textbf{(C) } 16\qquad\textbf{(D) } 18\qquad\textbf{(E) } 20$

A company has five directors. The regulations of the company require that any majority (three or more) of the directors should be able to open its strongroom, but any minority (two or less) should not be able to do so. The strongroom is equipped with ten locks, so that it can only be opened when keys to all ten locks are available. Find all positive integers $n$ such that it is possible to give each of the directors a set of keys to $n$ different locks, according to the requirements and regulations of the company.

Let $ \triangle{ABC}$ be a triangle with $ AB\not\equal{}AC$. The incircle with centre $ I$ touches $ BC$, $ CA$, $ AB$ at $ D$, $ E$, $ F$, respectively. Furthermore let $ M$ the midpoint of $ EF$ and $ AD$ intersect the incircle at $ P\not\equal{}D$. Show that $ PMID$ ist cyclic.

In $\triangle ABC, BC=a, CA=b, AB=c,$ and $\Gamma$ is its circumcircle. $(1)$ Determine a necessary and sufficient condition on $a,b$ and $c$ if there exists a unique point $P(P\neq B, P\neq C)$ on the arc $BC$ of $\Gamma$ not passing through point $A$ such that $PA=PB+PC$. $(2)$ Let $P$ be the unique point stated in $(1)$. If $AP$ bisects $BC$, prove that $\angle BAC<60^{\circ}$.

On each unit square of a $9 \times 9$ square, there is a bettle. Simultaneously, at the whistle, each bettle moves from its unit square to another one which has only a common vertex with the original one (thus in diagonal). Some bettles can go to the same unit square. Determine the minimum number of empty unit squares after the moves. Pierre.

Find all positive integers $ n $ with the following property: It is possible to fill a $ n \times n $ chessboard with one of arrows $ \uparrow, \downarrow, \leftarrow, \rightarrow $ such that 1. Start from any grid, if we follows the arrows, then we will eventually go back to the start point. 2. For every row, except the first and the last, the number of $ \uparrow $ and the number of $ \downarrow $ are the same. 3. For every column, except the first and the last, the number of $ \leftarrow $ and the number of $ \rightarrow $ are the same.

Determine whether there exists a positive integer $n$ such that the sum of the digits of $n^2$ is $2002$.

A round-robin tournament is one where each team plays every other team exactly once. Five teams take part in such a tournament getting: $3$ points for a win, $1$ point for a draw and $0$ points for a loss. At the end of the tournament the teams are ranked from first to last according to the number of points. (a) Is it possible that at the end of the tournament, each team has a different number of points, and each team except for the team ranked last has exactly two more points than the next-ranked team? (b) Is this possible if there are six teams in the tournament instead?

Find a four-digit number that is perfect square and such that the first two digits are the same and the last two as well.

Given an integer $h > 1$. Let's call a positive common fraction (not necessarily irreducible) [i]good[/i] if the sum of its numerator and denominator is equal to $h$. Let's say that a number $h$ is [i]remarkable[/i] if every positive common fraction whose denominator is less than $h$ can be expressed in terms of good fractions (not necessarily various) using the operations of addition and subtraction. Prove that $h$ is remarkable if and only if it is prime. (Recall that an common fraction has an integer numerator and a natural denominator.)

Let $f(n)$ be a sequence of integers defined by $f(1)=1, f(2)=1,$ and $f(n)=f(n-1)+(-1)^nf(n-2)$ for all integers $n \geq 3.$ What is the value of $f(20)+f(21)?$

Given a positive integer $ n$, for all positive integers $ a_1, a_2, \cdots, a_n$ that satisfy $ a_1 \equal{} 1$, $ a_{i \plus{} 1} \leq a_i \plus{} 1$, find $ \displaystyle \sum_{i \equal{} 1}^{n} a_1a_2 \cdots a_i$.

Let $ R$, $ r$ be respectively the circumradius and inradius of a regular $ 1986$-gonal pyramid. Prove that \[ \frac{R}{r}\ge 1\plus{}\frac{1}{\cos\frac{\pi}{1986}}\] and find the total area of the surface of the pyramid when the equality occurs.

If a b c positive reals smaller than 1, prove: a+b+c+2abc>ab+bc+ca+2(abc)^(1/2)

$p, q, r$ are distinct prime numbers which satisfy $$2pqr + 50pq = 7pqr + 55pr = 8pqr + 12qr = A$$ for natural number $A$. Find all values of $A$.

The sum of three consecutive integers is $15$. Determine their product.

For each positive integer $\,n,\;S(n)\,$ is defined to be the greatest integer such that, for every positive integer $\,k\leq S(n),\;n^{2}\,$ can be written as the sum of $\,k\,$ positive squares. [list=a] [*] Prove that $S(n)\leq n^{2}-14$ for each $n\geq 4$. [*] Find an integer $n$ such that $S(n)=n^{2}-14$. [*] Prove that there are infinitely many integers $n$ such that $S(n)=n^{2}-14$. [/list]

If $8/19$ of the product of largest two elements of a positive integer set is not greater than the sum of other elements, what is the minimum possible value of the largest number in the set? $ \textbf{(A)}\ 8 \qquad\textbf{(B)}\ 12 \qquad\textbf{(C)}\ 13 \qquad\textbf{(D)}\ 19 \qquad\textbf{(E)}\ 20 $

Determine all positive integers $n$ for which $2^{n+1}-n^2$ is a prime number.

Find the sum of the indexes of the singular points other than zero of the vector field \[z\overline{z}^2+z^4+2\overline{z}^4\]

Let $ABCD$ be a square. Choose points $E$ on $BC$ and $F$ on $CD$ so that $\angle EAF=45^\circ$ and so that neither $E$ nor $F$ is a vertex of the square. The lines $AE$ and $AF$ intersect the circumcircle of the square in the points $G$ and $H$ distinct from $A$, respectively. Show that the lines $EF$ and $GH$ are parallel.

The natural numbers are colored green or blue so that: $\bullet$ The sum of a green and a blue is blue; $\bullet$ The product of a green and a blue is green. How many ways are there to color the natural numbers with these rules, so that $462$ are blue and $2016$ are green?