In a tennis tournament, $n$ players want to make $2$ vs $2$ matches such that each player has each of the other players as opponents exactly once. Find all possible values of $n$.

For a rational point (x,y), if xy is an integer that divided by 2 but not 3, color (x,y) red, if xy is an integer that divided by 3 but not 2, color (x,y) blue. Determine whether there is a line segment in the plane such that it contains exactly 2017 blue points and 58 red points.

Let $n$ be a positive integer. What is the smallest value of $m$ with $m > n$ such that the set $M = \{n, n + 1, ..., m\}$ can be partitioned into subsets so that in each subset, there is a number which equals to the sum of all other numbers of this subset?

Let $f$ be a function defined on the positive integers with $f(n) \ge 0$ and $f(n) \le f(n+1)$ for all $n$. Prove that if \[\sum_{n = 1}^{\infty} \frac{f(n)}{n^2}\] diverges, there exists a sequence $a_1, a_2, \dots$ such that the sequence $\tfrac{a_n}{n}$ hits every natural number, while \[a_{n+m} \le a_n + a_m + f(n+m)\] holds for every pair $n$, $m$.

For each integer $n\ge 1,$ compute the smallest possible value of \[\sum_{k=1}^{n}\left\lfloor\frac{a_k}{k}\right\rfloor\] over all permutations $(a_1,\dots,a_n)$ of $\{1,\dots,n\}.$ [i]Proposed by Shahjalal Shohag, Bangladesh[/i]

[b]p1.[/b] Find $20 \cdot 18 + 20 + 18 + 1$. [b]p2.[/b] Suzie’s Ice Cream has $10$ flavors of ice cream, $5$ types of cones, and $5$ toppings to choose from. An ice cream cone consists of one flavor, one cone, and one topping. How many ways are there for Sebastian to order an ice cream cone from Suzie’s? [b]p3.[/b] Let $a = 7$ and $b = 77$. Find $\frac{(2ab)^2}{(a+b)^2-(a-b)^2}$ . [b]p4.[/b] Sebastian invests $100,000$ dollars. On the first day, the value of his investment falls by $20$ percent. On the second day, it increases by $25$ percent. On the third day, it falls by $25$ percent. On the fourth day, it increases by $60$ percent. How many dollars is his investment worth by the end of the fourth day? [b]p5.[/b] Square $ABCD$ has side length $5$. Points $K,L,M,N$ are on segments $AB$,$BC$,$CD$,$DA$ respectively,such that $MC = CL = 2$ and $NA = AK = 1$. The area of trapezoid $KLMN$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Find $m + n$. [b]p6.[/b] Suppose that $p$ and $q$ are prime numbers. If $p + q = 30$, find the sum of all possible values of $pq$. [b]p7.[/b] Tori receives a $15 - 20 - 25$ right triangle. She cuts the triangle into two pieces along the altitude to the side of length $25$. What is the difference between the areas of the two pieces? [b]p8.[/b] The factorial of a positive integer $n$, denoted $n!$, is the product of all the positive integers less than or equal to $n$. For example, $1! = 1$ and $5! = 120$. Let $m!$ and $n!$ be the smallest and largest factorial ending in exactly $3$ zeroes, respectively. Find $m + n$. [b]p9.[/b] Sam is late to class, which is located at point $B$. He begins his walk at point $A$ and is only allowed to walk on the grid lines. He wants to get to his destination quickly; how many paths are there that minimize his walking distance? [img]https://cdn.artofproblemsolving.com/attachments/a/5/764e64ac315c950367357a1a8658b08abd635b.png[/img] [b]p10.[/b] Mr. Iyer owns a set of $6$ antique marbles, where $1$ is red, $2$ are yellow, and $3$ are blue. Unfortunately, he has randomly lost two of the marbles. His granddaughter starts drawing the remaining $4$ out of a bag without replacement. She draws a yellow marble, then the red marble. Suppose that the probability that the next marble she draws is blue is equal to $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positiveintegers. What is $m + n$? [b]p11.[/b] If $a$ is a positive integer, what is the largest integer that will always be a factor of $(a^3+1)(a^3+2)(a^3+3)$? [b]p12.[/b] What is the largest prime number that is a factor of $160,401$? [b]p13.[/b] For how many integers $m$ does the equation $x^2 + mx + 2018 = 0$ have no real solutions in $x$? [b]p14.[/b] What is the largest palindrome that can be expressed as the product of two two-digit numbers? A palindrome is a positive integer that has the same value when its digits are reversed. An example of a palindrome is $7887887$. [b]p15.[/b] In circle $\omega$ inscribe quadrilateral $ADBC$ such that $AB \perp CD$. Let $E$ be the intersection of diagonals $AB$ and $CD$, and suppose that $EC = 3$, $ED = 4$, and $EB = 2$. If the radius of $\omega$ is $r$, then $r^2 =\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Determine $m + n$. [b]p16.[/b] Suppose that $a, b, c$ are nonzero real numbers such that $2a^2 + 5b^2 + 45c^2 = 4ab + 6bc + 12ca$. Find the value of $\frac{9(a + b + c)^3}{5abc}$ . [b]p17.[/b] Call a positive integer n spicy if there exist n distinct integers $k_1, k_2, ... , k_n$ such that the following two conditions hold: $\bullet$ $|k_1| + |k_2| +... + |k_n| = n2$, $\bullet$ $k_1 + k_2 + ...+ k_n = 0$. Determine the number of spicy integers less than $10^6$. [b]p18.[/b] Consider the system of equations $$|x^2 - y^2 - 4x + 4y| = 4$$ $$|x^2 + y^2 - 4x - 4y| = 4.$$ Find the sum of all $x$ and $y$ that satisfy the system. [b]p19.[/b] Determine the number of $8$ letter sequences, consisting only of the letters $W,Q,N$, in which none of the sequences $WW$, $QQQ$, or $NNNN$ appear. For example, $WQQNNNQQ$ is a valid sequence, while $WWWQNQNQ$ is not. [b]p20.[/b] Triangle $\vartriangle ABC$ has $AB = 7$, $CA = 8$, and $BC = 9$. Let the reflections of $A,B,C$ over the orthocenter H be $A'$,$B'$,$C'$. The area of the intersection of triangles $ABC$ and $A'B'C'$ can be expressed in the form $\frac{a\sqrt{b}}{c}$ , where $b$ is squarefree and $a$ and $c$ are relatively prime. determine $a+b+c$. (The orthocenter of a triangle is the intersection of its three altitudes.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A set of $2003$ positive integers is given. Show that one can find two elements such that their sum is not a divisor of the sum of the other elements.

Marisa has a collection of $2^8-1=255$ distinct nonempty subsets of $\{1, 2, 3, 4, 5, 6, 7, 8\}$. For each step she takes two subsets chosen uniformly at random from the collection, and replaces them with either their union or their intersection, chosen randomly with equal probability. (The collection is allowed to contain repeated sets.) She repeats this process $2^8-2=254$ times until there is only one set left in the collection. What is the expected size of this set?

[b]p1.[/b] Find the unknown angle $a$ of the triangle inscribed in the square. [img]https://cdn.artofproblemsolving.com/attachments/b/1/4aab5079dea41637f2fa22851984f886f034df.png[/img] [b]p2.[/b] Draw a polygon in the plane and a point outside of it with the following property: no edge of the polygon is completely visible from that point (in other words, the view is obstructed by some other edge). [b]p3.[/b] This problem has two parts. In each part, $2022$ real numbers are given, with some additional property. (a) Suppose that the sum of any three of the given numbers is an integer. Show that the total sum of the $2022$ numbers is also an integer. (b) Suppose that the sum of any five of the given numbers is an integer. Show that 5 times the total sum of the $2022$ numbers is also an integer, but the sum itself is not necessarily an integer. [b]p4.[/b] Replace stars with digits so that the long multiplication in the example below is correct. [img]https://cdn.artofproblemsolving.com/attachments/9/7/229315886b5f122dc0675f6d578624e83fc4e0.png[/img] [b]p5.[/b] Five nodes of a square grid paper are marked (called marked points). Show that there are at least two marked points such that the middle point of the interval connecting them is also a node of the square grid paper [b]p6.[/b] Solve the system $$\begin{cases} \dfrac{xy}{x+y}=\dfrac{8}{3} \\ \dfrac{yz}{y+z}=\dfrac{12}{5} \\\dfrac{xz}{x+z}=\dfrac{24}{7} \end{cases}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n,k$ be positive integers such that $n>k$. There is a square-shaped plot of land, which is divided into $n\times n$ grid so that each cell has the same size. The land needs to be plowed by $k$ tractors; each tractor will begin on the lower-left corner cell and keep moving to the cell sharing a common side until it reaches the upper-right corner cell. In addition, each tractor can only move in two directions: up and right. Determine the minimum possible number of unplowed cells.

In a group of $n$ people each one has an Easter Egg. They exchange their eggs in the following way: On each exchange two people exchange the eggs they currently have. Each two exchange eggs between themselves at least once. After a certain amount of such exchanges it turned out that each one of the $n$ people had the same egg he had from the beginning. Determine the least amount of exchanges needed, if: a) $n=5$; b) $n=6$.

The intramural squash league has 5 players, namely Albert, Bassim, Clara, Daniel, and Eugene. Albert has played one game, Bassim has played two games, Clara has played 3 games, and Daniel has played 4 games. Assuming no two players in the league play each other more than one time, how many games has Eugene played?

Suppose that $ a_1$, $ a_2$, $ \ldots$, $ a_n$ are integers such that $ n\mid a_1 \plus{} a_2 \plus{} \ldots \plus{} a_n$. Prove that there exist two permutations $ \left(b_1,b_2,\ldots,b_n\right)$ and $ \left(c_1,c_2,\ldots,c_n\right)$ of $ \left(1,2,\ldots,n\right)$ such that for each integer $ i$ with $ 1\leq i\leq n$, we have \[ n\mid a_i \minus{} b_i \minus{} c_i \] [i]Proposed by Ricky Liu & Zuming Feng, USA[/i]

Let $0<p<1$ be given. Initially, we have $n$ coins, all of which have probability $p$ of landing on heads, and probability $1-p$ of landing on tails (the results of the tosses are independent of each other). In each round, we toss our coins and remove those that result in heads. We keep repeating this until all our coins are removed. Let $k_n$ denote the expected number of rounds that are needed to get rid of all the coins. Prove that there exists $c>0$ for which the following inequality holds for all $n>0$ \[c\bigg(1+\frac{1}{2}+\cdots+\frac{1}{n}\bigg)<k_n<1+c\bigg(1+\frac{1}{2}+\cdots+\frac{1}{n}\bigg).\]

An arrangement of chips in the squares of $ n\times n$ table is called [i]sparse[/i] if every $ 2\times 2$ square contains at most 3 chips. Serge put chips in some squares of the table (one in a square) and obtained a sparse arrangement. He noted however that if any chip is moved to any free square then the arrangement is no more sparce. For what $ n$ is this possible? [i]Proposed by S. Berlov[/i]

All sides and diagonals of a convex $n$-gon, $n\ge 3$, are coloured one of two colours. Show that there exist $\left[\frac{n+1}{3}\right]$ pairwise disjoint monochromatic segments. [i](Two segments are disjoint if they do not share an endpoint or an interior point).[/i]

Set $S=\{1,2,...,n\}$ is firstly divided on $m$ disjoint nonempty subsets, and then on $m^2$ disjoint nonempty subsets. Prove that some $m$ elements of set $S$ were after first division in same set, and after the second division were in $m$ different sets

By one magic nut, Wicked Witch can either turn a flea into a beetle or a spider into a bug; while by one magic acorn, she can either turn a flea into a spider or a beetle into a bug. In the evening Wicked Witch had spent 20 magic nuts and 23 magic acorns. By these actions, the number of beetles increased by 5. Determine what was the change in the number of spiders. (Find all possible answers and prove that the other answers are impossible.)

Let $C$ be a unit circle and $n \ge 1$ be a fixed integer. For any set $A$ of $n$ points $P_1,..., P_n$ on $C$ define $D(A) = \underset{d}{max}\, \underset{i}{min}\delta (P_i, d)$, where $d$ goes over all diameters of $C$ and $\delta (P, \ell)$ denotes the distance from point $P$ to line $\ell$. Let $F_n$ be the family of all such sets $A$. Determine $D_n = \underset{A\in F_n}{min} D(A)$ and describe all sets $A$ with $D(A) = D_n$.

$30$ volleyball teams have participated in a league. Any two teams have played a match with each other exactly once. At the end of the league, a match is called [b]unusual[/b] if at the end of the league, the winner of the match have a smaller amount of wins than the loser of the match. A team is called [b]astonishing[/b] if all its matches are [b]unusual[/b] matches. Find the maximum number of [b]astonishing[/b] teams.

Determine if there is a way to tile a $5 \times 6$ unit square board by dominos such that one can not use a needle to peer through the tiling? Determine if there is a way to tile a $5 \times 6$ unit square board by dominos such that one can use a needle to through the tiling? What if it is a $6 \times 6$ board?

Viktor and Natalia play a colouring game with a 3-dimensional cube taking turns alternatingly. Viktor goes first, and on each of his turns, he selects an unpainted edge, and paints it violet. On each of Natalia's turns, she selects an unpainted edge, or at most once during the game a face diagonal, and paints it neon green. If the player on turn cannot make a legal move, then the turn switches to the other player. The game ends when nobody can make any more legal moves. Natalia wins if at the end of the game every vertex of the cube can be reached from every other vertex by traveling only along neon green segments (edges or diagonal), otherwise Viktor wins. Who has a winning strategy? (Prove your answer.) [i]Authored by Viktor Simjanoski[/i]

$6k+2$ people play in odd or even championship. In each odd or even match they participate exactly two people. Six rounds have been arranged so that in each round there are $3k + 1$ simultaneous matches, and no player participates in two games of the same round. It is known that two people do not play with each other more than one turn. Prove that there are $k + 1$ people where any two of them have not played each other. [hide=original wording] 6k+2 pessoas jogam em campeonato de par ou impar. Em cada partida de par ou impar participam exatamente duas pessoas. Seis rodadas foram organizadas, de modo que, em cada rodada, ha 3k + 1 partidas simultaneas, e nenhum jogador participa de dois jogos da mesma rodada. Sabe-se que duas pessoas nao jogam entre si mais de uma vez. Prove que existem k + 1 pessoas em que quaisquer duas delas nao jogaram entre si. [/quote]

Let $ABC$ be an equilateral triangle. From the vertex $A$ we draw a ray towards the interior of the triangle such that the ray reaches one of the sides of the triangle. When the ray reaches a side, it then bounces off following the law of reflection, that is, if it arrives with a directed angle $\alpha$, it leaves with a directed angle $180^{\circ}-\alpha$. After $n$ bounces, the ray returns to $A$ without ever landing on any of the other two vertices. Find all possible values of $n$.

At each vertex of a $13$-sided polygon we write one of the numbers $1,2,3,…, 12,13$, without repeating. Then, on each side of the polygon we write the difference of the numbers of the vertices of its ends (the largest minus the smallest). For example, if two consecutive vertices of the polygon have the numbers $2$ and $11$, the number $9$ is written on the side they determine. a) Is it possible to number the vertices of the polygon so that only the numbers $3, 4$ and $5$ are written on the sides? b) Is it possible to number the vertices of the polygon so that only the numbers $3, 4$ and $6$ are written on the sides?