Let $A=\{1,2,3,\ldots,40\}$. Find the least positive integer $k$ for which it is possible to partition $A$ into $k$ disjoint subsets with the property that if $a,b,c$ (not necessarily distinct) are in the same subset, then $a\ne b+c$.

All squares of a $ 20\times 20$ table are empty. Misha* and Sasha** in turn put chips in free squares (Misha* begins). The player after whose move there are four chips on the intersection of two rows and two columns wins. Which of the players has a winning strategy? [i]Proposed by A. Golovanov[/i] [b]US Name Conversions: [/b] [i]Misha*: Naoki Sasha**: Richard[/i]

There are $2n$ different numbers in a row. By one move we can interchange any two numbers or interchange any $3$ numbers cyclically (choose $a,b,c$ and place $a$ instead of $b$, $b$ instead of $c$, $c$ instead of $a$). What is the minimal number of moves that is always sufficient to arrange the numbers in increasing order ?

Let $M$ be a finite set of lattice points and $n$ be a positive integer. A $\textit{mine-avoiding path}$ is a path of lattice points with length $n$, beginning at $(0,0)$ and ending at a point on the line $x+y=n,$ that does not contain any point in $M$. Prove that if there exists a mine-avoiding path, then there exist at least $2^{n-|M|}$ mine-avoiding paths. [hide=*]A lattice point is a point $(x,y)$ where $x$ and $y$ are integers. A path of lattice points with length $n$ is a sequence of lattice points $P_0,P_1,\ldots, P_n$ in which any two adjacent points in the sequence have distance 1 from each other.[/hide] [i]Ankit Bisain and Holden Mui[/i]

[u]Round 1[/u] [b]p1.[/b] Goldilocks enters the home of the three bears – Papa Bear, Mama Bear, and Baby Bear. Each bear is wearing a different-colored shirt – red, green, or blue. All the bears look the same to Goldilocks, so she cannot otherwise tell them apart. The bears in the red and blue shirts each make one true statement and one false statement. The bear in the red shirt says: “I'm Blue's dad. I'm Green's daughter.” The bear in the blue shirt says: “Red and Green are of opposite gender. Red and Green are my parents.” Help Goldilocks find out which bear is wearing which shirt. [b]p2.[/b] The University of Washington is holding a talent competition. The competition has five contests: math, physics, chemistry, biology, and ballroom dancing. Any student can enter into any number of the contests but only once for each one. For example, a student may participate in math, biology, and ballroom. It turned out that each student participated in an odd number of contests. Also, each contest had an odd number of participants. Was the total number of contestants odd or even? [b]p3.[/b] The $99$ greatest scientists of Mars and Venus are seated evenly around a circular table. If any scientist sees two colleagues from her own planet sitting an equal number of seats to her left and right, she waves to them. For example, if you are from Mars and the scientists sitting two seats to your left and right are also from Mars, you will wave to them. Prove that at least one of the $99$ scientists will be waving, no matter how they are seated around the table. [b]p4.[/b] One hundred boys participated in a tennis tournament in which every player played each other player exactly once and there were no ties. Prove that after the tournament, it is possible for the boys to line up for pizza so that each boy defeated the boy standing right behind him in line. [b]p5.[/b] To celebrate space exploration, the Science Fiction Museum is going to read Star Wars and Star Trek stories for $24$ hours straight. A different story will be read each hour for a total of $12$ Star Wars stories and $12$ Star Trek stories. George and Gene want to listen to exactly $6$ Star Wars and $6$ Star Trek stories. Show that no matter how the readings are scheduled, the friends can find a block of $12$ consecutive hours to listen to the stories together. [u]Round 2[/u] [b]p6.[/b] $2013$ people attended Cinderella's ball. Some of the guests were friends with each other. At midnight, the guests started turning into mice. After the first minute, everyone who had no friends at the ball turned into a mouse. After the second minute, everyone who had exactly one friend among the remaining people turned into a mouse. After the third minute, everyone who had two human friends left in the room turned into a mouse, and so on. What is the maximal number of people that could have been left at the ball after $2013$ minutes? [b]p7.[/b] Bill and Charlie are playing a game on an infinite strip of graph paper. On Bill’s turn, he marks two empty squares of his choice (not necessarily adjacent) with crosses. Charlie, on his turn, can erase any number of crosses, as long as they are all adjacent to each other. Bill wants to create a line of $2013$ crosses in a row. Can Charlie stop him? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There are $64$ towns in a country and some pairs of towns are connected by roads but we do not know these pairs. We may choose any pair of towns and find out whether they are connected or not. Our aim is to determine whether it is possible to travel from any town to any other by a sequence of roads. Prove that there is no algorithm which enables us to do so in less than $2016$ questions. (Proposed by Konstantin Knop)

Let $ x_1 , x_2, x_3 ...$ a succession of positive integers such that for every couple of positive integers $(m,n)$ we have $ x_{mn} \neq x_{m(n+1)}$ . Prove that there exists a positive integer $i$ such that $x_i \ge 2017 $.

[u]Super Mario 64![/u] Mario is once again on a quest to save Princess Peach. Mario enters Peach's castle and finds himself in a room with $4$ doors. This room is the first in a sequence of $2$ indistinugishable rooms. In each room, $1$ door leads to the next room in the sequence (or, for the second room, into Bowser's level), while the other $3$ doors lead to the first room. [b]p9.[/b] Suppose that in every room, Mario randomly picks a door to walk through. What is the expected number of doors (not including Mario's initial entrance to the first room) through which Mario will pass before he reaches Bowser's level? [b]p10.[/b] Suppose that instead there are $6$ rooms with $4$ doors. In each room, $1$ door leads to the next room in the sequence (or, for the last room, Bowser's level), while the other $3$ doors lead to the first room. Now what is the expected number of doors through which Mario will pass before he reaches Bowser's level? [b]p11.[/b] In general, if there are $d$ doors in every room (but still only $1$ correct door) and $r$ rooms, the last of which leads into Bowser's level, what is the expected number of doors through which Mario will pass before he reaches Bowser's level?

$10$ rectangles have their vertices lie on a circle. The vertices divide the circle into $40$ equal arcs. Prove that two of the rectangles are congruent. [i]Proposed by Evan Chang (squareman), USA[/i]

A segment $d$ is said to divide a segment $s$ if there is a natural number $n$ such that $s = nd = d+d+ ...+d$ ($n$ times). (a) Prove that if a segment $d$ divides segments $s$ and $s'$ with $s < s'$, then it also divides their difference $s'-s$. (b) Prove that no segment divides the side $s$ and the diagonal $s'$ of a regular pentagon (consider the pentagon formed by the diagonals of the given pentagon without explicitly computing the ratios).

[b]p1.[/b] Suppose Mitchell has a fair die. He is about to roll it six times. The probability that he rolls $1$, $2$, $3$, $4$, $5$, and then $6$ in that order is $p$. The probability that he rolls $2$, $2$, $4$, $4$, $6$, and then $6$ in that order is $q$. What is $p - q$? [b]p2.[/b] What is the smallest positive integer $x$ such that $x \equiv 2017$ (mod $2016$) and $x \equiv 2016$ (mod $2017$) ? [b]p3.[/b] The vertices of triangle $ABC$ lie on a circle with center $O$. Suppose the measure of angle $ACB$ is $45^o$. If $|AB| = 10$, then what is the distance between $O$ and the line $AB$? [b]p4.[/b] A “word“ is a sequence of letters such as $YALE$ and $AELY$. How many distinct $3$-letter words can be made from the letters in $BOOLABOOLA$ where each letter is used no more times than the number of times it appears in $BOOLABOOLA$? [b]p5.[/b] How many distinct complex roots does the polynomial $p(x) = x^{12} - x^8 - x^4 + 1$ have? [b]p6.[/b] Notice that $1 = \frac12 + \frac13 + \frac16$ , that is, $1$ can be expressed as the sum of the three fractions $\frac12 $, $\frac13$ , and $\frac16$ , where each fraction is in the form $\frac{1}{n}$, with each $n$ different. Give a $6$-tuple of distinct positive integers $(a, b, c, d, e, f)$ where $a < b < c < d < e < f$ such that $\frac{1}{a} +\frac{1}{b} + \frac{1}{c} + \frac{1}{d} + \frac{1}{e} + \frac{1}{f} = 1$ and explain how you arrived at your $6$-tuple. Multiple answers will be accepted. [b]p7.[/b] You have a Monopoly board, an $11 \times 11$ square grid with the $9 \times 9$ internal square grid removed, where every square is blank except for Go, which is the square in the bottom right corner. During your turn, you determine how many steps forward (which is in the counterclockwise direction) to move by rolling two standard $6$-sided dice. Let $S$ be the set of squares on the board such that if you are initially on a square in $S$, no matter what you roll with the dice, you will always either land on Go (move forward enough squares such that you end up on Go) or you pass Go (you move forward enough squares such that you step on Go during your move and then you advance past Go). You randomly and uniformly select one square in $S$ as your starting position. What is the probability that you land on Go? [b]p8.[/b] Using $L$-shaped triominos, and dominos, where each square of a triomino and a domino covers one unit, what is the minimum number of tiles needed to cover a $3$-by-$2017$ rectangle without any gaps? [b]p9.[/b] Does there exist a pair of positive integers $(x, y)$, where $x < y$, such that $x^2 + y^2 = 1009^3$? If so, give a pair $(x, y)$ and explain how you found that pair. If not, explain why. [b]p10.[/b] Triangle $ABC$ has inradius $8$ and circumradius $20$. Let $M$ be the midpoint of side $BC$, and let $N$ be the midpoint of arc $BC$ on the circumcircle not containing $A$. Let $s_A$ denote the length of segment $MN$, and define $s_B$ and $s_C$ similarly with respect to sides $CA$ and $AB$. Evaluate the product $s_As_Bs_C$. [b]p11.[/b] Julia and Dan want to divide up $256$ dollars in the following way: in the first round, Julia will offer Dan some amount of money, and Dan can choose to accept or reject the offer. If Dan accepts, the game is over. Otherwise, if Dan rejects, half of the money disappears. In the second round, Dan can offer Julia part of the remaining money. Julia can then choose to accept or reject the offer. This process goes on until an offer is accepted or until $4$ rejections have been made; once $4$ rejections are made, all of the money will disappear, and the bargaining process ends. If Julia or Dan is indifferent between accepting and rejecting an offer, they will accept the offer. Given that Julia and Dan are both rational and both have the goal of maximizing the amount of money they get, how much will Julia offer Dan in the first round? [b]p12.[/b] A perfect partition of a positive integer $N$ is an unordered set of numbers (where numbers can be repeated) that sum to $N$ with the property that there is a unique way to express each positive integer less than $N$ as a sum of elements of the set. Repetitions of elements of the set are considered identical for the purpose of uniqueness. For example, the only perfect partitions of $3$ are $\{1, 1, 1\}$ and $\{1, 2\}$. $\{1, 1, 3, 4\}$ is NOT a perfect partition of $9$ because the sum $4$ can be achieved in two different ways: $4$ and $1 + 3$. How many integers $1 \le N \le 40$ each have exactly one perfect partition? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Around a round table sit $2n$ Peruvians, $2n$ Bolivians and $2n$ Ecuadorians. If it is requested that all those who have as neighbors, to their right and to their left, people of the same nationality. Find as many people as can stand up. Clarification: For example, for a Peruvian to get up, his neighbors must be of equal nationality, but not necessarily Peruvians.

Let $N$ be an integer, $N>2$. Arnold and Bernold play the following game: there are initially $N$ tokens on a pile. Arnold plays first and removes $k$ tokens from the pile, $1\le k < N$. Then Bernold removes $m$ tokens from the pile, $1\le m\le 2k$ and so on, that is, each player, on its turn, removes a number of tokens from the pile that is between $1$ and twice the number of tokens his opponent took last. The player that removes the last token wins. For each value of $N$, find which player has a winning strategy and describe it.

$1992$ vectors are given in the plane. Two players pick unpicked vectors alternately. The winner is the one whose vectors sum to a vector with larger magnitude (or they draw if the magnitudes are the same). Can the first player always avoid losing?

[b]8.1[/b] In the parallelogram $ABCD$ , the diagonal $AC$ is greater than the diagonal $BD$. The point $M$ on the diagonal $AC$ is such that around the quadrilateral $BCDM$ one can circumscribe a circle. Prove that $BD$ is the common tangent of the circles circumscribed around the triangles $ABM$ and $ADM$. [img]https://cdn.artofproblemsolving.com/attachments/b/3/9f77ff1f2198c201e5c270ec5b091a9da4d0bc.png[/img] [b]8.2 [/b] $A$ is an odd integer, $x$ and $y$ are roots of equation $t^2+At-1=0$. Prove that $x^4 + y^4$ and $x^5+ y^5$ are coprime integer numbers. [b]8.3[/b] A regular triangle is reflected symmetrically relative to one of its sides. The new triangle is again reflected symmetrically about one of its sides. This is repeated several times. It turned out that the resulting triangle coincides with the original one. Prove that an even number of reflections were made. [b]8.4 /7.6[/b] Several circles are arbitrarily placed in a circle of radius $3$, the sum of their radii is $25$. Prove that there is a straight line that intersects at least $9$ of these circles. [b]8.5 [/b] All two-digit numbers that do not end in zero are written one after another so that each subsequent number begins with that the same digit with which the previous number ends. Prove that you can do this and find the sum of the largest and smallest of all multi-digit numbers that can be obtained in this way. [url=https://artofproblemsolving.com/community/c6h3390996p32049528]8,6*[/url] (asterisk problems in separate posts) PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3988084_1968_leningrad_math_olympiad]here[/url].

In a plane, 2014 lines are distributed in 3 groups. in every group all the lines are parallel between themselves. What is the maximum number of triangles that can be formed, such that every side of such triangle lie on one of the lines?

Let $ S$ be the set of $25$ points $(x, y)$ with $0\le x, y \le 4$. A triangle whose three vertices are in $S$ is chosen at random. What is the expected value of the square of its area?

Let $V$ be the set of vertices of a regular $21$-gon. Given a non-empty subset $U$ of $V$ , let $m(U)$ be the number of distinct lengths that occur between two distinct vertices in $U$. What is the maximum value of $\frac{m(U)}{|U|}$ as $U$ varies over all non-empty subsets of $V$ ?

$120$ pirates distribute $119$ gold pieces among themselves. Then the captain checks if any pirate has $15$ or more gold pieces. If he finds the first one, he must give all his gold pieces to other pirates, whereby he may not give more than one gold piece to anyone. This control is repeated as long as there is any pirate with $15$ or more gold pieces. Does this process end after a lot of checks?

The vertices of a convex $2550$-gon are colored black and white as follows: black, white, two black, two white, three black, three white, ..., 50 black, 50 white. Dania divides the polygon into quadrilaterals with diagonals that have no common points. Prove that there exists a quadrilateral among these, in which two adjacent vertices are black and the other two are white. [i]D. Rudenko[/i]

Fedja used matches to put down the equally long sides of a parallelogram whose vertices are not on a common line. He figures out that exactly 7 or 9 matches, respectively, fit into the diagonals. How many matches compose the parallelogram's perimeter?

On a cellular plane with a cell side equal to $1$, arbitrarily $100 \times 100$ napkin is thrown. It covers some nodes (the node lying on the border of a napkin, is also considered covered). What is the smallest number of lines (going not necessarily along grid lines) you can certainly cover all these nodes?

There are $n$ boyfriend-girlfriend pairs at a party. Initially all the girls sit at a round table. For the first dance, each boy invites one of the girls to dance with.After each dance, a boy takes the girl he danced with to her seat, and for the next dance he invites the girl next to her in the counterclockwise direction. For which values of $n$ can the girls be selected in such a way that in every dance at least one boy danced with his girlfriend, assuming that there are no less than $n$ dances?

There are $n$ points in the plane, some of which are connected by segments. Some of the segments are colored in white, while the others are colored black in such a way that there exist a completely white as well as a completely black closed broken line of segments, each of them passing through every one of the $n$ points exactly once. It is known that the segments $AB$ and $BC$ are white. Prove that it is possible to recolor the segments in red and blue in such a way that $AB$ and $BC$ are recolored as red, [hide=not all of which segments are recolored red]meaning that recoloring every white as red and every black as blue is not acceptable[/hide], and that there exist a completely red as well as a completely blue closed broken line of segments, each of them passing through every one of the $n$ points exactly once.

For $n$ an odd positive integer, the unit squares of an $n\times n$ chessboard are coloured alternately black and white, with the four corners coloured black. A it tromino is an $L$-shape formed by three connected unit squares. For which values of $n$ is it possible to cover all the black squares with non-overlapping trominos? When it is possible, what is the minimum number of trominos needed?