In triangle $ABC$ the bisector of angle $A$, the perpendicular to side $AB$ from its midpoint, and the altitude from vertex $B$, intersect in the same point. Prove that the bisector of angle $A$, the perpendicular to side $AC$ from its midpoint, and the altitude from vertex $C$ also intersect in the same point.

Find all possible values of $n \ge 1$ for which there exist $n$ consecutive positive integers whose sum is a prime number.

Bucket $A$ contains 3 litres of syrup. Bucket $B$ contains $n$ litres of water. Bucket $C$ is empty. We can perform any combination of the following operations: - Pour away the entire amount in bucket $X$, - Pour the entire amount in bucket $X$ into bucket $Y$, - Pour from bucket $X$ into bucket $Y$ until buckets $Y$ and $Z$ contain the same amount. (a) How can we obtain 10 litres of 30% syrup if $n = 20$? (b) Determine all possible values of $n$ for which the task in (a) is possible.

A positive integer $a > 1$ is given (in decimal notation). We copy it twice and obtain a number $b = \overline{aa}$ which happens to be a multiple of $a^2$. Find all possible values of $b/a^2$.

Two 10-digit integers are called neighbours if they differ in exactly one digit (for example, integers $1234567890$ and $1234507890$ are neighbours). Find the maximal number of elements in the set of 10-digit integers with no two integers being neighbours.

The sum of all terms of a finite arithmetical progression of integers is a power of two. Prove that the number of terms is also a power of two.

What is the maximal number of checkers that can be placed on an $8\times 8$ checkerboard so that each checker stands on the middle one of three squares in a row diagonally, with exactly one of the other two squares occupied by another checker?

Each day, the price of the shares of the corporation “Soap Bubble, Limited” either increases or decreases by $n$ percent, where $n$ is an integer such that $0 < n < 100$. The price is calculated with unlimited precision. Does there exist an $n$ for which the price can take the same value twice?

Two circles intersect in points $A$ and $B$. Their common tangent nearer $B$ touches the circles at points $E$ and $F$, and intersects the extension of $AB$ at the point $M$. The point $K$ is chosen on the extention of $AM$ so that $KM = MA$. The line $KE$ intersects the circle containing $E$ again at the point $C$. The line $KF$ intersects the circle containing $F$ again at the point $D$. Prove that the points $A, C$ and $D$ are collinear.

All sides of a polygonal billiard table are in one of two perpendicular directions. A tiny billiard ball rolls out of the vertex $A$ of an inner $90^o$ angle and moves inside the billiard table, bouncing off its sides according to the law “angle of reflection equals angle of incidence”. If the ball passes a vertex, it will drop in and srays there. Prove that the ball will never return to $A$.

At the beginning of a two-player game, the number $2004!$ is written on the blackboard. The players move alternately. In each move, a positive integer smaller than the number on the blackboard and divisible by at most $20$ different prime numbers is chosen. This is subtracted from the number on the blackboard, which is erased and replaced by the difference. The winner is the player who obtains $0$. Does the player who goes first or the one who goes second have a guaranteed win, and how should that be achieved?

Segments $AB, BC$ and $CD$ of the broken line $ABCD$ are equal and are tangent to a circle with centre at the point $O$. Prove that the point of contact of this circle with $BC$, the point $O$ and the intersection point of $AC$ and $BD$ are collinear.

Perimeter of a convex quadrilateral is $2004$ and one of its diagonals is $1001$. Can another diagonal be $1$ ? $2$ ? $1001$ ?

Arithmetical progression $a_1, a_2, a_3, a_4,...$ contains $a_1^2 , a_2^2$ and $a_3^2$ at some positions. Prove that all terms of this progression are integers.

Two $10$-digit integers are called neighbours if they differ in exactly one digit (for example, integers $1234567890$ and $1234507890$ are neighbours). Find the maximal number of elements in the set of $10$-digit integers with no two integers being neighbours.

The perpendicular projection of a triangular pyramid on some plane has the largest possible area. Prove that this plane is parallel to either a face or two opposite edges of the pyramid.

The parabola $y = x^2$ intersects a circle at exactly two points $A$ and $B$. If their tangents at $A$ coincide, must their tangents at $B$ also coincide?

The audience shuffles a deck of $36$ cards, containing $9$ cards in each of the suits spades, hearts, diamonds and clubs. A magician predicts the suit of the cards, one at a time, starting with the uppermost one in the face-down deck. The design on the back of each card is an arrow. An assistant examines the deck without changing the order of the cards, and points the arrow on the back each card either towards or away from the magician, according to some system agreed upon in advance with the magician. Is there such a system which enables the magician to guarantee the correct prediction of the suit of at least (a) $19$ cards; (b) $20$ cards?

Is it possible to arrange numbers from 1 to 2004 in some order so that the sum of any 10 consecutive numbers is divisble by 10?

A box contains red, green, blue, and white balls, 111 balls in all. If you take out 100 balls without looking, then there will always be 4 balls of different colors among them. What is the smallest number of balls you must take out without looking to guarantee that among them there will always be balls of at least 3 different colors?

We have a number of towns, with bus routes between some of them (each bus route goes from a town to another town without any stops). It is known that you can get from any town to any other by bus (possibly changing buses several times). Mr. Ivanov bought one ticket for each of the bus routes (a ticket allows single travel in either direction, but not returning on the same route). Mr. Petrov bought n tickets for each of the bus routes. Both Ivanov and Petrov started at town A. Ivanov used up all his tickets without buying any new ones and finished his travel at town B. Petrov, after using some of his tickets, got stuck at town X: he can not leave it without buying a new ticket. Prove that X is either A or B.

We have a circle and a line which does not intersect the circle. Using only compass and straightedge, construct a square whose two adjacent vertices are on the circle, and two other vertices are on the given line (it is known that such a square exists).

How many different ways are there to write 2004 as a sum of one or more positive integers which are all "aproximately equal" to each other? Two numbers are called aproximately equal if their difference is at most 1. The order of terms does not matter: two ways which only differ in the order of terms are not considered different.

Let us call a triangle rational if each of its angles is a rational number when measured in degrees. Let us call a point inside triangle rational if joining it to the three vertices of the triangle we get three rational triangles. Show that any acute rational triangle contains at least three distinct rational points.

The incircle of the triangle ABC touches the sides BC, AC, and AB at points A', B', and C', respectively. It is known that AA'=BB'=CC'. Does the triangle ABC have to be equilateral? (I am very interested in ingenious solution of this problem, because I found an ugly one using Stewart's theorem and tons of algebra during the contest).

What is the maximal number of knights that can be placed on the usual 8x8 chessboard so that each of then threatens at most 7 others?

Vanya has chosen two positive numbers, x and y. He wrote the numbers x+y, x-y, x/y, and xy, and has shown these numbers to Petya. However, he didn't say which of the numbers was obtained from which operation. Show that Petya can uniquely recover x and y.

Let K be a point on the side BC of the triangle ABC. The incircles of the triangles ABK and ACK touch BC at points M and N, respectively. Show that BM\cdot CN>KM \cdot KN.

Two persons are dividing a piece of cheese. The first person cuts it into two pieces, then the second person cuts one of these pieces into two, then again the first person cuts one of the pieces into two, and so until they have 5 pieces. After that the first person chooses one of the pieces, then the second person chooses one of remaining pieces and so on until all pieces are taken. For each of the players, what is the maximal amount of cheese he can get for certain, regardless of the other's actions?

Let A and B be two rectangles such that it is possible to get rectangle similar to A by putting together rectangles equal to B. Show that it is possible to get rectangle similar to B by putting together rectangles equal to A.

Three circles pass through point X. Their intersection points (other than X) are denoted A, B, C. Let A' be the second point of intersection of line AX and the circle circumscribed around triangle BCX, and define similarly points B', C'. Prove that triangles ABC', AB'C, and A'BC are similar.

A box contains red, blue, and white balls, $100$ balls in total. It is known that among any $26$ of them there are always $10$ balls of the same color. Find the minimal number $N$ such that among any $N$ balls there are always $30$ balls of the same color.

P(x) and Q(x) are polynomials of positive degree such that for all x P(P(x))=Q(Q(x)) and P(P(P(x)))=Q(Q(Q(x))). Does this necessarily mean that P(x)=Q(x)?

For which values of N is it possible to write numbers from 1 to N in some order so that for any group of two or more consecutive numbers, the arithmetic mean of these numbers is not whole?

Functions f and g are defined on the whole real line and are mutually inverse: g(f(x))=x, f(g(y))=y for all x, y. It is known that f can be written as a sum of periodic and linear functions: f(x)=kx+h(x) for some number k and a periodic function h(x). Show that g can also be written as a sum of periodic and linear functions. (A functions h(x) is called periodic if there exists a non-zero number d such that h(x+d)=h(x) for any x.)

Two persons are playing the following game. They have a pile of stones and take turns removing stones from it, with the first player taking the first turn. At each turn, the first player removes either 1 or 10 stones from the pile, and the second player removes either m or n stones. The player who can not make his move loses. It is known that for any number of stones in the pile, the first player can always win (regardless of the second player's moves). What are the possible values of m and n?

A circle with the center $I$ is entirely inside of a circle with center $O$. Consider all possible chords $AB$ of the larger circle which are tangent to the smaller one. Find the locus of the centers of the circles circumscribed about the triangle $AIB$.

Let n be a fixed prime number >3. A triangle is said to be admissible if the measure of each of its angles is of the form $\frac{m\cdot 180^{\circ}}{n}$ for some positive integer m. We are given one admissible triangle. Every minute we cut one of the triangles we already have into two admissible triangles so that no two of the triangles we have after cutting are similar. After some time, it turns out that no more cuttings are possible. Prove that at this moment, the triangles we have contain all possible admissible triangles (we do not distinguish between triangles which have same sets of angles, i.e. similar triangles).

Let AOB and COD be angles which can be identified by a rotation of the plane (such that rays OA and OC are identified). A circle is inscribed in each of these angles; these circles intersect at points E and F. Show that angles AOE and DOF are equal.