Let $n\geqslant 3$ be an integer. Prove that there exists a set $S$ of $2n$ positive integers satisfying the following property: For every $m=2,3,...,n$ the set $S$ can be partitioned into two subsets with equal sums of elements, with one of subsets of cardinality $m$.

A city is a point on the plane. Suppose there are $n\geq 2$ cities. Suppose that for each city $X$, there is another city $N(X)$ that is strictly closer to $X$ than all the other cities. The government builds a road connecting each city $X$ and its $N(X)$; no other roads have been built. Suppose we know that, starting from any city, we can reach any other city through a series of road. We call a city $Y$ [i]suburban[/i] if it is $N(X)$ for some city $X$. Show that there are at least $(n-2)/4$ suburban cities. [i]Proposed by usjl.[/i]

Let $ k\geq 1 $ and let $ I_{1},\dots, I_{k} $ be non-degenerate subintervals of the interval $ [0, 1] $. Prove that \[ \sum \frac{1}{\left | I_{i}\cup I_{j} \right |} \geq k^{2} \] where the summation is over all pairs $ (i, j) $ of indices such that $I_i\cap I_j\neq \emptyset$.

The organizers of a mathematical congress found that if they accomodate any participant in a room the rest can be accomodated in double rooms so that 2 persons living in each room know each other. Prove that every participant can organize a round table on graph theory for himself and an even number of other people so that each participant of the round table knows both his neigbours. [i]Proposed by S. Berlov, S. Ivanov[/i]

Every officially published book used to have an ISBN code (International Standard Book Number) which consisted of $10$ symbols. Such code looked like this: $$a_1a_2 . . . a_9a_{10}$$ with $a_1, . . . , a_9 \in \{0, 1, . . . , 9\}$ and $a_{10} \in \{0, 1, . . . , 9, X\}$. The symbol $X$ stood for the number $10$. With a valid ISBN code was $$a_1 + 2a2 + . . . + 9a_9 + 10a_{10}$$ a multiple of $11$. Prove the following statements. (a) If one symbol is changed in a valid ISBN code, the result is no valid ISBN code. (b) When two different symbols swap places in a valid ISBN code then the result is not a valid ISBN.

Arnaldo and Bernaldo play the following game: given a fixed finite set of positive integers $A$ known by both players, Arnaldo picks a number $a \in A$ but doesn't tell it to anyone. Bernaldo thens pick an arbitrary positive integer $b$ (not necessarily in $A$). Then Arnaldo tells the number of divisors of $ab$. Show that Bernaldo can choose $b$ in a way that he can find out the number $a$ chosen by Arnaldo.

We call a coloring of an $m\times n$ table ($m,n\ge 5$) in three colors a [i]good coloring[/i] if the following conditions are satisfied: 1) Each cell has the same number of neighboring cells of two other colors; 2) Each corner has no neighboring cells of its color. Find all pairs $(m,n)$ ($m,n\ge 5$) for which there exists a good coloring of $m\times n$ table. [i](I. Manzhulina, B. Rubliov)[/i]

Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$. Prove that Sisyphus cannot reach the aim in less than \[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \] turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )

A table $110\times 110$ is given, we define the distance between two cells $A$ and $B$ as the least quantity of moves to move a chess king from the cell $A$ to cell $B$. We marked $n$ cells on the table $110\times 110$ such that the distance between any two cells is not equal to $15$. Determine the greatest value of $n$.

300 students participate on the international math olympiad. Every student speaks in exactly two of the official languages of the olympiad and every language is spoken by 100 people (it is known that students speak only the official languages). Prove that the students can be sited on a circular table, such that no two neighbors spoke the same language.

Let $n=3k$ be a positive integer (with $k\geq 2$). An equilateral triangle is divided in $n^2$ unit equilateral triangles with sides parallel to the initial, forming a grid. We will call "trapezoid" the trapezoid which is formed by three equilateral triangles (one base is equal to one and the other is equal to two). We colour the points of the grid with three colours (red, blue and green) such that each two neighboring points have different colour. Finally, the colour of a "trapezoid" will be the colour of the midpoint of its big base. Find the number of all "trapezoids" in the grid (not necessarily disjoint) and determine the number of red, blue and green "trapezoids".

For a positive integer $n$ define a sequence of zeros and ones to be [i]balanced[/i] if it contains $n$ zeros and $n$ ones. Two balanced sequences $a$ and $b$ are [i]neighbors[/i] if you can move one of the $2n$ symbols of $a$ to another position to form $b$. For instance, when $n = 4$, the balanced sequences $01101001$ and $00110101$ are neighbors because the third (or fourth) zero in the first sequence can be moved to the first or second position to form the second sequence. Prove that there is a set $S$ of at most $\frac{1}{n+1} \binom{2n}{n}$ balanced sequences such that every balanced sequence is equal to or is a neighbor of at least one sequence in $S$.

[u]Round 1 [/u] [b]p1.[/b] Ephram was born in May $2005$. How old will he turn in the first year where the product of the digits of the year number is a nonzero perfect square? [b]p2.[/b] Zhao is studying for his upcoming calculus test by reviewing each of the $13$ lectures, numbered Lecture $1$, Lecture $2$, ..., Lecture $13$. For each $n$, he spends $5n$ minutes on Lecture $n$. Which lecture is he reviewing after $4$ hours? [b]p3.[/b] Compute $$\dfrac{3^3 \div 3(3)+3}{\frac{3}{3}}+3!.$$ [u]Round 2 [/u] [b]p4.[/b] At Ingo’s shop, train tickets normally cost $\$2$, but every $5$th ticket costs only $\$1$. At Emmet’s shop, train tickets normally cost $\$3$, but every $5$th ticket is free. Both Ingo and Emmett sold $1000$ tickets. Find the absolute difference between their sales, in dollars. [b]p5.[/b] Ephram paddles his boat in a river with a $4$-mph current. Ephram travels at $10$ mph in still water. He paddles downstream and then turns around and paddles upstream back to his starting position. Find the proportion of time he spends traveling upstream, as a percentage. [b]p6.[/b] The average angle measure of a $13-14-15$ triangle is $m^o$ and the average angle measure of a $5-6-7$ triangle is $n^o$. Find $m-n$. [u]Round 3[/u] [b]p7.[/b] Let $p(x) = x^2 -10x +31$. Find the minimum value of $p(p(x))$ over all real $x$. [b]p8.[/b] Michael H. andMichael Y. are playing a game with $4$ jellybeans. Michael H starts with $3$ of the jellybeans, and Michael Y starts with the remaining $1$. Every minute, a Michael flips a coin, and if heads, Michael H takes a jellybean from Michael Y. If tails, Michael Y takes a jellybean from Michael H. WhicheverMichael gathers all $4$ jellybeans wins. The probability Michael H wins can be written as $\frac{A}{B}$ for relatively prime positive integers $A$ and $B$. Find $1000A+B$. [b]p9.[/b] Define the digit-product of a positive integer to be the product of its non-zero digits. Let $M$ denote the greatest five-digit number with a digit-product of $360$, and let $N$ denote the least five-digit number with a digit-product of $360$. Find the digit-product of $M-N$. [u]Round 4 [/u] [b]p10.[/b] Hannah is attending one of the three IdeaMath classes running at LHS, while Alex decides to randomly visit some combination of classes. He won’t visit all three classes, but he’s equally likely to visit any other combination. The probability Alex visits Hannah’s class can be expressed as $\frac{A}{B}$ for relatively prime positive integers $A$ and $B$. Find $1000A+B$. [b]p11.[/b] In rectangle $ABCD$, let $E$ be the intersection of diagonal $AC$ and the circle centered at $A$ passing through $D$. Angle $\angle ACD = 24^o$. Find the measure of $\angle CED$ in degrees. [b]p12.[/b] During his IdeaMath class, Zach writes the numbers $2, 3, 4, 5, 6, 7$, and $8$ on a whiteboard. Every minute, he chooses two numbers $a$ and $b$ from the board, erases them, and writes the number $ab +a +b$ on the board. He repeats this process until there’s only one number left. Find the sum of all possible remaining numbers. [u]Round 5[/u] [b]p13.[/b] In isosceles right $\vartriangle ABC$ with hypotenuse $AC$, Let $A'$ be the point on the extension of $AB$ past $A$ such that $AA' = 1$. Let $C'$ be the point on the extension of $BC$ past vertex $C$ such that $CC' = 2$. Given that the difference of the areas of triangle $A'BC'$ and $ABC$ is $10$, find the area of $ABC$. [b]p14.[/b] Compute the sumof the greatest and least values of $x$ such that $(x^2 -4x +4)^2 +x^2 -4x \le 16$. [b]p15.[/b] Ephram is starting a fan club. At the fan club’s first meeting, everyone shakes hands with everyone else exactly once, except for Ephram, who is extremely sociable and shakes hands with everyone else twice. Given that a total of $2015$ handshakes took place, how many people attended the club’s first meeting? PS. You should use hide for answers. Rounds 6-9 have been posted [url=https://artofproblemsolving.com/community/c3h3167139p28823346]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Each point of a plane with both coordinates being integers has been colored black or white. Show that there exists an infinite subset of colored points, whose points are in the same color, having a center of symmetry. [EDIT: added condition about being infinite - now it makes sense]

Let $p{}$ and $q{}$ be two coprime positive integers. A frog hops along the integer line so that on every hop it moves either $p{}$ units to the right or $q{}$ units to the left. Eventually, the frog returns to the initial point. Prove that for every positive integer $d{}$ with $d < p + q$ there are two numbers visited by the frog which differ just by $d{}$. [i]Nikolay Belukhov[/i]

Let \(L_3 = \{3\}\), \(L_n = \{3, 4, \ldots, h\}\) (where \(h > 3\)). For any given integer \(n \geq 3\), consider a graph \(G\) with \(n\) vertices that contains a Hamiltonian cycle \(C\) and has more than \(\frac{n^2}{4}\) edges. For which lengths \(l \in L_n\) must the graph \(G\) necessarily contain a cycle of length \(l\)?

There are $n$ holes in a circle. The holes are numbered $1,2,3$ and so on to $n$. In the beginning, there is a peg in every hole except for hole $1$. A peg can jump in either direction over one adjacent peg to an empty hole immediately on the other side. After a peg moves, the peg it jumped over is removed. The puzzle will be solved if all pegs disappear except for one. For example, if $n=4$ the puzzle can be solved in two jumps: peg $3$ jumps peg $4$ to hole $1$, then peg $2$ jumps the peg in $1$ to hole $4$. (See illustration below, in which black circles indicate pegs and white circles are holes.) [center][img]http://i.imgur.com/4ggOa8m.png[/img][/center] [list=a] [*]Can the puzzle be solved for $n=5$? [*]Can the puzzle be solved for $n=2014$? [/list] In each part (a) and (b) either describe a sequence of moves to solve the puzzle or explain why it is impossible to solve the puzzle.

How many permutations of the set $\{B, M, T, 2,0\}$ do not have $B$ as their first element?

How many sequences $a_1$, $a_2$, $...$,$a_8$ of zeroes and ones have $a_1a_2 + a_2a_3 +...+ a_7a_8 = 5$?

Let $m,n \geqslant 2$ be integers, let $X$ be a set with $n$ elements, and let $X_1,X_2,\ldots,X_m$ be pairwise distinct non-empty, not necessary disjoint subset of $X$. A function $f \colon X \to \{1,2,\ldots,n+1\}$ is called [i]nice[/i] if there exists an index $k$ such that \[\sum_{x \in X_k} f(x)>\sum_{x \in X_i} f(x) \quad \text{for all } i \ne k.\] Prove that the number of nice functions is at least $n^n$.

In a football tournament with $n \geqslant 4$ teams, each pair of teams played against each other exactly once. In the final table, the scores of the teams are $n$ consecutive numbers. Find the maximum possible score of the winner of the tournament. [b]Note:[/b] A victory gives $3$ points, a draw gives $1$ point and a loss gives $0$ points.

There are three piles of coins, with $a,b$ and $c$ coins respectively, where $a,b,c\geq2015$ are positive integers. The following operations are allowed: (1) Choose a pile with an even number of coins and remove all coins from this pile. Add coins to each of the remaining two piles with amount equal to half of that removed; or (2) Choose a pile with an odd number of coins and at least 2017 coins. Remove 2017 coins from this pile. Add 1009 coins to each of the remaining two piles. Suppose there are sufficiently many spare coins. Find all ordered triples $(a,b,c)$ such that after some finite sequence of allowed operations. There exists a pile with at least $2017^{2017}$ coins.

We are given a positive integer $ r$ and a rectangular board $ ABCD$ with dimensions $ AB \equal{} 20, BC \equal{} 12$. The rectangle is divided into a grid of $ 20 \times 12$ unit squares. The following moves are permitted on the board: one can move from one square to another only if the distance between the centers of the two squares is $ \sqrt {r}$. The task is to find a sequence of moves leading from the square with $ A$ as a vertex to the square with $ B$ as a vertex. (a) Show that the task cannot be done if $ r$ is divisible by 2 or 3. (b) Prove that the task is possible when $ r \equal{} 73$. (c) Can the task be done when $ r \equal{} 97$?

A directed graph has each vertex with outdegree 2. Prove that it is possible to split the vertices into 3 sets so that for each vertex $v$, $v$ is not simultaneously in the same set with both of the vertices that it points to. [i]David Yang.[/i] [hide="Stronger Version"]See [url=http://www.artofproblemsolving.com/Forum/viewtopic.php?f=42&t=492100]here[/url].[/hide]

Alice and Bob play a game, in which they take turns drawing segments of length $1$ in the Euclidean plane. Alice begins, drawing the first segment, and from then on, each segment must start at the endpoint of the previous segment. It is not permitted to draw the segment lying over the preceding one. If the new segment shares at least one point - except for its starting point - with one of the previously drawn segments, one has lost. a) Show that both Alice and Bob could force the game to end, if they don’t care who wins. b) Is there a winning strategy for one of them?