a) There are 8 teams in a Quidditch tournament. Each team plays every other team once without draws. Prove that there exist teams $A,B,C,D$ such that pairs of teams $A,B$ and $C,D$ won the same number of games in total. b) There are 25 teams in a Quidditch tournament. Each team plays every other team once without draws. Prove that there exist teams $A,B,C,D,E,F$ such that pairs of teams $A,B,$ $~$ $C,D$ and $E,F$ won the same number of games in total.

Is it possible to partition the set of positive integer numbers into two classes, none of which contains an infinite arithmetic sequence (with a positive ratio)? What is we impose the extra condition that in each class $\mathcal{C}$ of the partition, the set of difference \begin{align*} \left\{ \min \{ n \in \mathcal{C} \mid n >m \} -m \mid m \in \mathcal{C} \right \} \end{align*} be bounded?

Let $f: \mathbb{N} \rightarrow \mathbb{N}$ be a function, and let $f^m$ be $f$ applied $m$ times. Suppose that for every $n \in \mathbb{N}$ there exists a $k \in \mathbb{N}$ such that $f^{2k}(n)=n+k$, and let $k_n$ be the smallest such $k$. Prove that the sequence $k_1,k_2,\ldots $ is unbounded. [i]Proposed by Palmer Mebane, United States[/i]

A regular hexagon, as shown in the attachment, is dissected into 54 congruent equilateral triangles by parallels to its sides. Within the figure we yield exactly 37 points which are vertices of at least one of those triangles. Those points are enumerated in an arbitrary way. A triangle is called [i]clocky[/i] if running in a clockwise direction from the vertex with the smallest assigned number, we pass a medium number and finally reach the vertex with the highest number. Prove that at least 19 out of 54 triangles are clocky.

Is it possible to partition three-dimensional space into tetrahedra (not necessarily regular) such that there exists a plane that intersects the edges of each tetrahedron at exactly 4 or 0 points? Proposed by Arvin Taheri

[b]p1.[/b] Given that $7 \times 22 \times 13 = 2002$, compute $14 \times 11 \times 39$. [b]p2.[/b] Ariel the frog is on the top left square of a $8 \times 10$ grid of squares. Ariel can jump from any square on the grid to any adjacent square, including diagonally adjacent squares. What is the minimum number of jumps required so that Ariel reaches the bottom right corner? [b]p3.[/b] The distance between two floors in a building is the vertical distance from the bottom of one floor to the bottom of the other. In Evans hall, the distance from floor $7$ to floor $5$ is $30$ meters. There are $12$ floors on Evans hall and the distance between any two consecutive floors is the same. What is the distance, in meters, from the first floor of Evans hall to the $12$th floor of Evans hall? [b]p4.[/b] A circle of nonzero radius $ r$ has a circumference numerically equal to $\frac13$ of its area. What is its area? [b]p5.[/b] As an afternoon activity, Emilia will either play exactly two of four games (TwoWeeks, DigBuild, BelowSaga, and FlameSymbol) or work on homework for exactly one of three classes (CS61A, Math 1B, Anthro 3AC). How many choices of afternoon activities does Emilia have? [b]p6.[/b] Matthew wants to buy merchandise of his favorite show, Fortune Concave Decagon. He wants to buy figurines of the characters in the show, but he only has $30$ dollars to spend. If he can buy $2$ figurines for $4$ dollars and $5$ figurines for $8$ dollars, what is the maximum number of figurines that Matthew can buy? [b]p7.[/b] When Dylan is one mile from his house, a robber steals his wallet and starts to ride his motorcycle in the direction opposite from Dylan’s house at $40$ miles per hour. Dylan dashes home at $10$ miles per hour and, upon reaching his house, begins driving his car at $60$ miles per hour in the direction of the robber’s motorcycle. How long, starting from when the robber steals the wallet, does it take for Dylan to catch the robber? Express your answer in minutes. [b]p8.[/b] Deepak the Dog is tied with a leash of $7$ meters to a corner of his $4$ meter by $6$ meter rectangular shed such that Deepak is outside the shed. Deepak cannot go inside the shed, and the leash cannot go through the shed. Compute the area of the region that Deepak can travel to. [img]https://cdn.artofproblemsolving.com/attachments/f/8/1b9563776325e4e200c3a6d31886f4020b63fa.png[/img] [b]p9.[/b] The quadratic equation $a^2x^2 + 2ax -3 = 0$ has two solutions for x that differ by $a$, where $a > 0$. What is the value of $a$? [b]p10.[/b] Find the number of ways to color a $2 \times 2$ grid of squares with $4$ colors such that no two (nondiagonally) adjacent squares have the same color. Each square should be colored entirely with one color. Colorings that are rotations or reflections of each other should be considered different. [b]p11[/b]. Given that $\frac{1}{y^2+5} - \frac{3}{y^4-39} = 0$, and $y \ge 0$, compute $y$. [b]p12.[/b] Right triangle $ABC$ has $AB = 5$, $BC = 12$, and $CA = 13$. Point $D$ lies on the angle bisector of $\angle BAC$ such that $CD$ is parallel to $AB$. Compute the length of $BD$. [img]https://cdn.artofproblemsolving.com/attachments/c/3/d5cddb0e8ac43c35ddfc94b2a74b8d022292f2.png[/img] [b]p13.[/b] Let $x$ and $y$ be real numbers such that $xy = 4$ and $x^2y + xy^2 = 25$. Find the value of $x^3y +x^2y^2 + xy^3$. [b]p14.[/b] Shivani is planning a road trip in a car with special new tires made of solid rubber. Her tires are cylinders that are $6$ inches in width and have diameter $26$ inches, but need to be replaced when the diameter is less than $22$ inches. The tire manufacturer says that $0.12\pi$ cubic inches will wear away with every single rotation. Assuming that the tire manufacturer is correct about the wear rate of their tires, and that the tire maintains its cylindrical shape and width (losing volume by reducing radius), how many revolutions can each tire make before she needs to replace it? [b]p15.[/b] What’s the maximum number of circles of radius $4$ that fit into a $24 \times 15$ rectangle without overlap? [b]p16.[/b] Let $a_i$ for $1 \le i \le 10$ be a finite sequence of $10$ integers such that for all odd $i$, $a_i = 1$ or $-1$, and for all even $i$, $a_i = 1$, $-1$, or $0$. How many sequences a_i exist such that $a_1+a_2+a_3+...+a_{10} = 0$? [b]p17.[/b] Let $\vartriangle ABC$ be a right triangle with $\angle B = 90^o$ such that $AB$ and $BC$ have integer side lengths. Squares $ABDE$ and $BCFG$ lie outside $\vartriangle ABC$. If the area of $\vartriangle ABC$ is $12$, and the area of quadrilateral $DEFG$ is $38$, compute the perimeter of $\vartriangle ABC$. [img]https://cdn.artofproblemsolving.com/attachments/b/6/980d3ba7d0b43507856e581476e8ad91886656.png[/img] [b]p18.[/b] What is the smallest positive integer $x$ such that there exists an integer $y$ with $\sqrt{x} +\sqrt{y} = \sqrt{1025}$ ? [b]p19. [/b]Let $a =\underbrace{19191919...1919}_{19\,\, is\,\,repeated\,\, 3838\,\, times}$. What is the remainder when $a$ is divided by $13$? [b]p20.[/b] James is watching a movie at the cinema. The screen is on a wall and is $5$ meters tall with the bottom edge of the screen $1.5$ meters above the floor. The floor is sloped downwards at $15$ degrees towards the screen. James wants to find a seat which maximizes his vertical viewing angle (depicted below as $\theta$ in a two dimensional cross section), which is the angle subtended by the top and bottom edges of the screen. How far back from the screen in meters (measured along the floor) should he sit in order to maximize his vertical viewing angle? [img]https://cdn.artofproblemsolving.com/attachments/1/5/1555fb2432ee4fe4903accc3b74ea7215bc007.png[/img] PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In a math competition, $14$ schools participate, each sending $14$ students. The students are separated into $14$ groups of $14$ so that no two students from the same school are in the same group. The tournament organizers noted that, from the competitors, exactly $15$ have participated in the competition before. The organizers want to select two representatives, with the conditions that they must be former participants, must come from different schools, and must also be in different groups. It turns out that there are $ n$ ways to do this. What is the minimum possible value of $n$?

Let $k\geq 2$ be an integer. We want to determine the weight of $n$ balls. One try consists of choosing two balls, and we are given the sum of the weights of the two chosen balls. We know that at most $k$ of the answers can be wrong. Let $f_k(n)$ denote the smallest number for which it is true that we can always find the weights of the balls with $f_k(n)$ tries (the tries don't have to be decided in advance). Prove that there exist numbers $a_k$ and $b_k$ for which $|f_k(n)-a_kn|\leq b_k$ holds. [i]Proposed by Surányi László, Budapest and Bálint Virág, Toronto[/i]

In a certain city there are $n$ straight streets, such that every two streets intersect, and no three streets pass through the same intersection. The City Council wants to organize the city by designating the main and the side street on every intersection. Prove that this can be done in such way that if one goes along one of the streets, from its beginning to its end, the intersections where this street is the main street, and the ones where it is not, will apear in alternating order. [i]Proposed by Serbia[/i]

Snow White has, in her huge basket, $2021$ apples, and she knows that exactly one of them has a deadly poison, capable of killing a human being hours after ingesting just a measly piece. Contrary to what the fairy tales say, Snow White is more malevolent than the Evil Queen, and doesn't care about the lives of the seven dwarfs. Therefore, she decided to use them to find out which apple is poisonous. To this end, at the beginning of each day, Snow White prepares some apple salads (each salad is a mixture of pieces of some apples chosen by her), and forces some of the dwarfs (possibly all) to eat a salad each. At the end of the day, she notes who died and who survived, and the next day she again prepares some apple salads, forcing some of the surviving dwarves (possibly all) to eat a salad each. And she continues to do this, day after day, until she discovers the poisoned apple or until all the dwarves die. (a) Prove that there is a strategy in which Snow White manages to discover the poisoned apple after a few days. (b) What is the minimum number of days Snow White needs to find the poisoned apple, no matter how lucky she is?

In Thailand there are $n$ cities. Each pair of cities is connected by a one-way street which can be borrowed, depending on its type, only by bike or by car. Show that there is a city from which you can reach any other city, either by bike or by car. [i]Remark : It is not necessary to use the same means of transport for each city[/i]

A subset $S$ of size $n$ of a plane consisting of points with both coordinates integer is given, where $n$ is an odd number. The injective function $f\colon S\rightarrow S$ satisfies the following: for each pair of points $A, B\in S$, the distance between points $f(A)$ and $f(B)$ is not smaller than the distance between points $A$ and $B$. Prove there exists a point $X$ such that $f(X)=X$.

A closed, non-self-intersecting broken line $L$ is drawn over a $(2n+1) \times (2n+1)$ chessboard in such a way that the set of L's vertices coincides with the set of the vertices of the board’s squares and every edge in $L$ is a side of some board square. All board squares lying in the interior of $L$ are coloured in red. Prove that the number of neighbouring pairs of red squares in every row of the board is even.

Let $n$ be a positive integer. Find the number of permutations $\sigma$ of the set $\{1, 2, ..., n\}$ such that $\sigma(j) \geq j$ holds for exactly two values of $j$.

[b]p1.[/b] What is $7\%$ of one half of $11\%$ of $20000$ ? [b]p2.[/b] Three circles centered at $A, B$, and $C$ are tangent to each other. Given that $AB = 8$, $AC = 10$, and $BC = 12$, find the radius of circle $ A$. [b]p3. [/b]How many positive integer values of $x$ less than $2012$ are there such that there exists an integer $y$ for which $\frac{1}{x} +\frac{2}{2y+1} =\frac{1}{y}$ ? [b]p4. [/b]The positive difference between $ 8$ and twice $x$ is equal to $11$ more than $x$. What are all possible values of $x$? [b]p5.[/b] A region in the coordinate plane is bounded by the equations $x = 0$, $x = 6$, $y = 0$, and $y = 8$. A line through $(3, 4)$ with slope $4$ cuts the region in half. Another line going through the same point cuts the region into fourths, each with the same area. What is the slope of this line? [b]p6.[/b] A polygon is composed of only angles of degrees $138$ and $150$, with at least one angle of each degree. How many sides does the polygon have? [b]p7.[/b] $M, A, T, H$, and $L$ are all not necessarily distinct digits, with $M \ne 0$ and $L \ne 0$. Given that the sum $MATH +LMT$, where each letter represents a digit, equals $2012$, what is the average of all possible values of the three-digit integer $LMT$? [b]p8. [/b]A square with side length $\sqrt{10}$ and two squares with side length $\sqrt{7}$ share the same center. The smaller squares are rotated so that all of their vertices are touching the sides of the larger square at distinct points. What is the distance between two such points that are on the same side of the larger square? [b]p9.[/b] Consider the sequence $2012, 12012, 20120, 20121, ...$. This sequence is the increasing sequence of all integers that contain “$2012$”. What is the $30$th term in this sequence? [b]p10.[/b] What is the coefficient of the $x^5$ term in the simplified expansion of $(x +\sqrt{x} +\sqrt[3]{x})^{10}$ ? PS. You had better use hide for answers.

The plan of the castle in Baranow Sandomierski can be presented as the graph with $16$ vertices on the picture. A night guard plans a closed round along the edges of this graph. (a) How many rounds passing through each vertex exactly once are there? The directions are irrelevant. (b) How many non-selfintersecting rounds (taking directions into account) containing each edge of the graph exactly once are there? [img]https://cdn.artofproblemsolving.com/attachments/1/f/27ca05fc689fd8d873130db9d8cc52acf49bb4.png[/img]

There are $n$ cards. Max and Lewis play, alternately, the following game Max starts the game, he removes exactly $1$ card, in each round the current player can remove any quantity of cards, from $1$ card to $t+1$ cards, which $t$ is the number of removed cards by the previous player, and the winner is the player who remove the last card. Determine all the possible values of $n$ such that Max has the winning strategy.

$n$ teams participated in a basketball tournament. Each team has played with each team exactly one game. There was no tie. If in the end of the tournament the $i$-th team has $x_{i}$ wins and $y_{i}$ loses $(1\leq i \leq n)$ prove that: $\sum_{i=1}^{n} {x_{i}}^2=\sum_{i=1}^{n} {y_{i}}^2$

Let $n$ be a positive integer and let $0\leq k\leq n$ be an integer. Show that there exist $n$ points in the plane with no three on a line such that the points can be divided into two groups satisfying the following properties. $\text{(i)}$ The first group has $k$ points and the distance between any two distinct points in this group is irrational. $\text{(ii)}$ The second group has $n-k$ points and the distance between any two distinct points in this group is an integer. $\text{(iii)}$ The distance between a point in the first group and a point in the second group is irrational.

Farmer James invents a new currency, such that for every positive integer $n\le 6$, there exists an $n$-coin worth $n!$ cents. Furthermore, he has exactly $n$ copies of each $n$-coin. An integer $k$ is said to be [i]nice[/i] if Farmer James can make $k$ cents using at least one copy of each type of coin. How many positive integers less than 2018 are nice?

Alice has a map of Wonderland, a country consisting of $n \geq 2$ towns. For every pair of towns, there is a narrow road going from one town to the other. One day, all the roads are declared to be “one way” only. Alice has no information on the direction of the roads, but the King of Hearts has offered to help her. She is allowed to ask him a number of questions. For each question in turn, Alice chooses a pair of towns and the King of Hearts tells her the direction of the road connecting those two towns. Alice wants to know whether there is at least one town in Wonderland with at most one outgoing road. Prove that she can always find out by asking at most $4n$ questions.

Let $ n,k$ be given positive integers satisfying $ k\le 2n \minus{} 1$. On a table tennis tournament $ 2n$ players take part, they play a total of $ k$ rounds match, each round is divided into $ n$ groups, each group two players match. The two players in different rounds can match on many occasions. Find the greatest positive integer $ m \equal{} f(n,k)$ such that no matter how the tournament processes, we always find $ m$ players each of pair of which didn't match each other.

Let $n$ be a positive integer. Prove that in a regular $6n$-gon, we can draw $3n$ diagonals with pairwise distinct ends and partition the drawn diagonals into $n$ triplets so that: [list] [*] the diagonals in each triplet intersect in one interior point of the polygon and [*] all these $n$ intersection points are distinct. [/list]

Let $S=\{A_1,A_2,\ldots ,A_n\}$, where $A_1,A_2,\ldots ,A_n$ are $n$ pairwise distinct finite sets $(n\ge 2)$, such that for any $A_i,A_j\in S$, $A_i\cup A_j\in S$. If $k= \min_{1\le i\le n}|A_i|\ge 2$, prove that there exist $x\in \bigcup_{i=1}^n A_i$, such that $x$ is in at least $\frac{n}{k}$ of the sets $A_1,A_2,\ldots ,A_n$ (Here $|X|$ denotes the number of elements in finite set $X$).

George plays the following game: At every step he can replace a triple of integers $(x,y,z)$ which is written on the blackboard, with any of the following triples: (i) $(x,z,y)$ (ii) $(-x,y,z)$ (iii) $(x+y,y,2x+y+z)$ (iv) $(x-y,y,y+z-2x)$ Initially, the triple $(1,1,1)$ is written on the blackboard. Determine whether George can, with a sequence of allowed steps, end up at the triple $(2021,2019,2023)$, fully justifying your answer.