$ 5 $ points are situated in the plane so that any three of them form a triangle of area at most $ 1. $ Prove that there is a trapezoid of area at most $ 3 $ which contains all these points ('including' here means that the points can also be on the sides of the trapezoid).

$15$ ladies and $30$ gentlemen attend a luxurious party. At the start of the party, each one of the ladies shakes hands with a random gentleman. At the end of the party, each of the ladies shakes hands with another random gentleman. A lady may shake hands with the same gentleman twice (first at the start and then at the end of the party), and no two ladies shake hands with the same gentleman at the same time. Let $m$ and $n$ be relatively prime positive integers such that $\frac{m}{n}$ is the probability that the collection of ladies and gentlemen that shook hands at least once can be arranged in a single circle such that each lady is directly adjacent to someone if and only if she shook hands with that person. Find the remainder when $m$ is divided by $10000$.

The Fibonacci sequence $F_n$ is defined by $F_0=0,F_1=1$ and the recurrence relation $F_n=F_{n-1}+F_{n-2}$ for all integers $n\geq2$. Let $p\geq3$ be a prime number. [list=a] [*] Prove that $F_{p-1}+F_{p+1}-1$ is divisible by $p$. [*] Prove that $F_{p^{k+1}-1}+F_{p^{k+1}+1}-\left(F_{p^k-1}+F_{p^k+1}\right)$ is divisible by $p^{k+1}$ for any positive integer $k$. [/list]

Given two positive integers $m$ and $n$, find the smallest positive integer $k$ such that among any $k$ people, either there are $2m$ of them who form $m$ pairs of mutually acquainted people or there are $2n$ of them forming $n$ pairs of mutually unacquainted people.

Show that the number of ordered pairs $(S,T)$ of subsets of $[n]$ satisfying $s>|T|$ for all $s\in S$ and $t>|S|$ for all $t\in T$ is equal to the Fibonacci number $F_{2n+2}$. [color=#008000] Moderator says: http://www.artofproblemsolving.com/Forum/viewtopic.php?p=296007#p296007 http://www.artofproblemsolving.com/Forum/viewtopic.php?f=41&t=515970&hilit=Putnam+1990[/color]

Let $A$ be a given set with $n$ elements. Let $k<n$ be a given positive integer. Find the maximum value of $m$ for which it is possible to choose sets $B_i$ and $C_i$ for $i=1,2,\ldots,m$ satisfying the following conditions: [list=1] [*]$B_i\subset A,$ $|B_i|=k,$ [*]$C_i\subset B_i$ (there is no additional condition for the number of elements in $C_i$), and [*]$B_i\cap C_j\neq B_j\cap C_i$ for all $i\neq j.$ [/list]

Initially, there are $111$ pieces of clay on the table of equal mass. In one turn, you can choose several groups of an equal number of pieces and push the pieces into one big piece for each group. What is the least number of turns after which you can end up with $11$ pieces no two of which have the same mass?

The $8 \times 8$ board is covered with the same shape as in the picture to the right (each of the shapes can be rotated $90^o$) so that any two do not overlap or extend beyond the edge of the chessboard. Determine the largest possible number of fields of this chessboard can be covered as described above. [img]https://cdn.artofproblemsolving.com/attachments/e/5/d7f44f37857eb115edad5ea26400cdca04e107.png[/img]

Two players take turns to write natural numbers on a board. The rules forbid writing numbers greater than $p$ and also divisors of previously written numbers. The player who has no move loses. Determine which player has a winning strategy for $p = 10$ and describe this strategy.

Given a positive integer $ n\geq 2$, let $ B_{1}$, $ B_{2}$, ..., $ B_{n}$ denote $ n$ subsets of a set $ X$ such that each $ B_{i}$ contains exactly two elements. Find the minimum value of $ \left|X\right|$ such that for any such choice of subsets $ B_{1}$, $ B_{2}$, ..., $ B_{n}$, there exists a subset $ Y$ of $ X$ such that: (1) $ \left|Y\right| \equal{} n$; (2) $ \left|Y \cap B_{i}\right|\leq 1$ for every $ i\in\left\{1,2,...,n\right\}$.

Noah has on his ark $4$ large coffins in which to place $8$ animals. It is known that for any animal there are at most $5$ animals with which it is incompatible (those can't live together). Show that: a) Noah can place the animals in the cages according to their compatibility. b) Noah can place two animals in each cage.

A square is divided into $25$ unit squares by drawing lines parallel to the sides of the square. Some diagonals of unit squares are drawn from such that two diagonals do not share points. What is the maximum number diagonals that can be drawn with this property?

Consider the set $A=\{1,2,...,49\}$. We partitionate $A$ into three subsets. Prove that there exist a set from these subsets containing three distincts elements $a,b,c$ such that $a+b=c$

In the plane we are given $3 \cdot n$ points ($n>$1) no three collinear, and the distance between any two of them is $\leq 1$. Prove that we can construct $n$ pairwise disjoint triangles such that: The vertex set of these triangles are exactly the given 3n points and the sum of the area of these triangles $< 1/2$.

Let $p(k)$ be the probability that if we choose a uniformly random subset $S$ of $\{1, 2, \ldots, 18\},$ then $|S| \equiv k \pmod{5}.$ Evaluate $$\sum_{k=0}^4 \left|p(k)-\frac{1}{5}\right|.$$

Amber and Brian are playing a game using $2010$ coins. Throughout the game, the coins are divided into a number of piles of at least 1 coin each. A move consists of choosing one or more piles and dividing each of them into two smaller piles. (So piles consisting of only $1$ coin cannot be chosen.) Initially, there is only one pile containing all $2010$ coins. Amber and Brian alternatingly take turns to make a move, starting with Amber. The winner is the one achieving the situation where all piles have only one coin. Show that Amber can win the game, no matter which moves Brian makes.

It is known that, having $6$ weighs, it is possible to balance the scales with loads, which weights are successing natural numbers from $1$ to $63$. Find all such sets of weighs.

Adam has a box with $15$ pool balls in it, numbered from $1$ to $15$, and picks out $5$ of them. He then sorts them in increasing order, takes the four differences between each pair of adjacent balls, and finds exactly two of these differences are equal to $1$. How many selections of $5$ balls could he have drawn from the box? [i]Proposed by Adam Bertelli[/i]

There are $27$ cards, each has some amount of ($1$ or $2$ or $3$) shapes (a circle, a square or a triangle) with some color (white, grey or black) on them. We call a triple of cards a [i]match[/i] such that all of them have the same amount of shapes or distinct amount of shapes, have the same shape or distinct shapes and have the same color or distinct colors. For instance, three cards shown in the figure are a [i]match[/i] be cause they have distinct amount of shapes, distinct shapes but the same color of shapes. What is the maximum number of cards that we can choose such that non of the triples make a [i]match[/i]? [i]Proposed by Amin Bahjati[/i]

The number $2$ is written on the board. Ana and Bruno play alternately. Ana begins. Each one, in their turn, replaces the number written by the one obtained by applying exactly one of these operations: multiply the number by $2$, multiply the number by $3$ or add $1$ to the number. The first player to get a number greater than or equal to $2011$ wins. Find which of the two players has a winning strategy and describe it.

$n$ players ($n \ge 4$) took part in the tournament. Each player played exactly one match with every other player, there were no draws. There was no four players $(A, B, C, D)$, such that $A$ won with $B$, $B$ won with $C$, $C$ won with $D$ and $D$ won with $A$. Determine, depending on $n$, maximum number of trios of players $(A, B, C)$, such that $A$ won with $B$, $B$ won with $C$ and $C$ won with $A$. (Attention: Trios $(A, B, C)$, $(B, C, A)$ and $(C, A, B)$ are the same trio.)

Compute the number of ways a non-self-intersecting concave quadrilateral can be drawn in the plane such that two of its vertices are $(0, 0)$ and $(1, 0)$, and the other two vertices are two distinct lattice points $(a, b)$, $(c, d)$ with $0 \le a$, $c \le 59$ and $1 \le b$, $d \le 5.$ (A concave quadrilateral is a quadrilateral with an angle strictly larger than $180^o$. A lattice point is a point with both coordinates integers.)

What is the maximum number of possible change of directions in a path traveling on the edges of a rectangular array of $2004 \times 2004$, if the path does not cross the same place twice?.

Let $k\ge 1$ be a positive integer. We consider $4k$ chips, $2k$ of which are red and $2k$ of which are blue. A sequence of those $4k$ chips can be transformed into another sequence by a so-called move, consisting of interchanging a number (possibly one) of consecutive red chips with an equal number of consecutive blue chips. For example, we can move from $r\underline{bb}br\underline{rr}b$ to $r\underline{rr}br\underline{bb}b$ where $r$ denotes a red chip and $b$ denotes a blue chip. Determine the smallest number $n$ (as a function of $k$) such that starting from any initial sequence of the $4k$ chips, we need at most $n$ moves to reach the state in which the first $2k$ chips are red.

Let $\ell_1, \ell_2$ be two non-parallel lines and $d_1, d_2$ be positive reals. The set of points $X$, such that $dist(X, \ell_i)$ is a multiple of $d_i$ is called a $\textit{grid}$. Let $A$ be finite set of points, not all collinear. A triangle with vertices in $A$ is called $\textit{empty}$ if no points from $A$ lie inside or on the sides of the triangle. Given that all empty triangles have the same area, show that $A$ is the intersection of a grid $L$ and a convex polygon $F$.