In a country with $ n $ ($ n \geq 3 $) airports, the government only licenses air travel to those airlines whose airline system meets the following conditions: a) Each airline must connect any two airports with one and only one one-way airline; b) For each airline there is an airport from which the passenger could fly off and fly back, using the services of only this airline. What is the maximum number of airlines with different airline systems?

There are two piles of cards, one with $n$ cards and the other with $m$ cards. $A$ and $B$ play alternately, performing one of the following actions in each turn. following operations: a) Remove a card from a pile. b) Remove one card from each pile. c) Move a card from one pile to the other. Player $A$ always starts the game and whoever takes the last one letter wins . Determine if there is a winning strategy based on $m$ and $n$, so that one of the players following her can win always.

Let $p\ge 3$ be a prime number. Each side of a triangle is divided into $p$ equal parts, and we draw a line from each division point to the opposite vertex. Find the maximum number of regions, every two of them disjoint, that are formed inside the triangle.

A drunken person walks randomly on a tree. Each time, he chooses uniformly at random a neighbouring node and walks there. Show that wherever his starting point and goal are, the expected number of steps the person takes to reach the goal is always an integer. [i]houkai[/i]

Find the sum of all integers from 1 to 1000 which contain at least one “7” in their digits.

A right hexagon with side length $n$ is divided into tiles of three types, which are shown in the image, which are rhombuses with side length $1$ each and the acute angle $60$. In one move you can choose three tiles, arranged as shown in the image on the left, and rearrange them, as shown in the image on the right [img]https://iili.io/dxEvyqN.jpg[/img] Moves are made until it is impossible to make a move. a) Prove that for the fixed initial arrangement of tiles the same amount of moves would be made independent of the moves. b) For each positive integer $n$ find the maximum number of moves among all possible initial arrangements [i]M. Zorka[/i]

$A$ is the set of points of a convex $n$-gon on a plane. The distinct pairwise distances between any $2$ points in $A$ arranged in descending order is $d_1>d_2>...>d_m>0$. Let the number of unordered pairs of points in $A$ such that their distance is $d_i$ be exactly $\mu _i$, for $i=1, 2,..., m$. Prove: For any positive integer $k\leq m$, $\mu _1+\mu _2+...+\mu _k\leq (3k-1)n$.

Let $ n \geq 4$ be a fixed positive integer. Given a set $ S \equal{} \{P_1, P_2, \ldots, P_n\}$ of $ n$ points in the plane such that no three are collinear and no four concyclic, let $ a_t,$ $ 1 \leq t \leq n,$ be the number of circles $ P_iP_jP_k$ that contain $ P_t$ in their interior, and let \[m(S)=a_1+a_2+\cdots + a_n.\] Prove that there exists a positive integer $ f(n),$ depending only on $ n,$ such that the points of $ S$ are the vertices of a convex polygon if and only if $ m(S) = f(n).$

[u]Round 1[/u] [b]p1.[/b] Tom and Jerry stole a chain of $7$ sausages and are now trying to divide the bounty. They take turns biting the sausages at one of the connections. When one of them breaks a connection, he may eat any single sausages that may fall out. Tom takes the first bite. Each of them is trying his best to eat more sausages than his opponent. Who will succeed? [b]p2. [/b]The King of the Mountain Dwarves wants to light his underground throne room by placing several torches so that the whole room is lit. The king, being very miserly, wants to use as few torches as possible. What is the least number of torches he could use? (You should show why he can't do it with a smaller number of torches.) This is the shape of the throne room: [img]https://cdn.artofproblemsolving.com/attachments/b/2/719daafd91fc9a11b8e147bb24cb66b7a684e9.png[/img] Also, the walls in all rooms are lined with velvet and do not reflect the light. For example, the picture on the right shows how another room in the castle is partially lit. [img]https://cdn.artofproblemsolving.com/attachments/5/1/0f6971274e8c2ff3f2d0fa484b567ff3d631fb.png[/img] [b]p3.[/b] In the Hundred Acre Wood, all the animals are either knights or liars. Knights always tell the truth and liars always lie. One day in the Wood, Winnie-the-Pooh, a knight, decides to visit his friend Rabbit, also a noble knight. Upon arrival, Pooh finds his friend sitting at a round table with $5$ other guests. One-by-one, Pooh asks each person at the table how many of his two neighbors are knights. Surprisingly, he gets the same answer from everybody! "Oh bother!" proclaims Pooh. "I still don't have enough information to figure out how many knights are at this table." "But it's my birthday," adds one of the guests. "Yes, it's his birthday!" agrees his neighbor. Now Pooh can tell how many knights are at the table. Can you? [b]p4.[/b] Several girls participate in a tennis tournament in which each player plays each other player exactly once. At the end of the tournament, it turns out that each player has lost at least one of her games. Prove that it is possible to find three players $A$, $B$, and $C$ such that $A$ defeated $B$, $B$ defeated $C$, and $C$ defeated $A$. [b]p5.[/b] There are $40$ piles of stones with an equal number of stones in each. Two players, Ann and Bob, can select any two piles of stones and combine them into one bigger pile, as long as this pile would not contain more than half of all the stones on the table. A player who can’t make a move loses. Ann goes first. Who wins? [u]Round 2[/u] [b]p6.[/b] In a galaxy far, far away, there is a United Galactic Senate with $100$ Senators. Each Senator has no more than three enemies. Tired of their arguments, the Senators want to split into two parties so that each Senator has no more than one enemy in his own party. Prove that they can do this. (Note: If $A$ is an enemy of $B$, then $B$ is an enemy of $A$.) [b]p7.[/b] Harry has a $2012$ by $2012$ chessboard and checkers numbered from $1$ to $2012 \times 2012$. Can he place all the checkers on the chessboard in such a way that whatever row and column Professor Snape picks, Harry will be able to choose three checkers from this row and this column such that the product of the numbers on two of the checkers will be equal to the number on the third? [img]https://cdn.artofproblemsolving.com/attachments/b/3/a87d559b340ceefee485f41c8fe44ae9a59113.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The numbers $1, 2, 3, ... , 64$ are written in the cells of an $8 \times 8$ board (in some order, one per cell). Show that at least four $2 \times 2$ squares have sum greater than $100$.

Let $S > 1$ be a real number. The Cartesian plane is partitioned into rectangles whose sides are parallel to the axes of the coordinate system. and whose vertices have integer coordinates. Prove that if the area of each triangle if at most $S$, then for any positive integer $k$ there exist $k$ vertices of these rectangles which lie on a line.

There are $2019$ points given in the plane. A child wants to draw $k$ (closed) discs in such a manner, that for any two distinct points there exists a disc that contains exactly one of these two points. What is the minimal $k$, such that for any initial configuration of points it is possible to draw $k$ discs with the above property?

A rectangularly paper is divided in polygons areas in the following way: at every step one of the existing surfaces is cut by a straight line, obtaining two new areas. Which is the minimum number of cuts needed such that between the obtained polygons there exists $251$ polygons with $11$ sides?

Let $S$ be a set consisting of $n$ elements, $F$ a set of subsets of $S$ consisting of $2^{n-1}$ subsets such that every three such subsets have a non-empty intersection. a) Show that the intersection of all subsets of $F$ is not empty. b) If you replace the number of sets from $2^{n-1}$ with $2^{n-1}-1$, will the previous answer change?

In a ballroom, seven gentlemen $A, B, C, D, E, F$ and $G$ sit directly across from seven queens $a, b, c, d, e, f$ and $g$ in random order. When the gentlemen rise and walks across the dance floor to bow to each of their ladies, someone notices that at least two of the men travel equally long distances. Will it always be like this? The figure shows an example. In the example, $|Bb| =|Ee|$ and $|Dd|=|Cc|$. [img]https://cdn.artofproblemsolving.com/attachments/8/3/1e18a30b1e9acc90b24210fc7991b58062a69f.png[/img]

On a $3 \times 3$ board the numbers from $1$ to $9$ are written in some order and without repeating. We say that the arrangement obtained is [i]Isthmian [/i] if the numbers in any two adjacent squares have different parity. Determine the number of different Isthmian arrangements. Note: Two arrangements are considered equal if one can be obtained from the other by rotating the board.

Let $m$ and $n$ be natural numbers. Professor Mubariz has $m$ folders and Professor Nazim has $n$ folders; initially, all folders are empty. Every day, where the day numbers are marked as $d = 1,2,3 ....,$ Prof. Mubariz is given $2018$ blue papers, and Prof. Nazim is given $2018$ orange papers. On day $d ( d = 1, 2, 3, ...),$ they both perform the following operations: [list] [*] If the $2018$ papers given to this professor are not enough to place $d$ papers in each of his folders, then he distributes all the $2018$ papers given to him to his students. If the $2018$ papers given to this professor are enough to place $d$ papers in each of his folders, firstly, he places $d$ papers in each of his folders. [*] If this professor still has papers left after the first step, he places them in the other professor's folders, with the same number in each folder and as many as possible. [*] If this professor still has papers left after the second step, he distributes them to his students. [/list] Prove that after $6$ years, the number of blue papers in one folder of Prof. Nazim will be equal to the number of orange papers in one folder of Prof. Mubariz.

Consider the points $P$ =$(0,0)$,$Q$ = $(1,0)$, $R$= $(2,0)$, $S$ =$(3,0)$ in the $xy$-plane. Let $A,B,C,D$ be four finite sets of colours(not necessarily distinct nor disjoint). In how many ways can $P,Q,R$ be coloured bu colours in $A,B,C$ respectively if adjacent points have to get different colours? In how many ways can $P,Q,R,S$ be coloured by colours in $A,B,C,D$ respectively if adjacent points have to get different colors?

Given seven points in the plane, some of them are connected by segments such that: [b](i)[/b] among any three of the given points, two are connected by a segment; [b](ii)[/b] the number of segments is minimal. How many segments does a figure satisfying [b](i)[/b] and [b](ii)[/b] have? Give an example of such a figure.

Let $p$ and $q$ be mutually prime natural numbers greater than $1$. Starting with the permutation $(1, 2, . . . , n)$, in one move we can switch the places of two numbers if their difference is $p$ or $q$. Prove that with such moves we can get any another permutation if and only if $n \ge p + q - 1$.

Is it possible to arrange the numbers $1, 2, . . . , 60$ in that order, so that the sum of any two numbers between which there is one number, divisible by $2$, the sum of any two numbers between which there are two numbers divisible by $3$, . . . , the sum of any two numbers between which there is are there six numbers, divisible by $7$?

Every cell of a $2005 \times 2005$ square board is colored white or black so that every $2 \times 2$ subsquare contains an odd number of black cells. Show that among the corner cells there is an even number of black ones. How many ways are there to color the board in this manner?

A competition room of HOMC has $m \times n$ students where $m, n$ are integers larger than $2$. Their seats are arranged in $m$ rows and $n$ columns. Before starting the test, every student takes a handshake with each of his/her adjacent students (in the same row or in the same column). It is known that there are totally $27$ handshakes. Find the number of students in the room.

66 players take part in the chess tournament, each player plays one game against each other, and the games take place in four cities. Prove that three players play all their games in the same city.

Given $5$ points in a plane, no three of them being collinear. Each two of these $5$ points are joined with a segment, and every of these segments is painted either red or blue; assume that there is no triangle whose sides are segments of equal color. [b]a.)[/b] Show that: [i](1)[/i] Among the four segments originating at any of the $5$ points, two are red and two are blue. [i](2)[/i] The red segments form a closed way passing through all $5$ given points. (Similarly for the blue segments.) [b]b.)[/b] Give a plan how to paint the segments either red or blue in order to have the condition (no triangle with equally colored sides) satisfied.