Consider $16$ points arranged as shown, with horizontal and vertical distances of $1$ between consecutive rows and columns. In how many ways can one choose four of these points such that the distance between every two of those four points is strictly greater than $2$? [asy] for (int x = 0; x < 4; ++x) { for (int y = 0; y < 4; ++y) { dot((x, y)); } } [/asy]

There are $n$ cities, $2$ airline companies in a country. Between any two cities, there is exactly one $2$-way flight connecting them which is operated by one of the two companies. A female mathematician plans a travel route, so that it starts and ends at the same city, passes through at least two other cities, and each city in the route is visited once. She finds out that wherever she starts and whatever route she chooses, she must take flights of both companies. Find the maximum value of $n$.

We have two lists of numbers: One initially containing 1,6,11,...,96, and the other initially containing 4,9,14,...,99. In every turn, we erase two numbers from one of the lists, and write $\frac{1}{3}$ of their sum (not necessarily an integer) in the other list. We continue this process until there are no possible moves. [list=a] [*] Prove that at the end of the process, there is exactly one number in each list. [*] Prove that those two numbers are [u]not[/u] equal. [/list]

Nine fair coins are flipped independently and placed in the cells of a $3$ by $3$ square grid. Let $p$ be the probability that no row has all its coins showing heads and no column has all its coins showing tails. If $p=\frac ab$ for relatively prime positive integers $a$ and $b$, compute $100a+b$.

50 knights of King Arthur sat at the Round Table. A glass of white or red wine stood before each of them. It is known that at least one glass of red wine and at least one glass of white wine stood on the table. The king clapped his hands twice. After the first clap every knight with a glass of red wine before him took a glass from his left neighbour. After the second clap every knight with a glass of white wine (and possibly something more) before him gave this glass to the left neughbour of his left neighbour. Prove that some knight was left without wine. [i]Proposed by A. Khrabrov, incorrect translation from Hungarian[/i]

p1. $A$ is a set of numbers. The set $A$ is closed to subtraction, meaning that the result of subtracting two numbers in $A$ will be returns a number in $A$ as well. If it is known that two members of $A$ are $4$ and $9$, show that: a. $0\in A$ b. $13 \in A$ c. $74 \in A$ d. Next, list all the members of the set $A$ . p2. $(2, 0, 4, 1)$ is one of the solutions/answers of $x_1+x_2+x_3+x_4=7$. If all solutions belong on the set of not negative integers , specify as many possible solutions/answers from $x_1+x_2+x_3+x_4=7$ p3. Adi is an employee at a textile company on duty save data. One time Adi was asked by the company leadership to prepare data on production increases over five periods. After searched by Adi only found four data on the increase, namely $4\%$, $9\%$, $7\%$, and $5\%$. One more data, namely the $5$th data, was not found. Investigate increase of 5th data production, if Adi only remembers that the arithmetic mean and median of the five data are the same. p4. Find all pairs of integers $(x,y)$ that satisfy the system of the following equations: $$\left\{\begin{array}{l} x(y+1)=y^2-1 \\ y(x+1)=x^2-1 \end{array} \right. $$ p5. Given the following image. $ABCD$ is square, and $E$ is any point outside the square $ABCD$. Investigate whether the relationship $AE^2 + CE^2 = BE^2 +DE^2$ holds in the picture below. [img]https://cdn.artofproblemsolving.com/attachments/2/5/a339b0e4df8407f97a4df9d7e1aa47283553c1.png[/img]

Uri has $99$ empty bags and an unlimited number of balls. The weight of each ball is a number of the form $3^n$ where $n$ is an integer that can vary from ball to ball (negative integer exponents are allowed, such as $3^{-4}=\dfrac{1}{81}$, and the exponent $0$, where $3^0=1$). Uri chose a finite number of balls and distributed them into the bags so that all the bags had the same total weight and there were no balls left over. It is known that Uri chose at most $k$ balls of the same weight. Determine the smallest possible value of $k$.

$16$ different natural numbers are written on the board, none of which exceeds $30$. Prove that there must be two coprime numbers among the written numbers.

On a straight track are several runners, each running at a different constant speed. They start at one end of the track at the same time. When a runner reaches any end of the track, he immediately turns around and runs back with the same speed (then he reaches the other end and turns back again, and so on). Some time after the start, all runners meet at the same point. Prove that this will happen again.

In the classroom of at least four students the following holds: no matter which four of them take seats around a round table, there is always someone who either knows both of his neighbours, or does not know either of his neighbours. Prove that it is possible to divide the students into two groups such that in one of them, all students know one another, and in the other, none of the students know each other. (Note: if student A knows student B, then student B knows student A as well.)

A magician has one hundred cards numbered 1 to 100. He puts them into three boxes, a red one, a white one and a blue one, so that each box contains at least one card. A member of the audience draws two cards from two different boxes and announces the sum of numbers on those cards. Given this information, the magician locates the box from which no card has been drawn. How many ways are there to put the cards in the three boxes so that the trick works?

[b]p1.[/b] Len's Spanish class has four tests in the first term. Len scores $72$, $81$, and $78$ on the first three tests. If Len wants to have an 80 average for the term, what is the minimum score he needs on the last test? [b]p2.[/b] In $1824$, the Electoral College had $261$ members. Andrew Jackson won $99$ Electoral College votes and John Quincy Adams won $84$ votes. A plurality occurs when no candidate has more than $50\%$ of the votes. Should a plurality occur, the vote goes to the House of Representatives to break the tie. How many more votes would Jackson have needed so that a plurality would not have occurred? [b]p3.[/b] $\frac12 + \frac16 + \frac{1}{12} + \frac{1}{20} + \frac{1}{30}= 1 - \frac{1}{n}$. Find $n$. [b]p4.[/b] How many ways are there to sit Samuel, Esun, Johnny, and Prat in a row of $4$ chairs if Prat and Johnny refuse to sit on an end? [b]p5.[/b] Find an ordered quadruple $(w, x, y, z)$ that satisfies the following: $$3^w + 3^x + 3^y = 3^z$$ where $w + x + y + z = 2017$. [b]p6.[/b] In rectangle $ABCD$, $E$ is the midpoint of $CD$. If $AB = 6$ inches and $AE = 6$ inches, what is the length of $AC$? [b]p7.[/b] Call an integer interesting if the integer is divisible by the sum of its digits. For example, $27$ is divisible by $2 + 7 = 9$, so $27$ is interesting. How many $2$-digit interesting integers are there? [b]p8.[/b] Let $a\#b = \frac{a^3-b^3}{a-b}$ . If $a, b, c$ are the roots of the polynomial $x^3 + 2x^2 + 3x + 4$, what is the value of $a\#b + b\#c + c\#a$? [b]p9.[/b] Akshay and Gowri are examining a strange chessboard. Suppose $3$ distinct rooks are placed into the following chessboard. Find the number of ways that one can place these rooks so that they don't attack each other. Note that two rooks are considered attacking each other if they are in the same row or the same column. [img]https://cdn.artofproblemsolving.com/attachments/f/1/70f7d68c44a7a69eb13ce12291c0600d11027c.png[/img] [b]p10.[/b] The Earth is a very large sphere. Richard and Allen have a large spherical model of Earth, and they would like to (for some strange reason) cut the sphere up with planar cuts. If each cut intersects the sphere, and Allen holds the sphere together so it does not fall apart after each cut, what is the maximum number of pieces the sphere can be cut into after $6$ cuts? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $G$ be a connected graph and let $X, Y$ be two disjoint subsets of its vertices, such that there are no edges between them. Given that $G/X$ has $m$ connected components and $G/Y$ has $n$ connected components, what is the minimal number of connected components of the graph $G/(X \cup Y)$?

Let $n > 1$ be an integer. There are $n$ boxes in a row, and there are $n + 1$ identical stones. A [i]distribution [/i] is a way to distribute the stones over the boxes, in which every stone is in exactly one of the boxes. We say that two of such distributions are a [i]stone’s throw away[/i] from each other if we can obtain one distribution from the other by moving exactly one stone from one box to another. The [i]cosiness [/i] of a distribution $a$ is defined as the number of distributions that are a stone’s throw away from $a$. Determine the average cosiness of all possible distributions.

Numbers $m$ and $n$ are given positive integers. There are $mn$ people in a party, standing in the shape of an $m\times n$ grid. Some of these people are police officers and the rest are the guests. Some of the guests may be criminals. The goal is to determine whether there is a criminal between the guests or not.\\ Two people are considered \textit{adjacent} if they have a common side. Any police officer can see their adjacent people and for every one of them, know that they're criminal or not. On the other hand, any criminal will threaten exactly one of their adjacent people (which is likely an officer!) to murder. A threatened officer will be too scared, that they deny the existence of any criminal between their adjacent people.\\ Find the least possible number of officers such that they can take position in the party, in a way that the goal is achievable. (Note that the number of criminals is unknown and it is possible to have zero criminals.) [i]Proposed by Abolfazl Asadi[/i]

Let $N$ be a positive integer. Alberto and Barbara write numbers on a blackboard taking turns, according to the following rules. Alberto starts writing $1$, and thereafter if a player has written $n$ on a certain move, his adversary is allowed to write $n+1$ or $2n$ as long as he/she does not obtain a number greater than $N$. The player who writes $N$ wins. $(a)$ Determine which player has a winning strategy for $N=2005$. $(b)$ Determine which player has a winning strategy for $N=2004$. $(c)$ Find for how many integers $N\le 2005$ Barbara has a winning strategy.

A [i]peacock [/i] is a ten-digit positive integer that uses each digit exactly once. Compute the number of peacocks that are exactly twice another peacock.

A $9 \times 10$ board is divided into $90$ unit cells. There are certain rules for moving a non-standard chess queen from one square to another: [list] [*]The queen can only move along the column or row it is in each step. [*]For any natural number $n$, if $x$ cells move made in $(2n-1)$th step, then $9-x$ cells move will be done in $(2n)$th step. The last cell it stops at during these steps is considered the visited cell. [/list] Is it possible for the queen to move from any square on the board and return to the square where it started after visiting all the squares of the board exactly once? Note: At each step, the queen chooses the right, left, up, and down direction within the above condition can choose.

Two players are writting in turn natural numbers not exceeding $p$. The rules forbid to write the divisors of the numbers already having been written. Those who cannot make his move looses. a) Who, and how, can win if $p=10$? b) Who wins if $p=1000$?

Alice and Bob are in a hardware store. The store sells coloured sleeves that fit over keys to distinguish them. The following conversation takes place: [color=#0000FF]Alice:[/color] Are you going to cover your keys? [color=#FF0000]Bob:[/color] I would like to, but there are only $7$ colours and I have $8$ keys. [color=#0000FF]Alice:[/color] Yes, but you could always distinguish a key by noticing that the red key next to the green key was different from the red key next to the blue key. [color=#FF0000]Bob:[/color] You must be careful what you mean by "[i]next to[/i]" or "[i]three keys over from[/i]" since you can turn the key ring over and the keys are arranged in a circle. [color=#0000FF]Alice:[/color] Even so, you don't need $8$ colours. [b]Problem:[/b] What is the smallest number of colours needed to distinguish $n$ keys if all the keys are to be covered.

A person enters the social network facebook. He befriends at least one person a day for the first $30$ days. At the end of those $30$ days, it has been exactly $45$ friends. Prove that there is a sequence of consecutive days where made exactly $14$ friends.

The number $B=\overline{a_1a_2\dots a_na_1a_2\dots a_n}$ it is called $repetition$ of the natural positive number $A = \overline{a_1a_2\dots a_n}$.Prove that there is an infinity of natural numbers ,whose $repetition$ is a perfect square .

An $7\times 7$ array is divided in $49$ unit squares. Find all integers $n \in N^*$ for which $n$ checkers can be placed on the unit squares so that each row and each line have an even number of checkers. ($0$ is an even number, so there may exist empty rows or columns. A square may be occupied by at most $1$ checker).

What is the maximum number of colours that can be used to paint an $8 \times 8$ chessboard so that every square is painted in a single colour, and is adjacent , horizontally, vertically but not diagonally, to at least two other squares of its own colour? (A Shapovalov)

A [i]Georg Mohr[/i] cube is a cube with six faces printed respectively $G, E, O, R, M$ and $H$. Peter has nine identical Georg Mohr dice. Is it possible to stack them on top of each other for a tower there on each of the four pages in some order show the letters $G\,\, E \,\, O \,\, R \,\, G \,\, M \,\, O \,\, H \,\, R$?