For a positive integer $n$, a [i]sum-friendly odd partition[/i] of $n$ is a sequence $(a_1, a_2, \ldots, a_k)$ of odd positive integers with $a_1 \le a_2 \le \cdots \le a_k$ and $a_1 + a_2 + \cdots + a_k = n$ such that for all positive integers $m \le n$, $m$ can be [b]uniquely[/b] written as a subsum $m = a_{i_1} + a_{i_2} + \cdots + a_{i_r}$. (Two subsums $a_{i_1} + a_{i_2} + \cdots + a_{i_r}$ and $a_{j_1} + a_{j_2} + \cdots + a_{j_s}$ with $i_1 < i_2 < \cdots < i_r$ and $j_1 < j_2 < \cdots < j_s$ are considered the same if $r = s$ and $a_{i_l} = a_{j_l}$ for $1 \le l \le r$.) For example, $(1, 1, 3, 3)$ is a sum-friendly odd partition of $8$. Find the number of sum-friendly odd partitions of $9999$.

The cities of countries $A$ and $B$ are marked on the map, which has the form of a square with vertices at points $(0, 0)$ , $ (0, 1)$ , $(1, 1)$ , $(1, 0)$ of the plane. According to the trade agreement, country $A$ must ensure the delivery of $n$ kg of wheat to $n$ cities of country $B$, located at the points of the square with coordinates $y_1,..., y_n$, $1$ kg each city. Currently, $n$ kg of wheat are distributed among $n$ cities of country $A$, located at the points of the square with coordinates $x_1,... , x_n$, $1$ kg in each city. From each city of country $A$ to each city of the country $A$ any amount of wheat can be transported (of course, not more than $1$ kg). Transportation cost is for $t$ kg of wheat from a city with coordinates $x_i$ to a city with coordinates $y_j$ is equal to $tl_{ij}$, where $l_{ij }$is the length of the segment connecting the points $x_i$ and $y_j$. The government of country A is going to implement the optimal one (i,e. the cheapest) transportation plan. (a) Is it possible to implement the optimal transportation plan so that from each city of country $A$ to transport wheat only to one city of country $B$? (b) Will the response change if country $A$ is to deliver $n+1$ kg of wheat, in city $x_1$ is $2$ kg of wheat, and $2$ kg should be delivered to city $y_1$ (when for other cities the conditions remain the same)? [hide=original wording] Мiста країн A та B позначенi на мапi, що має вигляд квадрату з вершинами в точках (0, 0), (0, 1), (1, 1), (1, 0) площини. Згiдно торгової угоди, країна A має забез- печити доставку n кг пшеницi в n мiст країни B, що розташованi в точках квадрату з координатами y1, . . . , yn, по 1 кг в кожне мiсто. Наразi n кг пшеницi розподiленi серед n мiст країни A, що розташованi в точках квадрату з координатами x1, . . . , xn, по 1 кг в кожному мiстi. З кожного мiста країни A в кожне мiсто країни B можна перевезти довiльну кiлькiсть пшеницi (звичайно, не бiльше 1 кг). Вартiсть переве- зення t кг пшеницi з мiста з координатами xi в мiсто з координатами yj дорiвнює tlij , де lij – довжина вiдрiзку, що сполучає точки xi та yj . Уряд країни A збирається реалiзувати оптимальний (тобто найдешевший) план перевезення. 1. Чи можна реалiзувати оптимальний план перевезення таким чином, щоби з кожного мiста країни A перевозити пшеницю тiльке в одне мiсто країни B? 2. Чи змiниться вiдповiдь, якщо країна A має забезпечити доставку n + 1 кг пше- ницi, в мiстi x1 знаходиться 2 кг пшеницi, i в мiсто y1 має бути доставлено 2 кг пшеницi (щодо iнших мiст умови лишаються такими ж)?[/hide]

In a school there are 1200 students. Each student must join exactly $k$ clubs. Given that there is a common club joined by every 23 students, but there is no common club joined by all 1200 students, find the smallest possible value of $k$.

Two players take turns alternatively and remove a number from $1,2,\dots,1000$. Players can not remove a number that differ with a number already removed by $1$ also they can not remove a number such that it sums up with another removed number to $1001$. The player who can not move loses. Determine the winner.

Let $K$ be a positive integer. Egor has $100$ cards with the number “$2$” written on them, and $100$ cards with the number “$3$” written on them. Egor wants to paint each card red or blue so that no subset of cards of the same color has the sum of the numbers equal to $K$. Find the greatest $K$ such that Egor will not be able to paint the cards in such a way.

Let $ N \equal{} \{1,2 \ldots, n\}, n \geq 2.$ A collection $ F \equal{} \{A_1, \ldots, A_t\}$ of subsets $ A_i \subseteq N,$ $ i \equal{} 1, \ldots, t,$ is said to be separating, if for every pair $ \{x,y\} \subseteq N,$ there is a set $ A_i \in F$ so that $ A_i \cap \{x,y\}$ contains just one element. $ F$ is said to be covering, if every element of $ N$ is contained in at least one set $ A_i \in F.$ What is the smallest value $ f(n)$ of $ t,$ so there is a set $ F \equal{} \{A_1, \ldots, A_t\}$ which is simultaneously separating and covering?

[b]p1.[/b] A canoeist is paddling upstream in a river when she passes a log floating downstream,, She continues upstream for awhile, paddling at a constant rate. She then turns around and goes downstream and paddles twice as fast. She catches up to the same log two hours after she passed it. How long did she paddle upstream? [b]p2.[/b] Let $g(x) =1-\frac{1}{x}$ and define $g_1(x) = g(x)$ and $g_{n+1}(x) = g(g_n(x))$ for $n = 1,2,3, ...$. Evaluate $g_3(3)$ and $g_{1982}(l982)$. [b]p3.[/b] Let $Q$ denote quadrilateral $ABCD$ where diagonals $AC$ and $BD$ intersect. If each diagonal bisects the area of $Q$ prove that $Q$ must be a parallelogram. [b]p4.[/b] Given that: $a_1, a_2, ..., a_7$ and $b_1, b_2, ..., b_7$ are two arrangements of the same seven integers, prove that the product $(a_1-b_1)(a_2-b_2)...(a_7-b_7)$ is always even. [b]p5.[/b] In analyzing the pecking order in a finite flock of chickens we observe that for any two chickens exactly one pecks the other. We decide to call chicken $K$ a king provided that for any other chicken $X, K$ necks $X$ or $K$ pecks a third chicken $Y$ who in turn pecks $X$. Prove that every such flock of chickens has at least one king. Must the king be unique? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Sofiya and Marquis are playing a game. Sofiya announces to Marquis that she's thinking of a polynomial of the form $f(x)=x^3+px+q$ with three integer roots that are not necessarily distinct. She also explains that all of the integer roots have absolute value less than (and not equal to) $N$, where $N$ is some fixed number which she tells Marquis. As a "move" in this game, Marquis can ask Sofiya about any number $x$ and Sofiya will tell him whether $f(x)$ is positive negative, or zero. Marquis's goal is to figure out Sofiya's polynomial. If $N=3\cdot 2^k$ for some positive integer $k$, prove that there is a strategy which allows Marquis to identify the polynomial after making at most $2k+1$ "moves".

Michael wants to arrange a doubles tennis tournament among his friends. However, he has some peculiar conditions: the total number of matches should equal the total number of players, and every pair of friends should play as either teammates or opponents in at least one match. The number of players in a single match is four. What is the largest number of people who can take part in such a tournament?

An equilateral triangle of side $n$ is divided into equilateral triangles of side $1$. Find the greatest possible number of unit segments with endpoints at vertices of the small triangles that can be chosen so that no three of them are sides of a single triangle.

Let $m$ and $n$ be positive integers greater than $1$. In each unit square of an $m\times n$ grid lies a coin with its tail side up. A [i]move[/i] consists of the following steps. [list=1] [*]select a $2\times 2$ square in the grid; [*]flip the coins in the top-left and bottom-right unit squares; [*]flip the coin in either the top-right or bottom-left unit square. [/list] Determine all pairs $(m,n)$ for which it is possible that every coin shows head-side up after a finite number of moves. [i]Thanasin Nampaisarn, Thailand[/i]

$n \geq 5$ football teams participate in a round-robin tournament. For every game played, the winner receives 3 points, the loser receives 0 points, and in the event of a draw, both teams receive 1 point. The third-from-bottom team has fewer points than all the teams ranked before it, and more points than the last 2 teams; it won more games than all the teams before it, but fewer games than the 2 teams behind it. Find the smallest possible $n$.

On a mathematical competition $ n$ problems were given. The final results showed that: (i) on each problem, exactly three contestants scored $ 7$ points; (ii) for each pair of problems, exactly one contestant scored $ 7$ points on both problems. Prove that if $ n \geq 8$, then there is a contestant who got $ 7$ points on each problem. Is this statement necessarily true if $ n \equal{} 7$?

Tracy has been baking a rectangular cake whose surface is dissected by grid lines in square fields. The number of rows is $ 2^n$ and the number of columns is $ 2^{n \plus{} 1}$ where $ n \geq 1, n \in \mathbb{N}.$ Now she covers the fields with strawberries such that each row has at least $ 2n \plus{} 2$ of them. Show that there four pairwise distinct strawberries $ A,B,C$ and $ D$ which satisfy those three conditions: (a) Strawberries $ A$ and $ B$ lie in the same row and $ A$ further left than $ B.$ Similarly $ D$ lies in the same row as $ C$ but further left. (b) Strawberries $ B$ and $ C$ lie in the same column. (c) Strawberries $ A$ lies further up and further left than $ D.$

Each of ten boxes contains a different number of pencils. No two pencils in the same box are of the same colour. Prove that one can choose one pencil from each box so that no two are of the same colour.

There are 100 blue lines drawn on the plane, among which there are no parallel lines and no three of which pass through one point. The intersection points of the blue lines are marked in red. Could it happen that the distance between any two red dots lying on the same blue line is equal to an integer? [i]From the folklore[/i]

Let $P$ be a non-selfintersecting closed polygon with $n$ sides. Let its vertices be $P_1 , P_2 ,\ldots, P_n .$ Let $m$ other points,$Q_1 , Q_2 ,\ldots, Q_m $ , interior to $P$, be given. Let the figure be triangulated. This means that certain pairs of the $(n+m)$ points $P_1 ,\ldots , Q_m$ are connected by line segments such that (i) the resulting figure consists exclusively of a set $T$ of triangles, (ii) if two different triangles in $T$ have more than a vertex in common then they have exactly a side in common, and (iii) the set of vertices of the triangles in $T$ is precisely the set of the $(n+m)$ points $P_1 ,\ldots , Q_m.$ How many triangles are in $T$?

Given a finite string $S$ of symbols $X$ and $O$, we denote $\Delta(s)$ as the number of$X'$s in $S$ minus the number of $O'$s (For example, $\Delta(XOOXOOX)=-1$). We call a string $S$ [b]balanced[/b] if every sub-string $T$ of (consecutive symbols) $S$ has the property $-1\leq \Delta(T)\leq 2.$ (Thus $XOOXOOX$ is not balanced, since it contains the sub-string $OOXOO$ whose $\Delta$ value is $-3.$ Find, with proof, the number of balanced strings of length $n$.

Fix positive integers $k$ and $n$.Derive a simple expression involving Fibonacci numbers for the number of sequences $(T_1,T_2,\ldots,T_k)$ of subsets $T_i$ of $[n]$ such that $T_1\subseteq T_2\supseteq T_3\subseteq T_4\supseteq\ldots$. [color=#008000]Moderator says: and the original source for this one is Richard Stanley, [i]Enumerative Combinatorics[/i] vol. 1 (1st edition), exercise 1.15.[/color]

It is given $2015$ numbers such that every one of them when gets replaced with sum of the rest, we get same $2015$ same numbers. Prove that product of all numbers is $0$

[b]p1.[/b] If $$ \begin{cases} a^2 + b^2 + c^2 = 1000 \\ (a + b + c)^2 = 100 \\ ab + bc = 10 \end{cases}$$ what is $ac$? [b]p2.[/b] If a and b are real numbers such that $a \ne 0$ and the numbers $1$, $a + b$, and $a$ are, in some order, the numbers $0$, $\frac{b}{a}$ , and $b$, what is $b - a$? [b]p3.[/b] Of the first $120$ natural numbers, how many are divisible by at least one of $3$, $4$, $5$, $12$, $15$, $20$, and $60$? [b]p4.[/b] For positive real numbers $a$, let $p_a$ and $q_a$ be the maximum and minimum values, respectively, of $\log_a(x)$ for $a \le x \le 2a$. If $p_a - q_a = \frac12$ , what is $a$? [b]p5.[/b] Let $ABC$ be an acute triangle and let $a$, $b$, and $c$ be the sides opposite the vertices $A$, $B$, and $C$, respectively. If $a = 2b \sin A$, what is the measure of angle $B$? [b]p6.[/b] How many ordered triples $(x, y, z)$ of positive integers satisfy the equation $$x^3 + 2y^3 + 4z^3 = 9?$$ [b]p7.[/b] Joe has invented a robot that travels along the sides of a regular octagon. The robot starts at a vertex of the octagon and every minute chooses one of two directions (clockwise or counterclockwise) with equal probability and moves to the next vertex in that direction. What is the probability that after $8$ minutes the robot is directly opposite the vertex it started from? [b]p8.[/b] Find the nonnegative integer $n$ such that when $$\left(x^2 -\frac{1}{x}\right)^n$$ is completely expanded the constant coefficient is $15$. [b]p9.[/b] For each positive integer $k$, let $$f_k(x) = \frac{kx + 9}{x + 3}.$$ Compute $$f_1 \circ f_2\circ ... \circ f_{13}(2).$$ [b]p10.[/b] Exactly one of the following five integers cannot be written in the form $x^2 + y^2 + 5z^2$, where $x$, $y$, and $z$ are integers. Which one is it? $$2003, 2004, 2005, 2006, 2007$$ [b]p11.[/b] Suppose that two circles $C_1$ and $C_2$ intersect at two distinct points $M$ and $N$. Suppose that $P$ is a point on the line $MN$ that is outside of both $C_1$ and $C_2$. Let $A$ and $B$ be the two distinct points on $C_1$ such that AP and BP are each tangent to $C_1$ and $B$ is inside $C_2$. Similarly, let $D$ and $E$ be the two distinct points on $C_2$ such that $DP$ and $EP$ are each tangent to $C_2$ and $D$ is inside $C_1$. If $AB = \frac{5\sqrt2}{2}$ , $AD = 2$, $BD = 2$, $EB = 1$, and $ED =\sqrt2$, find $AE$. [b]p12.[/b] How many ordered pairs $(x, y)$ of positive integers satisfy the following equation? $$\sqrt{x} +\sqrt{y} =\sqrt{2007}.$$ [b]p13.[/b] The sides $BC$, $CA$, and $CB$ of triangle $ABC$ have midpoints $K$, $L$, and $M$, respectively. If $$AB^2 + BC^2 + CA^2 = 200,$$ what is $AK^2 + BL^2 + CM^2$? [b]p14.[/b] Let $x$ and $y$ be real numbers that satisfy: $$x + \frac{4}{x}= y +\frac{4}{y}=\frac{20}{xy}.$$ Compute the maximum value of $|x - y|$. [b]p15.[/b] $30$ math meet teams receive different scores which are then shuffled around to lend an aura of mystery to the grading. What is the probability that no team receives their own score? Express your answer as a decimal accurate to the nearest hundredth. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Show that we cannot tile a $10 x 10$ board with $25$ pieces of type $A$, or with $25$ pieces of type $B$, or with $25$ pieces of type $C$.

Let $n \ge 3$ be an integer and $S$ be a set of $n$ elements. Determine the largest integer $k_n$ such that: for each selection of $k_n$ $3-$subsets of $S$, there exists a way to color elements of $S$ with two colors such that none of the chosen $3-$subset is monochromatic.

Let $ABCD$ be a square with the side of $20$ units. Amir divides this square into $400$ unit squares. Reza then picks $4$ of the vertices of these unit squares. These vertices lie inside the square $ABCD$ and define a rectangle with the sides parallel to the sides of the square $ABCD.$ There are exactly $24$ unit squares which have at least one point in common with the sides of this rectangle. Find all possible values for the area of a rectangle with these properties. [hide="Note"][i]Note:[/i] Vid changed to Amir, and Eva change to Reza![/hide]

Alice and Bob play a game together as a team on a $100 \times 100$ board with all unit squares initially white. Alice sets up the game by coloring exactly $k$ of the unit squares red at the beginning. After that, a legal move for Bob is to choose a row or column with at least $10$ red squares and color all of the remaining squares in it red. What is the smallest $k$ such that Alice can set up a game in such a way that Bob can color the entire board red after finitely many moves? Proposed by [i]Nikola Velov, Macedonia[/i]