A round robin tennis tournament is played among $4$ friends in which each player plays every other player only one time, resulting in either a win or a loss for each player. If overall placement is determined strictly by how many games each player won, how many possible placements are there at the end of the tournament? For example, Andy and Bob tying for first and Charlie and Derek tying for third would be one possible case.

At a company, there are several workers, some of which are enemies. They go to their job with 100 buses, in such a way that there aren't any enemies in either bus. Having arrived at the job, their chief wants to assign them to brigades of at least two people, without assigning two enemies to the same brigade. Prove that the chief can split the workers in at most 100 brigades, or he cannot split them at all in any number of brigades.

A school offers three subjects: Mathematics, Art and Science. At least $80\%$ of students study both Mathematics and Art. At least $80\%$ of students study both Mathematics and Science. Prove that at least $80\%$ of students who study both Art and Science, also study Mathematics.

On each face of two dice some positive integer is written. The two dice are thrown and the numbers on the top face are added. Determine whether one can select the integers on the faces so that the possible sums are $2,3,4,5,6,7,8,9,10,11,12,13$, all equally likely?

Find the number of ways there are to permute the elements of the set $\{1,2,3,4,5,6,7,8,9\}$ such that no two adjacent numbers are both even or both odd. [i]Proposed by Ephram Chun[/i]

[i]25 problems for 30 minutes[/i] [b]p1.[/b] Alisha has $6$ cupcakes and Tyrone has $10$ brownies. Tyrone gives some of his brownies to Alisha so that she has three times as many desserts as Tyrone. How many desserts did Tyrone give to Alisha? [b]p2.[/b] Bisky adds one to her favorite number. She then divides the result by $2$, and gets $56$. What is her favorite number? [b]p3.[/b] What is the maximum number of points at which a circle and a square can intersect? [b]p4.[/b] An integer $N$ leaves a remainder of 66 when divided by $120$. Find the remainder when $N$ is divided by $24$. [b]p5.[/b] $7$ people are chosen to run for student council. How many ways are there to pick $1$ president, $1$ vice president, and $1$ secretary? [b]p6.[/b] Anya, Beth, Chloe, and Dmitri are all close friends, and like to make group chats to talk. How many group chats can be made if Dmitri, the gossip, must always be in the group chat and Anya is never included in them? Group chats must have more than one person. [b]p7.[/b] There exists a telephone pole of height $24$ feet. From the top of this pole, there are two wires reaching the ground in opposite directions, with one wire $25$ feet, and the other wire 40 feet. What is the distance (in feet) between the places where the wires hit the ground? [b]p8.[/b] Tarik is dressing up for a job-interview. He can wear a chill, business, or casual outfit. If he wears a chill oufit, he must wear a t-shirt, shorts, and flip-flops. He has eight of the first, seven of the second, and three of the third. If he wears a business outfit, he must wear a blazer, a tie, and khakis; he has two of the first, six of the second, and five of the third; finally, he can also choose the casual style, for which he has three hoodies, nine jeans, and two pairs of sneakers. How many different combinations are there for his interview? [b]p9.[/b] If a non-degenerate triangle has sides $11$ and $13$, what is the sum of all possibilities for the third side length, given that the third side has integral length? [b]p10.[/b] An unknown disease is spreading fast. For every person who has the this illness, it is spread on to $3$ new people each day. If Mary is the only person with this illness at the start of Monday, how many people will have contracted the illness at the end of Thursday? [b]p11.[/b] Gob the giant takes a walk around the equator on Mars, completing one lap around Mars. If Gob’s head is $\frac{13}{\pi}$ meters above his feet, how much farther (in meters) did his head travel than his feet? [b]p12.[/b] $2022$ leaves a remainder of $2$, $6$, $9$, and $7$ when divided by $4$, $7$, $11$, and $13$ respectively. What is the next positive integer which has the same remainders to these divisors? [b]p13.[/b] In triangle $ABC$, $AB = 20$, $BC = 21$, and $AC = 29$. Let D be a point on $AC$ such that $\angle ABD = 45^o$. If the length of $AD$ can be represented as $\frac{a}{b}$ , what is $a + b$? [b]p14.[/b] Find the number of primes less than $100$ such that when $1$ is added to the prime, the resulting number has $3$ divisors. [b]p15.[/b] What is the coefficient of the term $a^4z^3$ in the expanded form of $(z - 2a)^7$? [b]p16.[/b] Let $\ell$ and $m$ be lines with slopes $-2$, $1$ respectively. Compute $|s_1 \cdot s_2|$ if $s_1$, $s_2$ represent the slopes of the two distinct angle bisectors of $\ell$ and $m$. [b]p17.[/b] R1D2, Lord Byron, and Ryon are creatures from various planets. They are collecting monkeys for King Avanish, who only understands octal (base $8$). R1D2 only understands binary (base $2$), Lord Byron only understands quarternary (base $4$), and Ryon only understands decimal (base $10$). R1D2 says he has $101010101$ monkeys and adds his monkey to the pile. Lord Byron says he has $3231$ monkeys and adds them to the pile. Ryon says he has $576$ monkeys and adds them to the pile. If King Avanish says he has $x$ monkeys, what is the value of $x$? [b]p18.[/b] A quadrilateral is defined by the origin, $(3, 0)$, $(0, 10)$, and the vertex of the graph of $y = x^2 -8x+22$. What is the area of this quadrilateral? [b]p19.[/b] There is a sphere-container, filled to the brim with fruit punch, of diameter $6$. The contents of this container are poured into a rectangular prism container, again filled to the brim, of dimensions $2\pi$ by $4$ by $3$. However, there is an excess amount in the original container. If all the excess drink is poured into conical containers with diameter $4$ and height $3$, how many containers will be used? [b]p20.[/b] Brian is shooting arrows at a target, made of concurrent circles of radius $1$, $2$, $3$, and $4$. He gets $10$ points for hitting the innermost circle, $8$ for hitting between the smallest and second smallest circles, $5$ for between the second and third smallest circles, $2$ points for between the third smallest and outermost circle, and no points for missing the target. Assume for each shot he takes, there is a $20\%$ chance Brian will miss the target, but otherwise the chances of hitting each target are proportional to the area of the region. The chance that after three shots, Brian will have scored $15$ points can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m, n$. Find $m + n$. [b]p21.[/b] What is the largest possible integer value of $n$ such that $\frac{2n^3+n^2+7n-15}{2n+1}$ is an integer? [b]p22.[/b] Let $f(x, y) = x^3 + x^2y + xy^2 + y^3$. Compute $f(0, 2) + f(1, 3) +... f(9, 11).$ [b]p23.[/b] Let $\vartriangle ABC$ be a triangle. Let $AM$ be a median from $A$. Let the perpendicular bisector of segment $\overline{AM}$ meet $AB$ and $AC$ at $D$, $E$ respectively. Given that $AE = 7$, $ME = MC$, and $BDEC$ is cyclic, then compute $AM^2$. [b]p24.[/b] Compute the number of ordered triples of positive integers $(a, b, c)$ such that $a \le 10$, $b \le 11$, $c \le 12$ and $a > b - 1$ and $b > c - 1$. [b]p25.[/b] For a positive integer $n$, denote by $\sigma (n)$ the the sum of the positive integer divisors of $n$. Given that $n + \sigma (n)$ is odd, how many possible values of $n$ are there from $1$ to $2022$, inclusive? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A test contains $5$ multiple choice questions which have $4$ options in each. Suppose each examinee chose one option for each question. There exists a number $n$, such that for any $n$ sheets among $2000$ sheets of answer papers, there are $4$ sheets of answer papers such that any two of them have at most $3$ questions with the same answers. Find the minimum value of $n$.

Several people visited a library yesterday. Each one visited the library just once (in the course of yesterday). Amongst any three of them, there were two who met in the library. Prove that there were two moments $T$ and $T$' yesterday such that everyone who visited the library yesterday was in the library at $T$ or $T'$ (or both).

[u]Round 1[/u] [b]p1.[/b] Alice and Bob played $25$ games of rock-paper-scissors. Alice played rock $12$ times, scissors $6$ times, and paper $7$ times. Bob played rock $13$ times, scissors $9$ times, and paper $3$ times. If there were no ties, who won the most games? (Remember, in each game each player picks one of rock, paper, or scissors. Rock beats scissors, scissors beat paper, and paper beats rock. If they choose the same object, the result is a tie.) [b]p2.[/b] On the planet Vulcan there are eight big volcanoes and six small volcanoes. Big volcanoes erupt every three years and small volcanoes erupt every two years. In the past five years, there were $30$ eruptions. How many volcanoes could erupt this year? [b]p3.[/b] A tangle is a sequence of digits constructed by picking a number $N\ge 0$ and writing the integers from $0$ to $N$ in some order, with no spaces. For example, $010123459876$ is a tangle with $N = 10$. A palindromic sequence reads the same forward or backward, such as $878$ or $6226$. The shortest palindromic tangle is $0$. How long is the second-shortest palindromic tangle? [b]p4.[/b] Balls numbered $1$ to $N$ have been randomly arranged in a long input tube that feeds into the upper left square of an $8 \times 8$ board. An empty exit tube leads out of the lower right square of the board. Your goal is to arrange the balls in order from $1$ to $N$ in the exit tube. As a move, you may 1. move the next ball in line from the input tube into the upper left square of the board, 2. move a ball already on the board to an adjacent square to its right or below, or 3. move a ball from the lower right square into the exit tube. No square may ever hold more than one ball. What is the largest number $N$ for which you can achieve your goal, no matter how the balls are initially arranged? You can see the order of the balls in the input tube before you start. [img]https://cdn.artofproblemsolving.com/attachments/1/8/bbce92750b01052db82d58b96584a36fb5ca5b.png[/img] [b]p5.[/b] A $2018 \times 2018$ board is covered by non-overlapping $2 \times 1$ dominoes, with each domino covering two squares of the board. From a given square, a robot takes one step to the other square of the domino it is on and then takes one more step in the same direction. Could the robot continue moving this way forever without falling off the board? [img]https://cdn.artofproblemsolving.com/attachments/9/c/da86ca4ff0300eca8e625dff891ed1769d44a8.png[/img] [u]Round 2[/u] [b]p6.[/b] Seventeen teams participated in a soccer tournament where a win is worth $1$ point, a tie is worth $0$ points, and a loss is worth $-1$ point. Each team played each other team exactly once. At least $\frac34$ of all games ended in a tie. Show that there must be two teams with the same number of points at the end of the tournament. [b]p7.[/b] The city of Old Haven is known for having a large number of secret societies. Any person may be a member of multiple societies. A secret society is called influential if its membership includes at least half the population of Old Haven. Today, there are $2018$ influential secret societies. Show that it is possible to form a council of at most $11$ people such that each influential secret society has at least one member on the council. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

If you draw $4$ points on the unit circle, prove that you can always find two points where their distance between is less than $\sqrt{2}.$

Let $M$ be a set of six distinct positive integers whose sum is $60$. These numbers are written on the faces of a cube, one number to each face. A [i]move[/i] consists of choosing three faces of the cube that share a common vertex and adding $1$ to the numbers on those faces. Determine the number of sets $M$ for which it’s possible, after a finite number of moves, to produce a cube all of whose sides have the same number.

Let $n$ be a positive integer. Define a chameleon to be any sequence of $3n$ letters, with exactly $n$ occurrences of each of the letters $a, b,$ and $c$. Define a swap to be the transposition of two adjacent letters in a chameleon. Prove that for any chameleon $X$ , there exists a chameleon $Y$ such that $X$ cannot be changed to $Y$ using fewer than $3n^2/2$ swaps.

33 friends are collecting stickers for a 2011-sticker album. A distribution of stickers among the 33 friends is incomplete when there is a sticker that no friend has. Determine the least $m$ with the following property: every distribution of stickers among the 33 friends such that, for any two friends, there are at least $m$ stickers both don't have, is incomplete.

Let $S$ be a shape in the plane which is obtained as a union of finitely many unit squares. Prove that the ratio of the perimeter and the area of $S$ is at most $8$.

There is a game. The magician let the participant think up a positive integer (at least two digits). For example, an integer $ \displaystyle\overline{a_1a_2 \cdots a_n}$ is rearranged as $ \overline{a_{i_1}a_{i_2} \cdots a_{i_n}}$, that is, $ i_1, i_2, \cdots, i_n$ is a permutation of $ 1,2, \cdots, n$. Then we get $ n!\minus{}1$ integers. The participant is asked to calculate the sum of the $ n!\minus{}1$ numbers, then tell the magician the sum $ S$. The magician claims to be able to know the original number when he is told the sum $ S$. Try to decide whether the magician can be successful or not.

Consider an $n\times n$ matrix whose entry at the intersection of the $i$-th row and the $j-$th column equals $i+ j -1$. What is the largest possible value of the product of $n$ entries of the matrix, no two of which are in the same row or column?

Let $ A_0 \equal{} (a_1,\dots,a_n)$ be a finite sequence of real numbers. For each $ k\geq 0$, from the sequence $ A_k \equal{} (x_1,\dots,x_k)$ we construct a new sequence $ A_{k \plus{} 1}$ in the following way. 1. We choose a partition $ \{1,\dots,n\} \equal{} I\cup J$, where $ I$ and $ J$ are two disjoint sets, such that the expression \[ \left|\sum_{i\in I}x_i \minus{} \sum_{j\in J}x_j\right| \] attains the smallest value. (We allow $ I$ or $ J$ to be empty; in this case the corresponding sum is 0.) If there are several such partitions, one is chosen arbitrarily. 2. We set $ A_{k \plus{} 1} \equal{} (y_1,\dots,y_n)$ where $ y_i \equal{} x_i \plus{} 1$ if $ i\in I$, and $ y_i \equal{} x_i \minus{} 1$ if $ i\in J$. Prove that for some $ k$, the sequence $ A_k$ contains an element $ x$ such that $ |x|\geq\frac n2$. [i]Author: Omid Hatami, Iran[/i]

There are $n$ boxes $A_1, ..., A_n$ with non-negative number of pebbles inside it(so it can be empty). Let $a_n$ be the number of pebbles in the box $A_n$. There are total $3n$ pebbles in the boxes. From now on, Alice plays the following operation. In each operation, Alice choose one of these boxes which is non-empty. Then she divide this pebbles into $n$ group such that difference of number of pebbles in any two group is at most 1, and put these $n$ group of pebbles into $n$ boxes one by one. This continues until only one box has all the pebbles, and the rest of them are empty. And when it's over, define $Length$ as the total number of operations done by Alice. Let $f(a_1, ..., a_n)$ be the smallest value of $Length$ among all the possible operations on $(a_1, ..., a_n)$. Find the maximum possible value of $f(a_1, ..., a_n)$ among all the ordered pair $(a_1, ..., a_n)$, and find all the ordered pair $(a_1, ..., a_n)$ that equality holds.

[b]p1.[/b] Triangle $ABC$ has side lengths $AB = 3^2$ and $BC = 4^2$. Given that $\angle ABC$ is a right angle, determine the length of $AC$. [b]p2.[/b] Suppose $m$ and $n$ are integers such that $m^2+n^2 = 65$. Find the largest possible value of $m-n$. [b]p3.[/b] Six middle school students are sitting in a circle, facing inwards, and doing math problems. There is a stack of nine math problems. A random student picks up the stack and, beginning with himself and proceeding clockwise around the circle, gives one problem to each student in order until the pile is exhausted. Aditya falls asleep and is therefore not the student who picks up the pile, although he still receives problem(s) in turn. If every other student is equally likely to have picked up the stack of problems and Vishwesh is sitting directly to Aditya’s left, what is the probability that Vishwesh receives exactly two problems? [b]p4.[/b] Paul bakes a pizza in $15$ minutes if he places it $2$ feet from the fire. The time the pizza takes to bake is directly proportional to the distance it is from the fire and the rate at which the pizza bakes is constant whenever the distance isn’t changed. Paul puts a pizza $2$ feet from the fire at $10:30$. Later, he makes another pizza, puts it $2$ feet away from the fire, and moves the first pizza to a distance of $3$ feet away from the fire instantly. If both pizzas finish baking at the same time, at what time are they both done? [b]p5.[/b] You have $n$ coins that are each worth a distinct, positive integer amount of cents. To hitch a ride with Charon, you must pay some unspecified integer amount between $10$ and $20$ cents inclusive, and Charon wants exact change paid with exactly two coins. What is the least possible value of $n$ such that you can be certain of appeasing Charon? [b]p6.[/b] Let $a, b$, and $c$ be positive integers such that $gcd(a, b)$, $gcd(b, c)$ and $gcd(c, a)$ are all greater than $1$, but $gcd(a, b, c) = 1$. Find the minimum possible value of $a + b + c$. [b]p7.[/b] Let $ABC$ be a triangle inscribed in a circle with $AB = 7$, $AC = 9$, and $BC = 8$. Suppose $D$ is the midpoint of minor arc $BC$ and that $X$ is the intersection of $\overline{AD}$ and $\overline{BC}$. Find the length of $\overline{BX}$. [b]p8.[/b] What are the last two digits of the simplified value of $1! + 3! + 5! + · · · + 2009! + 2011!$ ? [b]p9.[/b] How many terms are in the simplified expansion of $(L + M + T)^{10}$ ? [b]p10.[/b] Ben draws a circle of radius five at the origin, and draws a circle with radius $5$ centered at $(15, 0)$. What are all possible slopes for a line tangent to both of the circles? PS. You had better use hide for answers.

Group of $10$ people are buying books. We know the following: $i)$ Every person bought four different books $ii)$ Every two persons bought at least one book common for both of them Taking in consideration book which was bought by maximum number of people, determine minimal value of that number

Let $\Omega$ be a circle disk with radius $1$. Determine the minimum $r$ that has the following property: You can select three points on $\Omega$ so that each circle disk located in $\Omega$ and has a radius greater than $r$ contains at least one of the three points.

In a room, there are $2005$ boxes, each of them containing one or several sorts of fruits, and of course an integer amount of each fruit. [b]a)[/b] Show that we can find $669$ boxes, which altogether contain at least a third of all apples and at least a third of all bananas. [b]b)[/b] Can we always find $669$ boxes, which altogether contain at least a third of all apples, at least a third of all bananas and at least a third of all pears?

There are 12 people such that for every person A and person B there exists a person C that is a friend to both of them. Determine the minimum number of pairs of friends and construct a graph where the edges represent friendships.

In Sikinia we only pay with coins that have a value of either $11$ or $12$ Kulotnik. In a burglary in one of Sikinia's banks, $11$ bandits cracked the safe and could get away with $5940$ Kulotnik. They tried to split up the money equally - so that everyone gets the same amount - but it just doesn't worked. After a while their leader claimed that it actually isn't possible. Prove that they didn't get any coin with the value $12$ Kulotnik.

A [i]domino[/i] is a $2 \times 1$ or $1 \times 2$ tile. Determine in how many ways exactly $n^2$ dominoes can be placed without overlapping on a $2n \times 2n$ chessboard so that every $2 \times 2$ square contains at least two uncovered unit squares which lie in the same row or column.