On football toornament there were $4$ teams participating. Every team played exactly one match with every other team. For the win, winner gets $3$ points, while if draw both teams get $1$ point. If at the end of tournament every team had different number of points and first place team had $6$ points, find the points of other teams

Let $n$ be a positive integer. Two players, Alice and Bob, are playing the following game: - Alice chooses $n$ real numbers; not necessarily distinct. - Alice writes all pairwise sums on a sheet of paper and gives it to Bob. (There are $\frac{n(n-1)}{2}$ such sums; not necessarily distinct.) - Bob wins if he finds correctly the initial $n$ numbers chosen by Alice with only one guess. Can Bob be sure to win for the following cases? a. $n=5$ b. $n=6$ c. $n=8$ Justify your answer(s). [For example, when $n=4$, Alice may choose the numbers 1, 5, 7, 9, which have the same pairwise sums as the numbers 2, 4, 6, 10, and hence Bob cannot be sure to win.]

Consider a set of $16$ points arranged in $4 \times 4$ square grid formation. Prove that if any $7$ of these points are coloured blue, then there exists an isosceles right-angled triangle whose vertices are all blue.

The fraction $\frac{3}{10}$ can be written as the sum of two positive fractions with numerator $1$ as follows: $\frac{3}{10} =\frac{1}{5}+\frac{1}{10}$ and also $\frac{3}{10}=\frac{1}{4}+\frac{1}{20}$. There are the only two ways in which this can be done. In how many ways can $\frac{3}{1984}$ be written as the sum of two positive fractions with numerator $1$? Is there a positive integer $n,$ not divisible by $3$, such that $\frac{3}{n}$ can be written as the sum of two positive fractions with numerator $1$ in exactly $1984$ ways?

There are $m$ boys and $n$ girls participate in a duet singing contest ($m,n\geq 2$). At the contest, each section there will be one show. And a show including some boy-girl duets where each boy-girl couple will sing with each other no more than one song and each participant will sing at least one song. Two show $A$ and $B$ are considered different if there is a boy-girl couple sing at show $A$ but not show $B$. The contest will end if and only if every possible shows are performed, and each show is performed exactly one time. a) A show is called [i]depend[/i] on a participant $X$ if we cancel all duets that $X$ perform, then there will be at least one another participant will not sing any song in that show. Prove that among every shows that depend on $X$, the number of shows with odd number of songs equal to the number of shows with even number of songs. b) Prove that the organizers can arrange the shows in order to make sure that the numbers of songs in two consecutive shows have different parity.

Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$. Prove that Sisyphus cannot reach the aim in less than \[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \] turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )

On a circular board there are $19$ squares numbered in order from $1$ to $19$ (to the right of $1$ is $2$, to the right of it is $3$, and so on, until $1$ is to the right of $19$). In each box there is a token. Every minute each checker moves to its right the number of the box it is in at that moment plus one; for example, the piece that is in the $7$th place leaves the first minute $7 + 1$ places to its right until the $15$th square; the second minute that same checker moves to your right $15 + 1$ places, to square $12$, etc. Determine if at some point all the tokens reach the place where they started and, if so, say how many minutes must elapse. [hide=original wording]En un tablero circular hay 19 casillas numeradas en orden del 1 al 19 (a la derecha del 1 está el 2, a la derecha de éste está el 3 y así sucesivamente, hasta el 1 que está a la derecha del 19). En cada casilla hay una ficha. Cada minuto cada ficha se mueve a su derecha el número de la casilla en que se encuentra en ese momento más una; por ejemplo, la ficha que está en el lugar 7 se va el primer minuto 7 + 1 lugares a su derecha hasta la casilla 15; el segundo minuto esa misma ficha se mueve a su derecha 15 + 1 lugares, hasta la casilla 12, etc. Determinar si en algún momento todas las fichas llegan al lugar donde empezaron y, si es así, decir cuántos minutos deben transcurrir.[/hide]

At a maths contest $n$ books are given as prizes to $n$ students (each students gets one book). In how many ways can the organisers give these prizes if they have $n$ copies of one book and $2n+1$ other books each in one copy?

In every cell of a board $101 \times 101$ is written a positive integer. For any choice of $101$ cells from different rows and columns, their sum is divisible by $101$. Show that the number of ways to choose a cell from each row of the board, so that the total sum of the numbers in the chosen cells is divisible by $101$, is divisible by $101$.

The only pieces on an $8\times8$ chessboard are three rooks. Each moves along a row or a column without running to or jumping over another rook. The white rook starts at the bottom left corner, the black rook starts in the square directly above the white rook, and the red rook starts in the square directly to the right of the white rook. The white rook is to finish at the top right corner, the black rook in the square directly to the left of the white rook, and the red rook in the square directly below the white rook. At all times, each rook must be either in the same row or the same column as another rook. Is it possible to get the rooks to their destinations?

There are $2020$ points on the coordinate plane {$A_i = (x_i, y_i):i = 1, ..., 2020$}, satisfying $$0=x_1<x_2<...<x_{2020}$$ $$0=y_{2020}<y_{2019}<...<y_1$$ Let $O=(0, 0)$ be the origin, $OA_1A_2...A_{2020}$ forms a polygon $C$. Now, you want to blacken the polygon $C$. Every time you can choose a point $(x,y)$ with $x, y > 0$, and blacken the area {$(x', y'): 0\leq x' \leq x, 0\leq y' \leq y$}. However, you have to pay $xy$ dollars for doing so. Prove that you could blacken the whole polygon $C$ by using $4|C|$ dollars. Here, $|C|$ stands for the area of the polygon $C$. [i]Proposed by me[/i]

In each field of 2009*2009 table you can write either 1 or -1. Denote Ak multiple of all numbers in k-th row and Bj the multiple of all numbers in j-th column. Is it possible to write the numbers in such a way that $ \sum_{i\equal{}1}^{2009}{Ai}\plus{} \sum_{i\equal{}1}^{2009}{Bi}\equal{}0$?

Show that if we choose any $n + 2$ distinct numbers from the set $\{1, 2, 3, . . . , 3n\}$ there will be two whose difference is greater than $n$ and smaller than $2n$.

Let $n\ge 3$ be an integer. Put $n^2$ cards, each labelled $1,2,\ldots ,n^2$ respectively, in any order into $n$ empty boxes such that there are exactly $n$ cards in each box. One can perform the following operation: one first selects $2$ boxes, takes out any $2$ cards from each of the selected boxes, and then return the cards to the other selected box. Prove that, for any initial order of the $n^2$ cards in the boxes, one can perform the operation finitely many times such that the labelled numbers in each box are consecutive integers.

[b]p1. [/b] In basketball, teams can score $1, 2$, or $3$ points each time. Suppose that Duke basketball have scored $8$ points so far. What is the total number of possible ways (ordered) that they have scored? For example, $(1, 2, 2, 2, 1)$,$(1, 1, 2, 2, 2)$ are two different ways. [b]p2.[/b] All the positive integers that are coprime to $2021$ are grouped in increasing order, such that the nth group contains $2n - 1$ numbers. Hence the first three groups are $\{1\}$, $\{2, 3, 4\}$, $\{5, 6, 7, 8, 9\}$. Suppose that $2022$ belongs to the $k$th group. Find $k$. [b]p3.[/b] Let $A = (0, 0)$ and $B = (3, 0)$ be points in the Cartesian plane. If $R$ is the set of all points $X$ such that $\angle AXB \ge 60^o$ (all angles are between $0^o$ and $180^o$), find the integer that is closest to the area of $R$. [b]p4.[/b] What is the smallest positive integer greater than $9$ such that when its left-most digit is erased, the resulting number is one twenty-ninth of the original number? [b]p5. [/b] Jonathan is operating a projector in the cartesian plane. He sets up $2$ infinitely long mirrors represented by the lines $y = \tan(15^o)x$ and $y = 0$, and he places the projector at $(1, 0)$ pointed perpendicularly to the $x$-axis in the positive $y$ direction. Jonathan furthermore places a screen on one of the mirrors such that light from the projector reflects off the mirrors a total of three times before hitting the screen. Suppose that the coordinates of the screen is $(a, b)$. Find $10a^2 + 5b^2$. [b]p6.[/b] Dr Kraines has a cube of size $5 \times 5 \times 5$, which is made from $5^3$ unit cubes. He then decides to choose $m$ unit cubes that have an outside face such that any two different cubes don’t share a common vertex. What is the maximum value of $m$? [b]p7.[/b] Let $a_n = \tan^{-1}(n)$ for all positive integers $n$. Suppose that $$\sum_{k=4}^{\infty}(-1)^{\lfloor \frac{k}{2} \rfloor +1} \tan(2a_k)$$ is equals to $a/b$ , where $a, b$ are relatively prime. Find $a + b$. [b]p8.[/b] Rishabh needs to settle some debts. He owes $90$ people and he must pay \$ $(101050 + n)$ to the $n$th person where $1 \le n \le 90$. Rishabh can withdraw from his account as many coins of values \$ $2021$ and \$ $x$ for some fixed positive integer $x$ as is necessary to pay these debts. Find the sum of the four least values of $x$ so that there exists a person to whom Rishabh is unable to pay the exact amount owed using coins. [b]p9.[/b] A frog starts at $(1, 1)$. Every second, if the frog is at point $(x, y)$, it moves to $(x + 1, y)$ with probability $\frac{x}{x+y}$ and moves to $(x, y + 1)$ with probability $\frac{y}{x+y}$ . The frog stops moving when its $y$ coordinate is $10$. Suppose the probability that when the frog stops its $x$-coordinate is strictly less than $16$, is given by $m/n$ where $m, n$ are positive integers that are relatively prime. Find $m + n.$ [b]p10.[/b] In the triangle $ABC$, $AB = 585$, $BC = 520$, $CA = 455$. Define $X, Y$ to be points on the segment $BC$. Let $Z \ne A$ be the intersection of $AY$ with the circumcircle of $ABC$. Suppose that $XZ$ is parallel to $AC$ and the circumcircle of $XYZ$ is tangent to the circumcircle of $ABC$ at $Z$. Find the length of $XY$ . PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The eight points $A, B,. . ., G$ and $H$ lie on five circles as shown. Each of these letters are represented by one of the eight numbers $1, 2,. . ., 7$ and $ 8$ replaced so that the following conditions are met: (i) Each of the eight numbers is used exactly once. (ii) The sum of the numbers on each of the five circles is the same. How many ways are there to get the letters substituted through the numbers in this way? (Walther Janous) [img]https://cdn.artofproblemsolving.com/attachments/5/e/511cdd2fc31e8067f400369c4fe9cf964ef54c.png[/img]

Let $n$ and $k$ be two integers with $n>k\geqslant 1$. There are $2n+1$ students standing in a circle. Each student $S$ has $2k$ [i]neighbors[/i] - namely, the $k$ students closest to $S$ on the left, and the $k$ students closest to $S$ on the right. Suppose that $n+1$ of the students are girls, and the other $n$ are boys. Prove that there is a girl with at least $k$ girls among her neighbors. [i]Proposed by Gurgen Asatryan, Armenia[/i]

Let $A$ and $E$ be opposite vertices of an octagon. A frog starts at vertex $A.$ From any vertex except $E$ it jumps to one of the two adjacent vertices. When it reaches $E$ it stops. Let $a_n$ be the number of distinct paths of exactly $n$ jumps ending at $E$. Prove that: \[ a_{2n-1}=0, \quad a_{2n}={(2+\sqrt2)^{n-1} - (2-\sqrt2)^{n-1} \over\sqrt2}. \]

Let $m$ and $n$ be positive integers. A sequence of points $(A_0,A_1,\ldots,A_n)$ on the Cartesian plane is called [i]interesting[/i] if $A_i$ are all lattice points, the slopes of $OA_0,OA_1,\cdots,OA_n$ are strictly increasing ($O$ is the origin) and the area of triangle $OA_iA_{i+1}$ is equal to $\frac{1}{2}$ for $i=0,1,\ldots,n-1$. Let $(B_0,B_1,\cdots,B_n)$ be a sequence of points. We may insert a point $B$ between $B_i$ and $B_{i+1}$ if $\overrightarrow{OB}=\overrightarrow{OB_i}+\overrightarrow{OB_{i+1}}$, and the resulting sequence $(B_0,B_1,\ldots,B_i,B,B_{i+1},\ldots,B_n)$ is called an [i]extension[/i] of the original sequence. Given two [i]interesting[/i] sequences $(C_0,C_1,\ldots,C_n)$ and $(D_0,D_1,\ldots,D_m)$, prove that if $C_0=D_0$ and $C_n=D_m$, then we may perform finitely many [i]extensions[/i] on each sequence until the resulting two sequences become identical.

We place randomly the numbers $1,2, \dots ,2006$ around a circle. A move consists of changing two neighbouring numbers. After a limited numbers of moves all the numbers are diametrically opposite to their starting position. Show that we changed at least once two numbers which had the sum $2007$.

Let $ M=\{1,2,...,2013\} $ and let $ \Gamma $ be a circle. For every nonempty subset $ B $ of the set $ M $, denote by $ S(B) $ sum of elements of the set $ B $, and define $ S(\varnothing)=0 $ ( $ \varnothing $ is the empty set ). Is it possible to join every subset $ B $ of $ M $ with some point $ A $ on the circle $ \Gamma $ so that following conditions are fulfilled: $ 1 $. Different subsets are joined with different points; $ 2 $. All joined points are vertices of a regular polygon; $ 3 $. If $ A_1,A_2,...,A_k $ are some of the joined points, $ k>2 $ , such that $ A_1A_2...A_k $ is a regular $ k-gon $, then $ 2014 $ divides $ S(B_1)+S(B_2)+...+S(B_k) $ ?

Let $n$ be an positive integer. Find the smallest integer $k$ with the following property; Given any real numbers $a_1 , \cdots , a_d $ such that $a_1 + a_2 + \cdots + a_d = n$ and $0 \le a_i \le 1$ for $i=1,2,\cdots ,d$, it is possible to partition these numbers into $k$ groups (some of which may be empty) such that the sum of the numbers in each group is at most $1$.

An airline operates flights between any two capital cities in the European Union. Each flight has a fixed price which is the same in both directions. Furthermore, the flight prices from any given city are pairwise distinct. Anna and Bella wish to visit each city exactly once, not necessarily starting from the same city. While Anna always takes the cheapest flight from her current city to some city she hasn't visited yet, Bella always continues her tour with the most expensive flight available. Is it true that Bella's tour will surely cost at least as much as Anna's tour? [i](Based on a Soviet problem)[/i]

The REAL country has $n$ islands, and there are $n-1$ two-way bridges connecting these islands. Any two islands can be reached through a series of bridges. Arctan, the king of the REAL country, found that it is too difficult to manage $n$ islands, so he wants to bomb some islands and their connecting bridges to divide the country into multiple small areas. Arctan wants the number of connected islands in each group is less than $\delta n$ after bombing these islands, and the island he bomb must be a connected area. Besides, Arctan wants the number of islands to be bombed to be as less as possible. Find all real numbers $\delta$ so that for any positive integer $n$ and the layout of the bridge, the method of bombing the islands is the only one. [i]Proposed by chengbilly[/i]

The numbers $1, 2,. . . , 10000, $ were placed in the cells of a $100 \times 100$ square, each once; in this case, numbers differing by $1$ are written in cells adjacent to each side. After that we calculated distances between the centers of every two cells whose numbers differ by exactly $5000$. Let $S$ be the minimum of these distances What is the largest value $S$ can take?