Let $n$ be a positive integer. A [i]partition [/i] of $n$ is a multiset (set with repeated elements) whose sum of elements is $n$. For example, the partitions of $3$ are $\{1, 1, 1\}, \{1, 2\}$ and $\{3\}$. Each partition of $n$ is written as a non-descending sequence. For example, for $n = 3$, the list is $(1, 1, 1)$, $(1, 2)$ and $(3)$. For each sequence $x = (x_1, x_2, ..., x_k)$, define $f(x)=\prod_{i=1}^{k-1} {x_{i+1} \choose x_ i}$ . Furthermore, the $f$ of partition $\{n\}$ is $f((n)) = 1$. Prove that the sum of all $f$'s in the list is $2^{n-1}.$

For any two different real numbers $x$ and $y$, we define $D(x,y)$ to be the unique integer $d$ satisfying $2^d\le |x-y| < 2^{d+1}$. Given a set of reals $\mathcal F$, and an element $x\in \mathcal F$, we say that the [i]scales[/i] of $x$ in $\mathcal F$ are the values of $D(x,y)$ for $y\in\mathcal F$ with $x\neq y$. Let $k$ be a given positive integer. Suppose that each member $x$ of $\mathcal F$ has at most $k$ different scales in $\mathcal F$ (note that these scales may depend on $x$). What is the maximum possible size of $\mathcal F$?

The lines $\ell_1$ and \ell_2 are parallel. The points $A_1,A_2, ...,A_7$ are on $\ell_1$ and the points $B_1,B_2,...,B_8$ are on $\ell_2$. The points are arranged in such a way that the number of internal intersections among the line segments is maximized (example Figure). The [b]greatest number[/b] of intersection points is [img]https://cdn.artofproblemsolving.com/attachments/4/9/92153dce5a48fcba0f5175d67e0750b7980e84.png[/img] A. $580$ B. $585$ C. $588$ D. $590$ E. $593$

$3.$ Let $S$ be the set of all positive integers from $1$ to $100$ included. Two players play a game. The first player removes any $k$ numbers he wants, from $S$. The second player's goal is to pick $k$ different numbers, such that their sum is $100$. Which player has the winning strategy if : $a)$ $k=9$? $b)$ $k=8$?

Determine all possible values of positive integer $n$, such that there are $n$ different 3-element subsets $A_1,A_2,...,A_n$ of the set $\{1,2,...,n\}$, with $|A_i \cap A_j| \not= 1$ for all $i \not= j$.

Five points are given on the plane. Prove that among all the triangles with vertices at these points there are no more than seven acute-angled ones.

If I roll three fair $4$-sided dice, what is the probability that the sum of the resulting numbers is relatively prime to the product of the resulting numbers?

Leo and Smilla find $2020$ gold nuggets with masses $1,2,\dots,2020$ gram, which they distribute to a red and a blue treasure chest according to the following rule: First, Leo chooses one of the chests and tells its colour to Smilla. Then Smilla chooses one of the not yet distributed nuggets and puts it into this chest. This is repeated until all the nuggets are distributed. Finally, Smilla chooses one of the chests and wins all the nuggets from this chest. How many gram of gold can Smilla make sure to win?

The function $F$ is a one-to-one transformation of the plane into itself that maps rectangles into rectangles (rectangles are closed; continuity is not assumed). Prove that $F$ maps squares into squares.

If $46$ squares are colored red in a $9\times 9$ board, show that there is a $2\times 2$ block on the board in which at least $3$ of the squares are colored red.

Some lottery is played as follows. A lottery participant buys a card with $10$ numbered cells. He has the right to cross out any $4$ of these $10$ cells. Then a drawing occurs, during which some $7$ out of $10$ cells become winning. The player wins when all $4$ squares he crosses out are winning. The question arises, what is the smallest number of cards that can be used so that, if filled out correctly, at least one of these cards will win in any case? We do not suggest that you answer this question (we ourselves do not know the answer), although, of course, we will be very glad if you do and will evaluate this achievement accordingly. The task is; to indicate a certain number $n$ and a method of filling n cards that guarantees at least one win. The smaller $n$, the higher the rating of the work.

Juan must pay $4$ bills. He goes to an ATM, but doesn't remember the amount of the bills. Just know that a) Each account is a multiple of $1,000$ and is at least $4,000$. b) The accounts total 2$00, 000$. What is the least number of times Juan must use the ATM to make sure he can pay the bills with exact change without any excess money? The cashier has banknotes of $2, 000$, $5, 000$, $10, 000$, and $20,000$. Juan can decide how much money he asks the cashier each time, but you cannot decide how many bills of each type to give to the cashier.

1) The numbers $1,2,3,\ldots,2010$ are written on the blackboard. Two players in turn erase some two numbers and replace them with one number. The first player replaces numbers $a$ and $b$ with $ab-a-b$ while the second player replaces them with $ab+a+b.$ The game ends when a single number remains on the blackboard. If this number is smaller than $1\cdot2\cdot3\cdot\ldots\cdot2010$ then the first player wins. Otherwise the second player wins. Which of the players has a winning strategy? 2) The numbers $1,2,3,\ldots,2010$ are written on the blackboard. Two players in turn erase some two numbers and replace them with one number. The first player replaces numbers $a$ and $b$ with $ab-a-b+2$ while the second player replaces them with $ab+a+b.$ The game ends when a single number remains on the blackboard. If this number is smaller than $1\cdot2\cdot3\cdot\ldots\cdot2010$ then the first player wins. Otherwise the second player wins. Which of the players has a winning strategy?

Given a regular tetrahedron with edge $a$, its edges are divided into $n$ equal segments, thus obtaining $n + 1$ points: $2$ at the ends and $n - 1$ inside. The following set of planes is considered: $\bullet$ those that contain the faces of the tetrahedron, and $\bullet$ each of the planes parallel to a face of the tetrahedron and containing at least one of the points determined above. Now all those points $P$ that belong (simultaneously) to four planes of that set are considered. Determine the smallest positive natural $n$ so that among those points $P$ the eight vertices of a square-based rectangular parallelepiped can be chosen.

Find the least integer $k$ such that for any $2011 \times 2011$ table filled with integers Kain chooses, Abel be able to change at most $k$ cells to achieve a new table in which $4022$ sums of rows and columns are pairwise different.

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?

Hugo places a chess piece on the top left square of a $20 \times 20$ chessboard and makes $10$ moves with it. On each of these $10$ moves, he moves the piece either one square horizontally (left or right) or one square vertically (up or down). After the last move, he draws an $X$ on the square that the piece occupies. When Hugo plays the game over and over again, what is the largest possible number of squares that could eventually be marked with an $X$? Prove that your answer is correct.

[b]p1.[/b] Given a group of $n$ people. An $A$-list celebrity is one that is known by everybody else (that is, $n - 1$ of them) but does not know anybody. A $B$-list celebrity is one that is known by exactly $n - 2$ people but knows at most one person. (a) What is the maximum number of $A$-list celebrities? You must prove that this number is attainable. (b) What is the maximum number of $B$-list celebrities? You must prove that this number is attainable. [b]p2.[/b] A polynomial $p(x)$ has a remainder of $2$, $-13$ and $5$ respectively when divided by $x+1$, $x-4$ and $x-2$. What is the remainder when $p(x)$ is divided by $(x + 1)(x - 4)(x - 2)$? [b]p3.[/b] (a) Let $x$ and y be positive integers satisfying $x^2 + y = 4p$ and $y^2 + x = 2p$, where $p$ is an odd prime number. Prove: $x + y = p + 1$. (b) Find all values of $x, y$ and $p$ that satisfy the conditions of part (a). You will need to prove that you have found all such solutions. [b]p4.[/b] Let function $f(x, y, z)$ be defined as following: $$f(x, y, z) = \cos^2(x - y) + \cos^2(y - z) + \cos^2(z - x), x, y, z \in R.$$ Find the minimum value and prove the result. [b]p5.[/b] In the diagram below, $ABC$ is a triangle with side lengths $a = 5$, $b = 12$,$ c = 13$. Let $P$ and $Q$ be points on $AB$ and $AC$, respectively, chosen so that the segment $PQ$ bisects the area of $\vartriangle ABC$. Find the minimum possible value for the length $PQ$. [img]https://cdn.artofproblemsolving.com/attachments/b/2/91a09dd3d831b299b844b07cd695ddf51cb12b.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url]. Thanks to gauss202 for sending the problems.

Four numbers are written on the board: $1, 3, 6, 10.$ Each time two arbitrary numbers, $a$ and $b$ are deleted, and numbers $a + b$ and $ab$ are written in their place. Is it possible to get numbers $2015, 2016, 2017, 2018$ on the board after several such operations?

There are $n\geq 3$ cities in a country and between any two cities $A$ and $B$, there is either a one way road from $A$ to $B$, or a one way road from $B$ to $A$ (but never both). Assume the roads are built such that it is possible to get from any city to any other city through these roads, and define $d(A,B)$ to be the minimum number of roads you must go through to go from city $A$ to $B$. Consider all possible ways to build the roads. Find the minimum possible average value of $d(A,B)$ over all possible ordered pairs of distinct cities in the country.

Let $ n > 1$ be an integer. Find all sequences $ a_1, a_2, \ldots a_{n^2 \plus{} n}$ satisfying the following conditions: \[ \text{ (a) } a_i \in \left\{0,1\right\} \text{ for all } 1 \leq i \leq n^2 \plus{} n; \] \[ \text{ (b) } a_{i \plus{} 1} \plus{} a_{i \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} n} < a_{i \plus{} n \plus{} 1} \plus{} a_{i \plus{} n \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} 2n} \text{ for all } 0 \leq i \leq n^2 \minus{} n. \] [i]Author: Dusan Dukic, Serbia[/i]

We have $p$ players participating in a tournament, each player playing against every other player exactly once. A point is scored for each victory, and there are no draws. A sequence of nonnegative integers $s_1 \le s_2 \le s_3 \le\cdots\le s_p$ is given. Show that it is possible for this sequence to be a set of final scores of the players in the tournament if and only if \[(i)\displaystyle\sum_{i=1}^{p} s_i =\frac{1}{2}p(p-1)\] \[\text{and}\] \[(ii)\text{ for all }k < p,\displaystyle\sum_{i=1}^{k} s_i \ge \frac{1}{2} k(k - 1).\]

Prove that in the interior of an equilateral triangle with side $a$ you can put a finite number of equal circles that do not overlap, with radius $r = \frac{a}{2010}$, so that the sum of their areas is greater than $\frac{17\sqrt3}{80}$ a$^2$.

Let $ \mathcal{H}$ be a family of finite subsets of an infinite set $ X$ such that every finite subset of $ X$ can be represented as the union of two disjoint sets from $ \mathcal{H}$. Prove that for every positive integer $ k$ there is a subset of $ X$ that can be represented in at least $ k$ different ways as the union of two disjoint sets from $ \mathcal{H}$. [i]P. Erdos[/i]

Let $P$ be a given regular $100$-gon. Prove that if we take the union of two polygons that are congruent to $P,$ the ratio of the perimeter and area of the resulting shape cannot be more than the ratio of the perimeter and area of $P.$