Let be given $n\ge 3$ distinct points in the plane. Is it always possible to find a circle which passes through three of the points and contains none of the remaining points (a) inside the circle. (b) inside the circle or on its boundary?

An ant is on the Cartesian plane. In a single move, the ant selects a positive integer $k$, then either travels [list] [*] $k$ units vertically (up or down) and $2k$ units horizontally (left or right); or [*] $k$ units horizontally (left or right) and $2k$ units vertically (up or down). [/list] Thus, for any $k$, the ant can choose to go to one of eight possible points. \\ Prove that, for any integers $a$ and $b$, the ant can travel from $(0, 0)$ to $(a, b)$ using at most $3$ moves.

Consider an infinite chessboard whose rows and columns are indexed by positive integers. At most one coin can be put on any cell of the chessboard. Let be given two arbitrary sequences ($a_n$) and ($b_n$) of positive integers ($n \in N$). Assuming that infinitely many coins are available, prove that they can be arranged on the chessboard so that there are $a_n$ coins in the $n$-th row and $b_n$ coins in the $n$-th column for all $n$.

Some $n > 2$ lamps are cyclically connected: lamp $1$ with lamp $2$, ... , lamp $k$ with $k+1$, ... , lamp $n$ with lamp $1$. At the beginning, all lamps are off. When one pushes the switch of a lamp, that lamp and the two ones connected to it change status (from off to on, or vice-versa). Determine the number of configurations of lamps reachable from the initial one, through some set of switches being pushed.

Caltech's 900 students are evenly spaced along the circumference of a circle. How many equilateral triangles can be formed with at least two Caltech students as vertices?

In the real axis, there is bug standing at coordinate $x=1$. Each step, from the position $x=a$, the bug can jump to either $x=a+2$ or $x=\frac{a}{2}$. Show that there are precisely $F_{n+4}-(n+4)$ positions (including the initial position) that the bug can jump to by at most $n$ steps. Recall that $F_n$ is the $n^{th}$ element of the Fibonacci sequence, defined by $F_0=F_1=1$, $F_{n+1}=F_n+F_{n-1}$ for all $n\geq 1$.

Two coloured points are marked on a line, with the blue one at the left and the red one at the right. You may add to the line two neighbouring points of the same color (both red or both blue) or delete two such points (neighbouring means that there is no coloured point between these two). Prove that after several such transformation you cannot again get only two points on the line in which the red one is at the left and the blue one is at the right. (A Belov)

The numbers $1$ through $16$ are to be written in the cells of a $4\times 4$ board. (a) Prove that this can be done in such a way that any two numbers in cells that share a side differ by at most $4$. (b) Prove that this cannot be done in such a way that any two numbers in cells that share a side differ by at most $3$.

Let $A_1A_2...A_{2010}$ be a regular $2010$-gon. Find the number of obtuse triangles whose vertices are among $A_1$, $A_2$,$ ...$, $A_{2010}$.

A natural number is written in each box of the $13 \times 13$ grid area. Prove that you can choose $2$ rows and $4$ columns such that the sum of the numbers written at their $8$ intersections is divisible by $8$.

I have a $2$ by $4$ grid of squares; how many ways can I shade at least one of the squares such that no two shaded squares share an edge?

Every day, some pairs of families living in a city may choose to exchange their apartments. A family may only participate in one exchange in a day. Prove that any complex exchange of apartments between several families can be carried out in two days. [i]Proposed by N. Konstantinov and A. Shnirelman[/i]

Let us call a figure on a sheet of squares an arbitrary finite set of connected squares, i.e. a set of squares in which it is possible to go from any square to any other by walking only on the squares of this figure. Prove that for every natural n there exists such a figure on the sheet of squares that it can be cut into "corners" (Fig. 1) exactly in $F_n$ ways, where $F_n$ s the $n$-th Fibonacci number (in the series of Fibonacci numbers $F_1 = F_2 = 1$ and for each $i > 1$ holds $F_{i+2} = F_{i+1} + F_i$). For example, a rectangle of $2 \times 3$ squares can be cut at the corners in exactly two ways (Fig. $2$). [img]https://cdn.artofproblemsolving.com/attachments/6/5/c82340623ff5f92a410bd73755ba8cbdc501ff.png[/img]

An airline offer $2000$ two-way routes connecting $64$ towns in a country. Show that it is possible to reach any town from any other town using the offered routes.

The integers from 1 to 49 are written in a $7\times 7$ table, such that for any $k\in\{1,2,\ldots,7\}$ the product of the numbers in the $k$-th row equals the product of the numbers in the $(8-k)$-th row. [list=a] [*]Prove that there exists a row such that the sum of the numbers written on it is a prime number. [*]Give an example of such a table. [/list] [i]Cristi Săvescu[/i]

How many $3 \times 5$ rectangular pieces of cardboard can be cut from a $17 \times 22$ rectangular piece of cardboard, when the amount of waste is minimised?

There are $6$ points marked on the plane. Find the greatest possible number of acute triangles with vertices at the marked points.

Two players, Agon and Besa, choose a number from the set $\{1,2,3,4,5,6,7,8\}$, in turns, until no number is left. Then, each player sums all the numbers that he has chosen. We say that a player wins if the sum of his chosen numbers is a prime and the sum of the numbers that his opponent has chosen is composite. In the contrary, the game ends in a draw. Agon starts first. Does there exist a winning strategy for any of the players?

Prove that for any four points in the plane, no three of which are collinear, there exists a circle such that three of the four points are on the circumference and the fourth point is either on the circumference or inside the circle.

The Ababi alphabet consists of letters A and B, and the words in the Ababi language are precisely those that can be formed by the following two rules: 1) A is a word. 2) If s is a word, then $ s \oplus s$ and $ s \oplus \bar{s}$ are words, where $ \bar{s}$ denotes a word that is obtained by replacing all letters A in s with letters B, and vice versa; and $ x \oplus y$ denotes the concatenation of x and y. The Ululu alphabet consists also of letters A and B and the words in the Ululu language are precisely those that can be formed by the following two rules: 1) A is a word. 2) If s is a word, $ s \oplus s$ and $ s \oplus \bar{s}$ are words, where $ \bar{s}$ is defined as above and $ x \oplus y$ is a word obtained from words x and y of equal length by writing the letters of x and y alternatingly, starting from the first letter of x. Prove that the two languages consist of the same words.

Show that it is possible to color each point of a circle red or blue so that no right-angled triangle inscribed in the circle has its vertices all the same color.

The underside of a pyramid is a convex nonagon , paint all the diagonals of the nonagon and all the ridges of the pyramid into white and black , prove : there exists a triangle ,the colour of its three sides are the same . ( PS:the sides of the nonagon is not painted. )

There are $14$ students who have particiated to a $3$ hour test consisting on $15$ short problems. Each student has solved a different number of problems and each problem has been solved by a different number of students. Prove that there exists a student who has solved exactly $5$ problems.

Positive integers are colored either blue or red such that if $a,b$ have the same color and $a-10b$ is a positive integer then $a-10b, a$ have the same color as well. How many such coloring exist?

$2013$ people sit in a circle, playing a ball game. When one player has a ball, he may only pass it to another player $3$, $11$, or $61$ seats away (in either direction). If $f(A,B)$ represents the minimal number of passes it takes to get the ball from Person $A$ to Person $B$, what is the maximal possible value of $f$?