An $ n \times n, n \geq 2$ chessboard is numbered by the numbers $ 1, 2, \ldots, n^2$ (and every number occurs). Prove that there exist two neighbouring (with common edge) squares such that their numbers differ by at least $ n.$

The lock of a safe consists of 3 wheels, each of which may be set in 8 different ways positions. Due to a defect in the safe mechanism the door will open if any two of the three wheels are in the correct position. What is the smallest number of combinations which must be tried if one is to guarantee being able to open the safe (assuming the "right combination" is not known)?

In a school there are $n$ classes and $n$ students. The students are enrolled in classes, such that no two of them have exactly the same classes. Prove that we can close a class in a such way that there still are no two of them which have exactly the same classes.

Find the maximum number of different integers that can be selected from the set $ \{1,2,...,2013\}$ so that no two exist that their difference equals to $17$.

$n$ red and $n$ blue points on a plane are given so that no three of the $2n$ points are collinear. Prove that it is always possible to split up the points into $n$ pairs, with one red and one blue point in each pair, so that no two of the $n$ line segments which connect the two members of a pair intersect.

Let $m$ and $n$ be positive integers. A people planted two kind of different trees on a plot tabular grid size $ m \times n $ (each square plant one tree.) A plant called [i]inpressive[/i] if two conditions following conditions are met simultaneously: i) The number of trees in each of kind is equal; ii) In each row the number of tree of each kind is diffrenent not less than a half of number of cells on that row and In each colum the number of tree of each kind is diffrenent not less than a half of number of cells on that colum. a) Find an inpressive plant when $m=n=2016$; b) Prove that if there at least a inpressive plant then $4|m$ and $4|n$.

Find all integers $n$ for which each cell of $n \times n$ table can be filled with one of the letters $I,M$ and $O$ in such a way that: [LIST] [*] in each row and each column, one third of the entries are $I$, one third are $M$ and one third are $O$; and [/*] [*]in any diagonal, if the number of entries on the diagonal is a multiple of three, then one third of the entries are $I$, one third are $M$ and one third are $O$.[/*] [/LIST] [b]Note.[/b] The rows and columns of an $n \times n$ table are each labelled $1$ to $n$ in a natural order. Thus each cell corresponds to a pair of positive integer $(i,j)$ with $1 \le i,j \le n$. For $n>1$, the table has $4n-2$ diagonals of two types. A diagonal of first type consists all cells $(i,j)$ for which $i+j$ is a constant, and the diagonal of this second type consists all cells $(i,j)$ for which $i-j$ is constant.

[b]p1.[/b] Let $a_0, a_1,...,a_n$ be such that $a_n \ne 0$ and $$(1 + x + x^3)^{341}(1 + 2x + x^2 + 2x^3 + 2x^4 + x^6)^{342} =\sum^n_{i=0}a_ix^i,$$ Find the number of odd numbers in the sequence a0; a1; : : : an. [b]p2.[/b] Let $F_0 = 1$, $F_1 = 1$ and F$_k = F_{k-1} + F_{k-2}$. Let $P(x) =\sum^{99}_{k=0} x^{F_k}$ . The remainder when $P(x)$ is divided by $x^3 - 1$ can be expressed as $ax^2 + bx + c$. Find $2a + b$. [b]p3.[/b] Let $a_n$ be the number of permutations of the numbers $S = \{1, 2,...,n\}$ such that for all $k$ with $1 \le k \le n$, the sum of $k$ and the number in the $k$th position of the permutation is a power of $2$. Compute $a_{2^0} + a_{2^1} +... + a_{2^{20}}$ . [b]p4.[/b] Three identical balls are painted white and black, so that half of each sphere is a white hemisphere, and the other half is a black one. The three balls are placed on a plane surface, each with a random orientation, so that each ball has a point of contact with the other two. What is the probability that at at least one point of contact between two of the balls, both balls are the same color? [b]p5.[/b] Compute the greatest positive integer $n$ such that there exists an odd integer $a$, for which $\frac{a^{2^n}-1}{4^{4^4}}$ is not an integer. [b]p6.[/b] You are blind and cannot feel the difference between a coin that is heads up or tails up. There are $100$ coins in front of you and are told that exactly $10$ of them are heads up. On the back of this paper, explain how you can split the otherwise indistinguishable coins into two groups so that both groups have the same number of heads. [b]p7.[/b] On the back of this page, write the best math pun you can think of. You’ll get a point if we chuckle. [b]p8.[/b] Pick an integer between $1$ and $10$. If you pick $k$, and $n$ total teams pick $k$, then you’ll receive $\frac{k}{10n}$ points. [b]p9.[/b] There are four prisoners in a dungeon. Tomorrow, they will be separated into a group of three in one room, and the other in a room by himself. Each will be given a hat to wear that is either black or white – two will be given white and two black. None of them will be able to communicate with each other and none will see his or her own hat color. The group of three is lined up, so that the one in the back can see the other two, the second can see the first, but the first cannot see the others. If anyone is certain of their hat color, then they immediately shout that they know it to the rest of the group. If they can secretly prove it to the guard, they are saved. They only say something if they’re sure. Which person is sure to survive? [b]p10.[/b] Down the road, there are $10$ prisoners in a dungeon. Tomorrow they will be lined up in a single room and each given a black or white hat – this time they don’t know how many of each. The person in the back can see everyone’s hat besides his own, and similarly everyone else can only see the hats of the people in front of them. The person in the back will shout out a guess for his hat color and will be saved if and only if he is right. Then the person in front of him will have to guess, and this will continue until everyone has the opportunity to be saved. Each person can only say his or her guess of “white” or “black” when their turn comes, and no other signals may be made. If they have the night before receiving the hats to try to devise some sort of code, how many people at a minimum can be saved with the most optimal code? Describe the code on the back of this paper for full points. [b]p11.[/b] A few of the problems on this mixer contest were taken from last year’s event. One of them had fewer than $5$ correct answers, and most of the answers given were the same incorrect answer. Half a point will be given if you can guess the number of the problem on this test that corresponds to last year’s question, and another $.5$ points will be given if you can guess the very common incorrect answer. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Suppose that every positve integer has been given one of the colors red, blue,arbitrarily. Prove that there exists an infinite sequence of positive integers $ a_{1} < a_{2} < a_{3} < \cdots < a_{n} < \cdots,$ such that inifinite sequence of positive integers $ a_{1},\frac {a_{1} \plus{} a_{2}}{2},a_{2},\frac {a_{2} \plus{} a_{3}}{2},a_{3},\frac {a_{3} \plus{} a_{4}}{2},\cdots$ has the same color.

Jack plays a game in which he first rolls a fair six-sided die and gets some number $n$, then, he flips a coin until he flips $n$ heads in a row and wins, or he flips $n$ tails in a row in which case he rerolls the die and tries again. What is the expected number of times Jack must flip the coin before he wins the game.

In a very large City, they are building a subway: there are many stations, some pairs of which are connected by tunnels, and from any station you can get through tunnels to any other. All metro tunnels must be divided into "lines": each line consists of several consecutive tunnels, all stations in which are different (in particular, the line should not be circular); lines consisting of one tunnel are also allowed. By law, it is required that you can get from any station to any other station by making no more than $100$ transfers from line to line. At what is the largest $N$, any connected metro with $N$ stations can be divided into lines, observing the law?

The $A$ set consists of integers only. Its minimal element is $1$ and its maximal element is $100$. Every element of $A$ except $1$ equals to the sum of two (may be equal) numbers being contained in $A$. What is the least possible number of elements in $A$?

Prove that a convex polygon can be cut by disjoint diagonals into acute triangles in at least one way.

A $10$-digit number is called a $\textit{cute}$ number if its digits belong to the set $\{1,2,3\}$ and the difference of every pair of consecutive digits is $1$. a) Find the total number of cute numbers. b) Prove that the sum of all cute numbers is divisibel by $1408$.

Let $n$ be an integer greater than $1$ and let $X$ be an $n$-element set. A non-empty collection of subsets $A_1, ..., A_k$ of $X$ is tight if the union $A_1 \cup \cdots \cup A_k$ is a proper subset of $X$ and no element of $X$ lies in exactly one of the $A_i$s. Find the largest cardinality of a collection of proper non-empty subsets of $X$, no non-empty subcollection of which is tight. [i]Note[/i]. A subset $A$ of $X$ is proper if $A\neq X$. The sets in a collection are assumed to be distinct. The whole collection is assumed to be a subcollection.

We have a deck of $n$ playing cards, some of which are turned up and some are turned down. In each step we are allowed to take a set of several cards from the top, turn the set and place it back on the top of the deck. What is the smallest number of steps necessary to make all cards in the deck turned down, independent of the initial configuration?

Four people are playing rock-paper-scissors. They each play one of the three options (rock, paper, or scissors) independently at random, with equal probability of each choice. Compute the probability that someone beats everyone else. (In rock-paper-scissors, a player that plays rock beats a player that plays scissors, a player that plays paper beats a player that plays rock, and a player that plays scissors beats a player that plays paper.)

[b]p1. [/b]The longest diagonal of a regular hexagon is 12 inches long. What is the area of the hexagon, in square inches? [b]p2.[/b] When Al and Bob play a game, either Al wins, Bob wins, or they tie. The probability that Al does not win is $\frac23$ , and the probability that Bob does not win is $\frac34$ . What is the probability that they tie? [b]p3.[/b] Find the sum of the $a + b$ values over all pairs of integers $(a, b)$ such that $1 \le a < b \le 10$. That is, compute the sum $$(1 + 2) + (1 + 3) + (1 + 4) + ...+ (2 + 3) + (2 + 4) + ...+ (9 + 10).$$ [b]p4.[/b] A $3 \times 11$ cm rectangular box has one vertex at the origin, and the other vertices are above the $x$-axis. Its sides lie on the lines $y = x$ and $y = -x$. What is the $y$-coordinate of the highest point on the box, in centimeters? [b]p5.[/b] Six blocks are stacked on top of each other to create a pyramid, as shown below. Carl removes blocks one at a time from the pyramid, until all the blocks have been removed. He never removes a block until all the blocks that rest on top of it have been removed. In how many different orders can Carl remove the blocks? [img]https://cdn.artofproblemsolving.com/attachments/b/e/9694d92eeb70b4066b1717fedfbfc601631ced.png[/img] [b]p6.[/b] Suppose that a right triangle has sides of lengths $\sqrt{a + b\sqrt{3}}$,$\sqrt{3 + 2\sqrt{3}}$, and $\sqrt{4 + 5\sqrt{3}}$, where $a, b$ are positive integers. Find all possible ordered pairs $(a, b)$. [b]p7.[/b] Farmer Chong Gu glues together $4$ equilateral triangles of side length $ 1$ such that their edges coincide. He then drives in a stake at each vertex of the original triangles and puts a rubber band around all the stakes. Find the minimum possible length of the rubber band. [b]p8.[/b] Compute the number of ordered pairs $(a, b)$ of positive integers less than or equal to $100$, such that a $b -1$ is a multiple of $4$. [b]p9.[/b] In triangle $ABC$, $\angle C = 90^o$. Point $P$ lies on segment $BC$ and is not $B$ or $C$. Point $I$ lies on segment $AP$. If $\angle BIP = \angle PBI = \angle CAB = m^o$ for some positive integer $m$, find the sum of all possible values of $m$. [b]p10.[/b] Bob has $2$ identical red coins and $2$ identical blue coins, as well as $4$ distinguishable buckets. He places some, but not necessarily all, of the coins into the buckets such that no bucket contains two coins of the same color, and at least one bucket is not empty. In how many ways can he do this? [b]p11.[/b] Albert takes a $4 \times 4$ checkerboard and paints all the squares white. Afterward, he wants to paint some of the square black, such that each square shares an edge with an odd number of black squares. Help him out by drawing one possible configuration in which this holds. (Note: the answer sheet contains a $4 \times 4$ grid.) [b]p12.[/b] Let $S$ be the set of points $(x, y)$ with $0 \le x \le 5$, $0 \le y \le 5$ where $x$ and $y$ are integers. Let $T$ be the set of all points in the plane that are the midpoints of two distinct points in $S$. Let $U$ be the set of all points in the plane that are the midpoints of two distinct points in $T$. How many distinct points are in $U$? (Note: The points in $T$ and $U$ do not necessarily have integer coordinates.) [b]p13.[/b] In how many ways can one express $6036$ as the sum of at least two (not necessarily positive) consecutive integers? [b]p14.[/b] Let $a, b, c, d, e, f$ be integers (not necessarily distinct) between $-100$ and $100$, inclusive, such that $a + b + c + d + e + f = 100$. Let $M$ and $m$ be the maximum and minimum possible values, respectively, of $$abc + bcd + cde + def + ef a + f ab + ace + bdf.$$ Find $\frac{M}{m}$. [b]p15.[/b] In quadrilateral $ABCD$, diagonal $AC$ bisects diagonal $BD$. Given that $AB = 20$, $BC = 15$, $CD = 13$, $AC = 25$, find $DA$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n,k,m$ be positive integers, where $k\ge 2$ and $n\le m < \frac{2k-1}{k}n$. Let $A$ be a subset of $\{1,2,\ldots ,m\}$ with $n$ elements. Prove that every integer in the range $\left(0,\frac{n}{k-1}\right)$ can be expressed as $a-b$, where $a,b\in A$.

A box whose shape is a parallelepiped can be completely filled with cubes of side $1.$ If we put in it the maximum possible number of cubes, each of volume $2$, with the sides parallel to those of the box, then exactly $40$ percent of the volume of the box is occupied. Determine the possible dimensions of the box.

Anna and Basilis play a game writing numbers on a board as follows: The two players play in turns and if in the board is written the positive integer $n$, the player whose turn is chooses a prime divisor $p$ of $n$ and writes the numbers $n+p$. In the board, is written at the start number $2$ and Anna plays first. The game is won by whom who shall be first able to write a number bigger or equal to $31$. Find who player has a winning strategy, that is who may writing the appropriate numbers may win the game no matter how the other player plays.

A rook stands at a corner of an $m \times n$ squared board. Two players move the rook in turn (vertically or horizontally through any numbers of squares). As the rook moves, it paints the squares that it visits (stopping or passing through). The rook is not allowed to pass through or stop at the painted squares. The player who cannot move, loses. Who has a guaranteed win: the first player (who starts the game) or the other, and how should he/she play? (B Begun)

Let $P$ be a convex polygon, and let $n \ge 3$ be a positive integer. On each side of $P$, erect a regular $n$-gon that shares that side of $P$, and is outside $P$. If none of the interiors of these regular n-gons overlap, we call P $n$-[i]good[/i]. (a) Find the largest value of $n$ such that every convex polygon is $n$-[i]good[/i]. (b) Find the smallest value of $n$ such that no convex polygon is $n$-[i]good[/i].

Let $a_1<a_2 \dots <a_n$ be positive integers, with $n\geq 2$. An invisible frog lies on the real line, at a positive integer point. Initially, the hunter chooses a number $k$, and then, once every minute, he can check if the frog currently lies in one of $k$ points of his choosing, after which the frog goes from its point $x$ to one of the points $x+a_1, x+a_2 \dots x+a_n$. Based on the values of $a_1, a_2 \dots a_n$, what is the smallest value of $k$ such that the hunter can guarantee to find the frog within a finite number of minutes, no matter where it initially started? [i]Proposed by David Anghel[/i]

We have a regular polygon $P$ with 2019 vertices, and in each vertex there is a coin. Two players [i]Azul[/i] and [i]Rojo[/i] take turns alternately, beginning with Azul, in the following way: first, Azul chooses a triangle with vertices in $P$ and colors its interior with blue, then Rojo selects a triangle with vertices in $P$ and colors its interior with red, so that the triangles formed in each move don't intersect internally the previous colored triangles. They continue playing until it's not possible to choose another triangle to be colored. Then, a player wins the coin of a vertex if he colored the greater quantity of triangles incident to that vertex (if the quantities of triangles colored with blue or red incident to the vertex are the same, then no one wins that coin and the coin is deleted). The player with the greater quantity of coins wins the game. Find a winning strategy for one of the players. [i]Note.[/i] Two triangles can share vertices or sides.