In the round robin chess tournament organized in a school every two students played one match among themselves. Find the minimal possible number of students in the school if each girl student has at least 21 wins in matches against boy students and each boy student has at least 12 wins in matches against girl students.

A class has $24$ students. Each group consisting of three of the students meet, and choose one of the other $21$ students, A, to make him a gift. In this case, A considers each member of the group that offered him a gift as being his friend. Prove that there is a student that has at least $10$ friends.

In a one-player game, you have three cards. At the beginning, a nonnegative integer is written on each of the cards, and the sum of these three integers is $2006$. At each step, you can select two of the three chards, subtract $1$ from the integer written on each of these two cards - as long as the resulting integers are still nonnegative -, and add $1$ to the integer written on the third card. You play this game until you can’t perform a step anymore because two of the cards have $0$’s written on them. Assume that, at this moment, the third card has a $1$ written on it. Prove that I can tell you which card contains the $1$ without knowing how exactly you proceeded in your game, but only knowing the starting configuration (i. e., the numbers written on the cards at the beginning of the game) and the fact that at the end, you were left with two $0$’s and a $1$.

We call a set $S$ a [i]good[/i] set if $S=\{x,2x,3x\}(x\neq 0).$ For a given integer $n(n\geq 3),$ determine the largest possible number of the [i]good[/i] subsets of a set containing $n$ positive integers.

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 $N$ be an integer greater than $1$. A deck has $N^3$ cards, each card has one of $N$ colors, has one of $N$ figures and has one of $N$ numbers (there are no two identical cards). A collection of cards of the deck is "complete" if it has cards of every color, or if it has cards of every figure or of all numbers. How many non-complete collections are there such that, if you add any other card from the deck, the collection becomes complete?

In every unit square of a$ n \times n$ table ($n \ge 11$) a real number is written, such that the sum of the numbers in any $10 \times 10$ square is positive and the sum of the numbers in any $11\times 11$ square is negative. Determine all possible values for $n$

There are $N$ cities in a country, some of which are connected by two-way flights. No city is directly connected with every other city. For each pair $(A, B)$ of cities there is exactly one route using at most two flights between them. Prove that $N - 1$ is a square of an integer.

An ancient noble family has $n$ members, each holding a different number of posts . As every year in December, they gather at a very specific place for a Council of War to be held, where also k, from the point of view of the high nobility, unimportant spammers speak up, which, due to their irrelevance, should and cannot be further differentiated. The Council is held as follows: those present speak one after the other, each one carefully put forward his request once. In addition, for reasons of respect, a nobleman never speaks right after a nobleman who holds more posts, while the common people disregarde such rules. Find the number of possible sequences of the Council of war.

A subset $E$ of the set $\{1,2,3,\ldots,50\}$ is said to be [i]special[/i] if it does not contain any pair of the form $\{x,3x\}.$ A special set $E$ is [i]superspecial[/i] if it contains as many elements as possible. How many element there are in a superspecial set and how many superspecial sets there are?

A $17 \times 17$ square is cut out of a sheet of graph paper. Each cell of this square has one of thenumbers from $1$ to $70$. Prove that there are $4$ distinct squares whose centers $A, B, C, D$ are the vertices of a parallelogramsuch that $AB // CD$, moreover, the sum of the numbers in the squares with centers $A$ and $C$ is equal to that in the squares with centers $B$ and $D$.

Alice and Bob play a game. First, Alice secretly picks a finite set $S$ of lattice points in the Cartesian plane. Then, for every line $\ell$ in the plane which is horizontal, vertical, or has slope $+1$ or $-1$, she tells Bob the number of points of $S$ that lie on $\ell$. Bob wins if he can determine the set $S$. Prove that if Alice picks $S$ to be of the form \[S = \{(x, y) \in \mathbb{Z}^2 \mid m \le x^2 + y^2 \le n\}\] for some positive integers $m$ and $n$, then Bob can win. (Bob does not know in advance that $S$ is of this form.) [i]Proposed by Mark Sellke[/i]

[b]p1.[/b] The coins in Merryland all have different integer values: there is a single $1$ cent coin, a single $2$ cent coin, etc. What is the largest number of coins that a resident of Merryland can have if we know that their total value does not exceed $2021$ cents? [b]p2.[/b] For every positive integer $k$ let $$a_k = \left(\sqrt{\frac{k + 1}{k}}+\frac{\sqrt{k+1}}{k}-\frac{1}{k}-\sqrt{\frac{1}{k}}\right).$$ Evaluate the product $a_4a_5...a_{99}$. Your answer must be as simple as possible. [b]p3.[/b] Prove that for every positive integer $n$ there is a permutation $a_1, a_2, . . . , a_n$ of $1, 2, . . . , n$ for which $j + a_j$ is a power of $2$ for every $j = 1, 2, . . . , n$. [b]p4.[/b] Each point of the $3$-dimensional space is colored one of five different colors: blue, green, orange, red, or yellow, and all five colors are used at least once. Show that there exists a plane somewhere in space which contains four points, no two of which have the same color. [b]p5.[/b] Suppose $a_1 < b_1 < a_2 < b_2 <... < a_n < b_n$ are real numbers. Let $C_n$ be the union of $n$ intervals as below: $$C_n = [a_1, b_1] \cup [a_2, b_2] \cup ... \cup [a_n, b_n].$$ We say $C_n$ is minimal if there is a subset $W$ of real numbers $R$ for which both of the following hold: (a) Every real number $r$ can be written as $r = c + w$ for some $c$ in $C_n$ and some $w$ in $W$, and (b) If $D$ is a subset of $C_n$ for which every real number $r$ can be written as $r = d + w$ for some $d$ in $D$ and some $w$ in $W$, then $D = C_n$. (i) Prove that every interval $C_1 = [a_1, b_1]$ is minimal. (ii) Prove that for every positive integer $n$, the set $C_n$ is minimal PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A group of $100$ kids has a deck of $101$ cards numbered by $0, 1, 2,\dots, 100$. The first kid takes the deck, shuffles it, and then takes the cards one by one; when he takes a card (not the last one in the deck), he computes the average of the numbers on the cards he took up to that moment, and writes down this average on the blackboard. Thus, he writes down $100$ numbers, the first of which is the number on the first taken card. Then he passes the deck to the second kid which shuffles the deck and then performs the same procedure, and so on. This way, each of $100$ kids writes down $100$ numbers. Prove that there are two equal numbers among the $10000$ numbers on the blackboard.

Let $n$ be a integer $1<n<2010$, where we have a polygon with $2010$ sides and $n$ coins, we have to paint the vertices of this polygon with $n$ colors and we've to put the $n$ coins in $n$ vertices of the polygon. In each second the coins will go to the neighbour vertex, going in the clockwise. Determine the values of $n$ such that is possible paint and choose the initial position of the coins where in each second the $n$ coins are in vertices of distinct colors

Let $n$ be a positive integer and suppose that $\phi(n)=\frac{n}{k}$, where $k$ is the greatest perfect square such that $k \mid n$. Let $a_1,a_2,\ldots,a_n$ be $n$ positive integers such that $a_i=p_1^{a_1i} \cdot p_2^{a_2i} \cdots p_n^{a_ni}$, where $p_i$ are prime numbers and $a_{ji}$ are non-negative integers, $1 \leq i \leq n, 1 \leq j \leq n$. We know that $p_i\mid \phi(a_i)$, and if $p_i\mid \phi(a_j)$, then $p_j\mid \phi(a_i)$. Prove that there exist integers $k_1,k_2,\ldots,k_m$ with $1 \leq k_1 \leq k_2 \leq \cdots \leq k_m \leq n$ such that \[\phi(a_{k_{1}} \cdot a_{k_{2}} \cdots a_{k_{m}})=p_1 \cdot p_2 \cdots p_n.\]

Given a positive integer $n$. Consider a $3 \times n$ grid, a set $S$ of squares is called [i]connected[/i] if for any points $A \neq B$ in $S$, there exists an integer $l \ge 2$ and $l$ squares $A=C_1,C_2,\dots ,C_l=B$ in $S$ such that $C_i$ and $C_{i+1}$ shares a common side ($i=1,2,\dots,l-1$). Find the largest integer $K$ satisfying that however the squares are colored black or white, there always exists a [i]connected[/i] set $S$ for which the absolute value of the difference between the number of black and white squares is at least $K$.

A set of $n$ points in Euclidean 3-dimensional space, no four of which are coplanar, is partitioned into two subsets $\mathcal{A}$ and $\mathcal{B}$. An $\mathcal{AB}$-tree is a configuration of $n-1$ segments, each of which has an endpoint in $\mathcal{A}$ and an endpoint in $\mathcal{B}$, and such that no segments form a closed polyline. An $\mathcal{AB}$-tree is transformed into another as follows: choose three distinct segments $A_1B_1$, $B_1A_2$, and $A_2B_2$ in the $\mathcal{AB}$-tree such that $A_1$ is in $\mathcal{A}$ and $|A_1B_1|+|A_2B_2|>|A_1B_2|+|A_2B_1|$, and remove the segment $A_1B_1$ to replace it by the segment $A_1B_2$. Given any $\mathcal{AB}$-tree, prove that every sequence of successive transformations comes to an end (no further transformation is possible) after finitely many steps.

There are $n$ students $A_1,A_2,...,A_n$ and some of them shaked hands with each other. ($A_i$ and $A-j$ can shake hands more than one time.) Let the student $A_i$ shaked hands $d_i$ times. Suppose $d_1 + d_2 +... + d_n > 0$. Prove that there exist $1 \le i < j \le n$ satisfying the following conditions: (a) Two students $A_i$ and $A_j$ shaked hands each other. (b) $\frac{(d_1 + d_2 +... + d_n)^2}{n^2}\le d_id_j$

Let $p_n$ be the probability that $c+d$ is a perfect square when the integers $c$ and $d$ are selected independently at random from the set $\{1,2,\ldots,n\}$. Show that $\lim_{n\to\infty}p_n\sqrt n$ exists and express this limit in the form $r(\sqrt s-t)$, where $s$ and $t$ are integers and $r$ is a rational number.

There are $2^n$ airports, numbered with binary strings of length $n{}$. Any two stations whose numbers differ in exactly one digit are connected by a flight that has a price (which is the same in both directions). The sum of the prices of all $n{}$ flights leaving any station does not exceed 1. Prove that one can travel between any two airports by paying no more than 1.

Let $n$ be a positive integer relatively prime to $6$. We paint the vertices of a regular $n$-gon with three colours so that there is an odd number of vertices of each colour. Show that there exists an isosceles triangle whose three vertices are of different colours.

Suppose that every integer is colored using one of $4$ colors. Let $m, n$ be distinct odd integers such that $m + n \ne 0$. Prove that there exist integers $a$, $ b$ of the same color such that $ a - b$ equals one of the numbers $m$, $n$, $m - n$, $m + n$.

As the graph, a pond is divided into 2n (n $\geq$ 5) parts. Two parts are called neighborhood if they have a common side or arc. Thus every part has three neighborhoods. Now there are 4n+1 frogs at the pond. If there are three or more frogs at one part, then three of the frogs of the part will jump to the three neighborhoods repsectively. Prove that for some time later, the frogs at the pond will uniformily distribute. That is, for any part either there are frogs at the part or there are frogs at the each of its neighborhoods. [img]http://www.mathlinks.ro/Forum/files/china2005_2_214.gif[/img]

[b]p1.[/b] At $8$ AM Black Widow and Hawkeye began to move towards each other from two cities. They were planning to meet at the midpoint between two cities, but because Black Widow was driving $100$ mi/h faster than Hawkeye, they met at the point that is located $120$ miles from the midpoint. When they met Black Widow said ”If I knew that you drive so slow I would have started one hour later, and then we would have met exactly at the midpoint”. Find the distance between cities. [b]p2.[/b] Solve the inequality: $\frac{x-1}{x-2} \le \frac{x-2}{x-1}$. [b]p3.[/b] Solve the equation: $(x - y - z)^2 + (2x - 3y + 2z + 4)^2 + (x + y + z - 8)^2 = 0$. [b]p4.[/b] Three camps are located in the vertices of an equilateral triangle. The roads connecting camps are along the sides of the triangle. Captain America is inside the triangle and he needs to know the distances between camps. Being able to see the roads he has found that the sum of the shortest distances from his location to the roads is $50$ miles. Can you help Captain America to evaluate the distances between the camps. [b]p5.[/b] $N$ regions are located in the plane, every pair of them have a nonempty overlap. Each region is a connected set, that means every two points inside the region can be connected by a curve all points of which belong to the region. Iron Man has one charge remaining to make a laser shot. Is it possible for him to make the shot that goes through all $N$ regions? [b]p6.[/b] Numbers $1, 2, . . . , 100$ are randomly divided in two groups $50$ numbers in each. In the first group the numbers are written in increasing order and denoted $a_1$, $a_2$, $...$ , $a_{50}$. In the second group the numbers are written in decreasing order and denoted $b_1$, $b_2$, $...$, $b_{50}$. Thus, $a_1 < a_2 < ... < a_{50}$ and $b_1 > b2_ > ... > b_{50}$. Evaluate $|a_1 - b_1| + |a_2 - b_2| + ... + |a_{50} - b_{50}|$. PS. You should use hide for answers.