[b]p1.[/b] Ten math students take a test, and the average score on the test is $28$. If five students had an average of $15$, what was the average of the other five students' scores? [b]p2.[/b] If $a\otimes b = a^2 + b^2 + 2ab$, find $(-5\otimes 7) \otimes 4$. [b]p3.[/b] Below is a $3 \times 4$ grid. Fill each square with either $1$, $2$ or $3$. No two squares that share an edge can have the same number. After filling the grid, what is the $4$-digit number formed by the bottom row? [img]https://cdn.artofproblemsolving.com/attachments/9/6/7ef25fc1220d1342be66abc9485c4667db11c3.png[/img] [b]p4.[/b] What is the angle in degrees between the hour hand and the minute hand when the time is $6:30$? [b]p5.[/b] In a small town, there are some cars, tricycles, and spaceships. (Cars have $4$ wheels, tricycles have $3$ wheels, and spaceships have $6$ wheels.) Among the vehicles, there are $24$ total wheels. There are more cars than tricycles and more tricycles than spaceships. How many cars are there in the town? [b]p6.[/b] You toss five coins one after another. What is the probability that you never get two consecutive heads or two consecutive tails? [b]p7.[/b] In the below diagram, $\angle ABC$ and $\angle BCD$ are right angles. If $\overline{AB} = 9$, $\overline{BD} = 13$, and $\overline{CD} = 5$, calculate $\overline{AC}$. [img]https://cdn.artofproblemsolving.com/attachments/7/c/8869144e3ea528116e2d93e14a7896e5c62229.png[/img] [b]p8.[/b] Out of $100$ customers at a market, $80$ purchased oranges, $60$ purchased apples, and $70$ purchased bananas. What is the least possible number of customers who bought all three items? [b]p9.[/b] Francis, Ted and Fred planned to eat cookies after dinner. But one of them sneaked o earlier and ate the cookies all by himself. The three say the following: Francis: Fred ate the cookies. Fred: Ted did not eat the cookies. Ted: Francis is lying. If exactly one of them is telling the truth, who ate all the cookies? [b]p11.[/b] Let $ABC$ be a triangle with a right angle at $A$. Suppose $\overline{AB} = 6$ and $\overline{AC} = 8$. If $AD$ is the perpendicular from $A$ to $BC$, what is the length of $AD$? [b]p12.[/b] How many three digit even numbers are there with an even number of even digits? [b]p13.[/b] Three boys, Bob, Charles and Derek, and three girls, Alice, Elizabeth and Felicia are all standing in one line. Bob and Derek are each adjacent to precisely one girl, while Felicia is next to two boys. If Alice stands before Charles, who stands before Elizabeth, determine the number of possible ways they can stand in a line. [b]p14.[/b] A man $5$ foot, $10$ inches tall casts a $14$ foot shadow. $20$ feet behind the man, a flagpole casts ashadow that has a $9$ foot overlap with the man's shadow. How tall (in inches) is the flagpole? [b]p15.[/b] Alvin has a large bag of balls. He starts throwing away balls as follows: At each step, if he has $n$ balls and 3 divides $n$, then he throws away a third of the balls. If $3$ does not divide $n$ but $2$ divides $n$, then he throws away half of them. If neither $3$ nor $2$ divides $n$, he stops throwing away the balls. If he began with $1458$ balls, after how many steps does he stop throwing away balls? [b]p16.[/b] Oski has $50$ coins that total to a value of $82$ cents. You randomly steal one coin and find out that you took a quarter. As to not enrage Oski, you quickly put the coin back into the collection. However, you are both bored and curious and decide to randomly take another coin. What is the probability that this next coin is a penny? (Every coin is either a penny, nickel, dime or quarter). [b]p17.[/b] Let $ABC$ be a triangle. Let $M$ be the midpoint of $BC$. Suppose $\overline{MA} = \overline{MB} = \overline{MC} = 2$ and $\angle ACB = 30^o$. Find the area of the triangle. [b]p18.[/b] A spirited integer is a positive number representable in the form $20^n + 13k$ for some positive integer $n$ and any integer $k$. Determine how many spirited integers are less than $2013$. [b]p19. [/b]Circles of radii $20$ and $13$ are externally tangent at $T$. The common external tangent touches the circles at $A$, and $B$, respectively where $A \ne B$. The common internal tangent of the circles at $T$ intersects segment $AB$ at $X$. Find the length of $AX$. [b]p20.[/b] A finite set of distinct, nonnegative integers $\{a_1, ... , a_k\}$ is called admissible if the integer function $f(n) = (n + a_1) ... (n + a_k)$ has no common divisor over all terms; that is, $gcd \left(f(1), f(2),... f(n)\right) = 1$ for any integer$ n$. How many admissible sets only have members of value less than $10$? $\{4\}$ and $\{0, 2, 6\}$ are such sets, but $\{4, 9\}$ and $\{1, 3, 5\}$ are not. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[i]In this round, problems will depend on the answers to other problems. A bolded letter is used to denote a quantity whose value is determined by another problem's answer.[/i] [u]Part I[/u] [b]p1.[/b] Let F be the answer to problem number $6$. You want to tile a nondegenerate square with side length $F$ with $1\times 2$ rectangles and $1 \times 1$ squares. The rectangles can be oriented in either direction. How many ways can you do this? [b]p2.[/b] Let [b]A[/b] be the answer to problem number $1$. Triangle $ABC$ has a right angle at $B$ and the length of $AC$ is [b]A[/b]. Let $D$ be the midpoint of $AB$, and let $P$ be a point inside triangle $ABC$ such that $PA = PC = \frac{7\sqrt5}{4}$ and $PD = \frac74$ . The length of $AB^2$ is expressible as $m/n$ for $m, n$ relatively prime positive integers. Find $m$. [b]p3.[/b] Let [b]B[/b] be the answer to problem number $2$. Let $S$ be the set of positive integers less than or equal to [b]B[/b]. What is the maximum size of a subset of $S$ whose elements are pairwise relatively prime? [b]p4.[/b] Let [b]C[/b] be the answer to problem number $3$. You have $9$ shirts and $9$ pairs of pants. Each is either red or blue, you have more red shirts than blue shirts, and you have same number of red shirts as blue pants. Given that you have [b]C[/b] ways of wearing a shirt and pants whose colors match, find out how many red shirts you own. [b]p5.[/b] Let [b]D[/b] be the answer to problem number $4$. You have two odd positive integers $a, b$. It turns out that $lcm(a, b) + a = gcd(a, b) + b =$ [b]D[/b]. Find $ab$. [b]p6.[/b] Let [b]E[/b] be the answer to problem number $5$. A function $f$ defined on integers satisfies $f(y)+f(12-y) = 10$ and $f(y) + f(8 - y) = 4$ for all integers $y$. Given that $f($ [b]E[/b] $) = 0$, compute $f(4)$. [u]Part II[/u] [b]p7.[/b] Let [b]L[/b] be the answer to problem number $12$. You want to tile a nondegenerate square with side length [b]L[/b] with $1\times 2$ rectangles and $7\times 7$ squares. The rectangles can be oriented in either direction. How many ways can you do this? [b]p8.[/b] Let [b]G[/b] be the answer to problem number $7$. Triangle $ABC$ has a right angle at $B$ and the length of $AC$ is [b]G[/b]. Let $D$ be the midpoint of $AB$, and let $P$ be a point inside triangle $ABC$ such that $PA = PC = \frac12$ and $PD = \frac{1}{2010}$ . The length of $AB^2$ is expressible as $m/n$ for $m, n$ relatively prime positive integers. Find $m$. [b]p9.[/b] Let [b]H[/b] be the answer to problem number $8$. Let $S$ be the set of positive integers less than or equal to [b]H[/b]. What is the maximum size of a subset of $S$ whose elements are pairwise relatively prime? [b]p10.[/b] Let [b]I[/b] be the answer to problem number $9$. You have $391$ shirts and $391$ pairs of pants. Each is either red or blue, you have more red shirts than blue shirts, and you have same number of red shirts as red pants. Given that you have [b]I[/b] ways of wearing a shirt and pants whose colors match, find out how many red shirts you own. [b]p11.[/b] Let [b]J[/b] be the answer to problem number $10$. You have two odd positive integers $a, b$. It turns out that $lcm(a, b) + 2a = 2 gcd(a, b) + b = $ [b]J[/b]. Find $ab$. [b]p12.[/b] Let [b]K[/b] be the answer to problem number $11$. A function $f$ defined on integers satisfies $f(y)+f(7-y) = 8$ and $f(y) + f(5 - y) = 4$ for all integers $y$. Given that $f($ [b]K[/b] $) = 453$, compute $f(2)$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The head of the Mint wants to release 12 coins denominations (each - a natural number rubles) so that any amount from 1 to 6543 rubles could be paid without having to pass, using no more than 8 coins. Can he do it? (If the payment amount you can use a few coins of the same denomination.)

Two magicians are about to show the next trick. A circle is drawn on the board with one semicircle marked. Viewers mark 100 points on this circle, then the first magician erases one of them. After this, the second one for the first time looks at the drawing and determines from the remaining 99 points whether the erased point was lying on the marked semicircle. Prove that such a trick will not always succeed.

A circle is somehow divided by $3k$ points into $k$ arcs of lengths $1, 2$ and $3$ each. Prove that two of these points are always diametrically opposite.

Submit an integer between $1$ and $50$, inclusive. You will receive a score as follows: If some number is submitted exactly once: If $E$ is your number, $A$ is the closest number to $E$ which received exactly one submission, and $M$ is the largest unique submission, you will receive $\frac{25}{M} (A - |E - A|)$ points, rounded to the nearest integer. If no number was submitted exactly once: If $E$ is your number, $K$ is the number of people who submitted $E$, and $M$ is the number of people who submitted the most commonly submitted number, then you will receive $\frac{25(M-K)}{M}$ points, rounded to the nearest integer.

[u]Round 1[/u] [b]p1.[/b] Nineteen witches, all of different heights, stand in a circle around a campfire. Each witch says whether she is taller than both of her neighbors, shorter than both, or in-between. Exactly three said “I am taller.” How many said “I am in-between”? [b]p2.[/b] Alex is writing a sequence of $A$’s and $B$’s on a chalkboard. Any $20$ consecutive letters must have an equal number of $A$’s and $B$’s, but any 22 consecutive letters must have a different number of $A$’s and $B$’s. What is the length of the longest sequence Alex can write?. [b]p3.[/b] A police officer patrols a town whose map is shown. The officer must walk down every street segment at least once and return to the starting point, only changing direction at intersections and corners. It takes the officer one minute to walk each segment. What is the fastest the officer can complete a patrol? [img]https://cdn.artofproblemsolving.com/attachments/a/3/78814b37318adb116466ede7066b0d99d6c64d.png[/img] [b]p4.[/b] A zebra is a new chess piece that jumps in the shape of an “L” to a location three squares away in one direction and two squares away in a perpendicular direction. The picture shows all the moves a zebra can make from its given position. Is it possible for a zebra to make a sequence of $64$ moves on an $8\times 8$ chessboard so that it visits each square exactly once and returns to its starting position? [img]https://cdn.artofproblemsolving.com/attachments/2/d/01a8af0214a2400b279816fc5f6c039320e816.png[/img] [b]p5.[/b] Ann places the integers $1, 2,..., 100$ in a $10 \times 10$ grid, however she wants. In each round, Bob picks a row or column, and Ann sorts it from lowest to highest (left-to-right for rows; top-to-bottom for columns). However, Bob never sees the grid and gets no information from Ann. After eleven rounds, Bob must name a single cell that is guaranteed to contain a number that is at least $30$ and no more than $71$. Can he find a strategy to do this, no matter how Ann originally arranged the numbers? [u]Round 2[/u] [b]p6.[/b] Evelyn and Odette are playing a game with a deck of $101$ cards numbered $1$ through $101$. At the start of the game the deck is split, with Evelyn taking all the even cards and Odette taking all the odd cards. Each shuffles her cards. On every move, each player takes the top card from her deck and places it on a table. The player whose number is higher takes both cards from the table and adds them to the bottom of her deck, first the opponent’s card, then her own. The first player to run out of cards loses. Card $101$ was played against card $2$ on the $10$th move. Prove that this game will never end. [img]https://cdn.artofproblemsolving.com/attachments/8/1/aa16fe1fb4a30d5b9e89ac53bdae0d1bdf20b0.png[/img] [b]p7.[/b] The Vogon spaceship Tempest is descending on planet Earth. It will land on five adjacent buildings within a $10 \times 10$ grid, crushing any teacups on roofs of buildings within a $5 \times 1$ length of blocks (vertically or horizontally). As Commander of the Space Force, you can place any number of teacups on rooftops in advance. When the ship lands, you will hear how many teacups the spaceship breaks, but not where they were. (In the figure, you would hear $4$ cups break.) What is the smallest number of teacups you need to place to ensure you can identify at least one building the spaceship landed on? [img]https://cdn.artofproblemsolving.com/attachments/8/7/2a48592b371bba282303e60b4ff38f42de3551.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In an exam with k questions, n students are taking part. A student fails the exam if he answers correctly less than half of all questions. Call a question easy if more than half of all students answer it correctly. For which pairs (k, n) of positive integers is it possible that (a) all students fail the exam although all questions are easy; (b) no student fails the exam although no question is easy?

$3n - 2$ participants took part in the chess festival, some of them played one game of chess with each other. Prove that at least one of the following statements holds: (A) One can find $n$ chess players $A_1 , A_2 , . . . , A_n$ suchthat Ai has played a game with $A_{i+1}$ for all $i = 1, ...,n -1$. (B) Seven chess players can be found in $B_1 , . . . , B_7$, who have not played with each other, except perhaps three pairs $(B_1, B_2)$, $(B_3, B_4)$ and $(B_5, B_6)$, each of whom may or may not have played a game of chess.

Two teams, $ A$ and $ B$, fight for a territory limited by a circumference. $ A$ has $ n$ blue flags and $ B$ has $ n$ white flags ($ n\geq 2$, fixed). They play alternatively and $ A$ begins the game. Each team, in its turn, places one of his flags in a point of the circumference that has not been used in a previous play. Each flag, once placed, cannot be moved. Once all $ 2n$ flags have been placed, territory is divided between the two teams. A point of the territory belongs to $ A$ if the closest flag to it is blue, and it belongs to $ B$ if the closest flag to it is white. If the closest blue flag to a point is at the same distance than the closest white flag to that point, the point is neutral (not from $ A$ nor from $ B$). A team wins the game is their points cover a greater area that that covered by the points of the other team. There is a draw if both cover equal areas. Prove that, for every $ n$, team $ B$ has a winning strategy.

There are $34$ friends are sitting in a circle playing the following game. Every round, four of them are chosen at random, and have a rap battle. The winner of the rap battle stays in the circle and the other three leave. This continues until one player remains. Everyone has equal rapping ability, i.e. every person has equal probability to win a round. What is the probability that Michael and James end up battling in the same round?

Let $n\geqslant 3$ be an integer. Prove that there exists a set $S$ of $2n$ positive integers satisfying the following property: For every $m=2,3,...,n$ the set $S$ can be partitioned into two subsets with equal sums of elements, with one of subsets of cardinality $m$.

Prove that $\sum \frac{1}{i_1i_2 \ldots i_k} = n$ is taken over all non-empty subsets $\left\{i_1,i_2, \ldots, i_k\right\}$ of $\left\{1,2,\ldots,n\right\}$. (The $k$ is not fixed, so we are summing over all the $2^n-1$ possible nonempty subsets.)

1. Can a $7 \times 7~$ square be tiled with the two types of tiles shown in the figure? (Tiles can be rotated and reflected but cannot overlap or be broken) 2. Find the least number $N$ of tiles of type $A$ that must be used in the tiling of a $1011 \times 1011$ square. Give an example of a tiling that contains exactly $N$ tiles of type $A$. [asy] size(4cm, 0); pair a = (-10,0), b = (0, 0), c = (10, 0), d = (20, 0), e = (20, 10), f = (10, 10), g = (0, 10), h = (0, 20), ii = (-10, 20), j = (-10, 10); draw(a--b--c--f--g--h--ii--cycle); draw(g--b); draw(j--g); draw(f--c); draw((30, 0)--(30, 20)--(50,20)--(50,0)--cycle); draw((40,20)--(40,0)); draw((30,10)--(50,10)); label((0,0), "$(A)$", S); label((40,0), "$(B)$", S); [/asy] [i]Proposed by Muralidharan Somasundaran[/i]

Lucy starts by writing $s$ integer-valued $2022$-tuples on a blackboard. After doing that, she can take any two (not necessarily distinct) tuples $\mathbf{v}=(v_1,\ldots,v_{2022})$ and $\mathbf{w}=(w_1,\ldots,w_{2022})$ that she has already written, and apply one of the following operations to obtain a new tuple: \begin{align*} \mathbf{v}+\mathbf{w}&=(v_1+w_1,\ldots,v_{2022}+w_{2022}) \\ \mathbf{v} \lor \mathbf{w}&=(\max(v_1,w_1),\ldots,\max(v_{2022},w_{2022})) \end{align*} and then write this tuple on the blackboard. It turns out that, in this way, Lucy can write any integer-valued $2022$-tuple on the blackboard after finitely many steps. What is the smallest possible number $s$ of tuples that she initially wrote?

Let $P_i (x_i, y_i)$ (with $i = 1, 2, 3, 4, 5$) be five points with integer coordinates, no three collinear. Show that among all triangles with vertices at these points, at least three have integer areas.

Baklavas with nuts are laid out on the table in a row at the Nowruz celebration. Kosa and Kechel saw this and decided to play a game. Kosa eats one baklava from either the beginning or the end of the row in each move. Kechel either doesn't touch anything in each move or chooses the baklava he wants and just eats the nut on it. They agree that the first Kosa will start the game and make $20$ moves in each step, and the Kechel will only make $1$ move in each step. If the last baklava eaten by the Kosa is a nut, he wins the game. It is given that the number of baklavas is a multiple of $20.$ $A)$ If the number of baklavas is $400,$ prove that Kosa will win the game regardless of which strategy Kechel chooses. $B)$ Is it always true that no matter how many baklavas there are and what strategy Kechel chooses, Kosa will always win the game?

How many four-digit positive integers $\overline{a_1a_2a_3a_4}$ have only nonzero digits and have the property that $|a_i-a_j| \neq 1$ for all $1 \leq i<j \leq 4?$ [i]Proposed by Kyle Lee[/i]

Prove that for arbitary positive integer $ n\geq 4$, there exists a permutation of the subsets that contain at least two elements of the set $ G_{n} \equal{} \{1,2,3,\cdots,n\}$: $ P_{1},P_{2},\cdots,P_{2^n \minus{} n \minus{} 1}$ such that $ |P_{i}\cap P_{i \plus{} 1}| \equal{} 2,i \equal{} 1,2,\cdots,2^n \minus{} n \minus{} 2.$

Two digits one are written at the ends of a segment. In the middle, their sum is written, the number 2. Then, in the middle between each two neighboring numbers written, their sum is written again, and so on, 1973 times. How many times will the number 1973 be written? [i]Proposed by G. Halperin[/i]

Given $5$ points in the plane, no three of them being collinear. Show that among these $5$ points, we can always find $4$ points forming a convex quadrilateral.

The set consists of equal three-cell corners ( $L$ -triminoes), the middle cells of which are marked with paint. A rectangular board has been covered with these triminoes in a single layer so that all triminoes were entirely on the board. Then the triminoes were removed leaving the paint marks where the marked cells were. Is it always possible to know the location of the triminoes on the board using only those paint marks? Alexandr Gribalko

There are 25 masks of different colours. k sages play the following game. They are shown all the masks. Then the sages agree on their strategy. After that the masks are put on them so that each sage sees the masks on the others but can not see who wears each mask and does not see his own mask. No communication is allowed. Then each of them simultaneously names one colour trying to guess the colour of his mask. Find the minimum k for which the sages can agree so that at least one of them surely guesses the colour of his mask. ( S. Berlov )

A real number is written next to each vertex of a regular pentagon. All five numbers are different. A triple of vertices is called [b] successful[/b] if they form an isosceles triangle for which the number written on the top vertex is either larger than both numbers written on the base vertices, or smaller than both. Find the maximum possible number of successful triples.

If 46 squares are colored red in a $9\times 9$ board, show that there is a $2\times 2$ block on the board in which at least 3 of the squares are colored red.