An $n \times m$ table ( $n \le m$ ) is filled in accordance with the rules of the game "Minesweeper": mines are placed at some cells (not more than one mine at the cell) and in the remaining cells one writes the number of the mines in the neighboring (by side or by vertex) cells. Then the sum of allnumbers in the table is computed (this sum is equal to $9$ for the picture). What is the largest possible value of this sum? (V. Lebed) [img]https://cdn.artofproblemsolving.com/attachments/2/9/726ccdbc57807788a5f6e88a5acb42b10a6cc0.png[/img]

A frog trainer places one frog at each vertex of an equilateral triangle $ABC$ of unit sidelength. The trainer can make one frog jump over another along the line joining the two, so that the total length of the jump is an even multiple of the distance between the two frogs just before the jump. Let $M$ and $N$ be two points on the rays $AB$ and $AC$, respectively, emanating from $A$, such that $AM = AN = \ell$, where $\ell$ is a positive integer. After a finite number of jumps, the three frogs all lie in the triangle $AMN$ (inside or on the boundary), and no more jumps are performed. Determine the number of final positions the three frogs may reach in the triangle $AMN$. (During the process, the frogs may leave the triangle $AMN$, only their nal positions are to be in that triangle.)

Let $A$ be a set of $65$ integers with pairwise different remainders modulo $2016$. Prove that exists a subset $B=\{a,b,c,d\}$ of set $A$ such that $a+b-c-d$ is divisible with $2016$

Petya and Vasya play the following game. Petya conceives a polynomial $P(x)$ having integer coefficients. On each move, Vasya pays him a ruble, and calls an integer $a$ of his choice, which has not yet been called by him. Petya has to reply with the number of distinct integer solutions of the equation $P(x)=a$. The game continues until Petya is forced to repeat an answer. What minimal amount of rubles must Vasya pay in order to win? [i](Anant Mudgal)[/i] (Translated from [url=http://sasja.shap.homedns.org/Turniry/TG/index.html]here.[/url])

A circle is divided by $2018$ points into equal parts. Two players delete these points in turns. A player loses, if after his turn it is possible to draw a diameter of the circle such that there are no undeleted points on one side of it. Which player has a winning strategy?

The cells of a $8 \times 8$ table are initially white. Alice and Bob play a game. First Alice paints $n$ of the fields in red. Then Bob chooses $4$ rows and $4$ columns from the table and paints all fields in them in black. Alice wins if there is at least one red field left. Find the least value of $n$ such that Alice can win the game no matter how Bob plays.

There are $n$ hoops on a circle. Rik numbers all hoops with a natural number so that all numbers from $1$ to $n$ occur exactly once. Then he makes one walk from hoop to hoop. He starts in hoop $1$ and then follows the following rule: if he gets to hoop $k$, then he walks to the hoop that places $k$ clockwise without getting into the intermediate hoops. The walk ends when Rik has to walk to a hoop he has already been to. The length of the walk is the number of hoops he passed on the way. For example, for $n = 6$ Rik can take a walk of length $5$ as the hoops are numbered as shown in the figure. [img]https://cdn.artofproblemsolving.com/attachments/2/a/3d4b7edbba4d145c7e00368f9b794f39572dc5.png[/img] (a) Determine for every even $n$ how Rik can number the hoops so that he has one walk of length $n$. (b) Determine for every odd $n$ how Rik can number the hoops so that he has one walk of length $n - 1$. (c) Show that for an odd $n$ there is no such numbering of the hoops that Rik can make a walk of length $n$.

There are $6$ different bus lines in a city, each stopping at exactly $5$ stations and running in both directions. Nevertheless, for every two different stations there is always a bus line connecting these two stations. Determine the maximum number of stations in this city. [i](Karl Czakler)[/i]

There are two imposters and seven crewmates on Polus. How many ways are there for the nine people to split into three groups of three, such that each group has at least two crewmates? Assume that the two imposters and seven crewmates are all distinguishable from each other, but that the three groups are not distinguishable from each other.

Let $ABCD$ be a rectangle consisting of unit squares. All vertices of these unit squares inside the rectangle and on its sides have been colored in four colors. Additionally, it is known that: [list] [*] every vertex that lies on the side $AB$ has been colored in either the $1.$ or $2.$ color; [*] every vertex that lies on the side $BC$ has been colored in either the $2.$ or $3.$ color; [*] every vertex that lies on the side $CD$ has been colored in either the $3.$ or $4.$ color; [*] every vertex that lies on the side $DA$ has been colored in either the $4.$ or $1.$ color; [*] no two neighboring vertices have been colored in $1.$ and $3.$ color; [*] no two neighboring vertices have been colored in $2.$ and $4.$ color. [/list] Notice that the constraints imply that vertex $A$ has been colored in $1.$ color etc. Prove that there exists a unit square that has all vertices in different colors (in other words it has one vertex of each color).

Let $n$ be an integer, $n \ge 3$. Select $n$ points on the plane, none of which are three on the same line. Consider all triangles with vertices at selected points, denote the smallest of all the interior angles of these triangles by the variable $\alpha$. Find the largest possible value of $\alpha$ and identify all the selected $n$ point placements for which the max occurs.

[u]Round 1 [/u] [b]p1.[/b] A small pizza costs $\$4$ and has $6$ slices. A large pizza costs $\$9$ and has $14$ slices. If the MMATHS organizers got at least $400$ slices of pizza (having extra is okay) as cheaply as possible, how many large pizzas did they buy? [b]p2.[/b] Rachel flips a fair coin until she gets a tails. What is the probability that she gets an even number of heads before the tails? [b]p3.[/b] Find the unique positive integer $n$ that satisfies $n! \cdot (n + 1)! = (n + 4)!$. [u]Round 2 [/u] [b]p4.[/b] The Portland Malt Shoppe stocks $10$ ice cream flavors and $8$ mix-ins. A milkshake consists of exactly $1$ flavor of ice cream and between $1$ and $3$ mix-ins. (Mix-ins can be repeated, the number of each mix-in matters, and the order of the mix-ins doesn’t matter.) How many different milkshakes can be ordered? [b]p5.[/b] Find the minimum possible value of the expression $(x)^2 + (x + 3)^4 + (x + 4)^4 + (x + 7)^2$, where $x$ is a real number. [b]p6.[/b] Ralph has a cylinder with height $15$ and volume $\frac{960}{\pi}$ . What is the longest distance (staying on the surface) between two points of the cylinder? [u]Round 3 [/u] [b]p7.[/b] If there are exactly $3$ pairs $(x, y)$ satisfying $x^2 + y^2 = 8$ and $x + y = (x - y)^2 + a$, what is the value of $a$? [b]p8.[/b] If $n$ is an integer between $4$ and $1000$, what is the largest possible power of $2$ that $n^4 - 13n^2 + 36$ could be divisible by? (Your answer should be this power of $2$, not just the exponent.) [b]p9.[/b] Find the sum of all positive integers $n \ge 2$ for which the following statement is true: “for any arrangement of $n$ points in three-dimensional space where the points are not all collinear, you can always find one of the points such that the $n - 1$ rays from this point through the other points are all distinct.” [u]Round 4 [/u] [b]p10.[/b] Donald writes the number $12121213131415$ on a piece of paper. How many ways can he rearrange these fourteen digits to make another number where the digit in every place value is different from what was there before? [b]p11.[/b] A question on Joe’s math test asked him to compute $\frac{a}{b} +\frac34$ , where $a$ and $b$ were both integers. Because he didn’t know how to add fractions, he submitted $\frac{a+3}{b+4}$ as his answer. But it turns out that he was right for these particular values of $a$ and $b$! What is the largest possible value that a could have been? [b]p12.[/b] Christopher has a globe with radius $r$ inches. He puts his finger on a point on the equator. He moves his finger $5\pi$ inches North, then $\pi$ inches East, then $5\pi$ inches South, then $2\pi$ inches West. If he ended where he started, what is the largest possible value of $r$? PS. You should use hide for answers. Rounds 5-7 have be posted [url=https://artofproblemsolving.com/community/c4h2789002p24519497]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A set $X$ consisting of $n$ positive integers is called $\textit{good}$ if the following condition holds: For any two different subsets of $X$, say $A$ and $B$, the number $s(A) - s(B)$ is not divisible by $2^n$. (Here, for a set $A$, $s(A)$ denotes the sum of the elements of $A$) Given $n$, find the number of good sets of size $n$, all of whose elements is strictly less than $2^n$.

A rectangle $\mathcal{R}$ with odd integer side lengths is divided into small rectangles with integer side lengths. Prove that there is at least one among the small rectangles whose distances from the four sides of $\mathcal{R}$ are either all odd or all even. [i]Proposed by Jeck Lim, Singapore[/i]

$100$ points are given in space such that no four of them lie in the same plane. Consider those convex polyhedra with five vertices that have all vertices from the given set. Prove that the number of such polyhedra is even.

[u]Round 9[/u] [b]p25.[/b] What is the largest integer that cannot be expressed as the sum of nonnegative multiples of $7$, $11$, and $13$? [b]p26.[/b] Evaluate $12{3 \choose3}+ 11{4\choose 3}+ 10{5\choose 3}+ ...+ 2{13\choose 3}+{14 \choose 3}$. [b]p27.[/b] Worker Bob drives to work at $30$ mph half the time and $60$ mph half the time. He returns home along the same route at $30$ mph half the distance and $60$ mph half the distance. What is his average speed along the entire trip, in mph? [u]Round 10[/u] [b]p28.[/b] In quadrilateral $ABCD$, diagonals $\overline{AC}$ and $\overline{BD}$ intersect at $P$ with $BP = 4$, $P D = 6$, $AP = 8$, $P C = 3$, and $AB = 6$. What is the length of $AD$? [b]p29.[/b] Find all positive integers $x$ such that$ x^2 + 17x + 17$ is a square number. [b]p30.[/b] Zach has ten weighted coins that turn up heads with probabilities $\frac{2}{11^2}$ ,$\frac{2}{10^2}$ ,$\frac{2}{9^2}$ $, . . $.,$\frac{2}{2^2}$ . If he flips all ten coins simultaneously, then what is the probability that he will get an even number of heads? [u]Round 11[/u] [b]p31.[/b] Given a sequence $a_1, a_2, . . .$ such that $a_1 = 3$ and $a_{n+1} = a^2_n - 2a_n + 2$ for $n \ge 1$, find the remainder when the product a1a2 · · · a2012 is divided by 100. [b]p32.[/b] Let $ABC$ be an equilateral triangle and let $O$ be its circumcircle. Let $D$ be a point on $\overline{BC}$, and extend $\overline{AD}$ to intersect $O$ at $P$. If $BP = 5$ and $CP = 4$, then what is the value of $DP$? [b]p33.[/b] Surya and Hao take turns playing a game on a calendar. They start with the date January $1$ and they can either increase the month to a later month or increase the day to a later day in that month but not both. The first person to adjust the date to December $31$ is the winner. If Hao goes first, then what is the first date that he must choose to ensure that he does not lose? [u]Round 12[/u] [b]p34.[/b] On May $5$, $1868$, exactly $144$ years before today, Memorial Day in the United States was officially proclaimed. The first Memorial Day took place that year on May $30$ at Waterloo, New York. On May $5$, $2012$, at $12:00$ PM, how many results did the search “memorial day” on Google return? The search phrase is in quotes, so Google will only return sites that have the words memorial and day next to each other in that order. Let $N = max-\{0, \rfloor 15.5 \times \frac{ Your\,\,\, Answer}{Actual \,\,\,Answer} \rfloor \}$. You will earn the number of points equal to $min\{N, max\{0, 30 - N\}\}$. [b]p35.[/b] Estimate the side length of a regular pentagon whose area is $2012$. You will earn the number of points equal to $max\{0, 15 - \lfloor 5 \times |Your \,\,\,Answer - Actual \,\,\,Answer| \rfloor \}$. [b]p36.[/b] Write down one integer between $1$ and $15$, inclusive. (If you do not, then you will receive $0$ points.) Let the number that you submit be $x$. Let $\overline{x}$ be the arithmetic mean of all of the valid numbers submitted by all of the teams. If $x > \overline{x}$, then you will receive $0$ points; otherwise, you will receive $x$ points. PS. You should use hide for answers.Rounds 1-4 are [url=https://artofproblemsolving.com/community/c3h3134177p28401527]here [/url] and 6-8 [url=https://artofproblemsolving.com/community/c3h3134466p28406321]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A rectangular table $ 9$ rows $ \times$ $ 2008$ columns is fulfilled with numbers $ 1$, $ 2$, ...,$ 2008$ in a such way that each number appears exactly $ 9$ times in table and difference between any two numbers from same column is not greater than $ 3$. What is maximum value of minimum sum in column (with minimal sum)?

Yamin and Tamim are playing a game with subsets of $\{1, 2, \ldots, n\}$ where $n \geq 3$. [list] [*] Tamim starts the game with the empty set. [*] On Yamin's turn, he adds a proper non-empty subset of $\{1, 2, \ldots, n\}$ to his collection $F$ of blocked sets. [*] On Tamim's turn, he adds or removes a positive integer less than or equal to $n$ to or from their set but Tamim can never add or remove an element so that his set becomes one of the blocked sets in $F$. [/list] Tamim wins if he can make his set to be $\{1, 2, \ldots, n\}$. Yamin wins if he can stop Tamim from doing so. Yamin goes first and they alternate making their moves. Does Tamim have a winning strategy? [i]Proposed by Ahmed Ittihad Hasib[/i]

Let $k$ be a positive integer larger than $1$. Build an infinite set $\mathcal{A}$ of subsets of $\mathbb{N}$ having the following properties: [b](a)[/b] any $k$ distinct sets of $\mathcal{A}$ have exactly one common element; [b](b)[/b] any $k+1$ distinct sets of $\mathcal{A}$ have void intersection.

Given 365 cards, in which distinct numbers are written. We may ask for any three cards, the order of numbers written in them. Is it always possible to find out the order of all 365 cards by 2000 such questions?

Let $P_1P_2\ldots P_{24}$ be a regular $24$-sided polygon inscribed in a circle $\omega$ with circumference $24$. Determine the number of ways to choose sets of eight distinct vertices from these $24$ such that none of the arcs has length $3$ or $8$.

Let $n > 1$ be a given integer. An $n \times n \times n$ cube is composed of $n^3$ unit cubes. Each unit cube is painted with one colour. For each $n \times n \times 1$ box consisting of $n^2$ unit cubes (in any of the three possible orientations), we consider the set of colours present in that box (each colour is listed only once). This way, we get $3n$ sets of colours, split into three groups according to the orientation. It happens that for every set in any group, the same set appears in both of the other groups. Determine, in terms of $n$, the maximal possible number of colours that are present.

Let $m$ and $n$ be positive integers. Player $A$ has a field of $m \times n$, and player $B$ has a $1 \times n$ field (the first is the number of rows). On the first move, each player places on each square of his field white or black chip as he pleases. At each next on the move, each player can change the color of randomly chosen pieces on your field to the opposite, provided that in no row for this move will not change more than one chip (it is allowed not to change not a single chip). The moves are made in turn, player $A$ starts. Player $A$ wins if there is such a position that in the only row player $B$'s squares, from left to right, are the same as in some row of player's field $A$. Prove that player $A$ has the ability to win for any game of player $B$ if and only if $n <2m$.

A convex polygon on a plane contains at least $m^2+1$ points with integer coordinates. Prove that it contains $m+1$ points with integer coordinates that lie on the same line.

$2013$ users have registered on the social network "Graph". Some users are friends, and friendship in "Graph" is mutual. It is known that among network users there are no three, each of whom would be friends. Find the biggest one possible number of pairs of friends in "Graph".