[u]Round 5[/u] [b]5.1[/b] A circle with a radius of $1$ is inscribed in a regular hexagon. This hexagon is inscribed in a larger circle. If the area that is outside the hexagon but inside the larger circle can be expressed as $\frac{a\pi}{b} - c\sqrt{d}$, where $a, b, c, d$ are positive integers, $a, b$ are relatively prime, and no prime perfect square divides into $d$. find the value of $a + b + c + d$. [b]5.2[/b] At a dinner party, $10$ people are to be seated at a round table. If person A cannot be seated next to person $B$ and person $C$ must be next to person $D$, how many ways can the 10 people be seated? Consider rotations of a configuration identical. [b]5.3[/b] Let $N$ be the sum of all the positive integers that are less than $2022$ and relatively prime to $1011$. Find $\frac{N}{2022}$. [u]Round 6[/u] [b]6.1[/b] The line $y = m(x - 6)$ passes through the point $ A$ $(6, 0)$, and the line $y = 8 -\frac{x}{m}$ pass through point $B$ $(0,8)$. The two lines intersect at point $C$. What is the largest possible area of triangle $ABC$? [b]6.2[/b] Let $N$ be the number of ways there are to arrange the letters of the word MATHEMATICAL such that no two As can be adjacent. Find the last $3$ digits of $\frac{N}{100}$. [b]6.3[/b] Find the number of ordered triples of integers $(a, b, c)$ such that $|a|, |b|, |c| \le 100$ and $3abc = a^3 + b^3 + c^3$. [u]Round 7[/u] [b]7.1[/b] In a given plane, let $A, B$ be points such that $AB = 6$. Let $S$ be the set of points such that for any point $C$ in $S$, the circumradius of $\vartriangle ABC$ is at most $6$. Find $a + b + c$ if the area of $S$ can be expressed as $a\pi + b\sqrt{c}$ where $a, b, c$ are positive integers, and $c$ is not divisible by the square of any prime. [b]7.2[/b] Compute $\sum_{1\le a<b<c\le 7} abc$. [b]7.3[/b] Three identical circles are centered at points $A, B$, and $C$ respectively and are drawn inside a unit circle. The circles are internally tangent to the unit circle and externally tangent to each other. A circle centered at point $D$ is externally tangent to circles $A, B$, and $C$. If a circle centered at point $E$ is externally tangent to circles $A, B$, and $D$, what is the radius of circle $E$? The radius of circle $E$ can be expressed as $\frac{a\sqrt{b}-c}{d}$ where $a, b, c$, and d are all positive integers, gcd(a, c, d) = 1, and b is not divisible by the square of any prime. What is the sum of $a + b + c + d$? [u]Round 8[/u] [b]8.[/b] Let $A$ be the number of unused Algebra problems in our problem bank. Let $B$ be the number of times the letter ’b’ appears in our problem bank. Let M be the median speed round score. Finally, let $C$ be the number of correct answers to Speed Round $1$. Estimate $$A \cdot B + M \cdot C.$$ Your answer will be scored according to the following formula, where $X$ is the correct answer and $I$ is your input. $$max \left\{ 0, \left\lceil min \left\{13 - \frac{|I-X|}{0.05 |I|}, 13 - \frac{|I-X|}{0.05 |I-2X|} \right\} \right\rceil \right\}$$ PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2826128p24988676]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A magician has one hundred cards numbered 1 to 100. He puts them into three boxes, a red one, a white one and a blue one, so that each box contains at least one card. A member of the audience draws two cards from two different boxes and announces the sum of numbers on those cards. Given this information, the magician locates the box from which no card has been drawn. How many ways are there to put the cards in the three boxes so that the trick works?

The origami club meets once a week at a fixed time, but this week, the club had to reschedule the meeting to a different time during the same day. However, the room that they usually meet has $5$ available time slots, one of which is the original time the origami club meets. If at any given time slot, there is a $30$ percent chance the room is not available, what is the probability the origami club will be able to meet at that day?

Consider a rectangular table $2 \times n.$ Let every cell be dyed either by black or white color in a way that no $2\times 2$ square is completely black. Denote $P_n$ the number of such colorings. Prove that the number $P_{1989}$ is divisible by three and find the greatest power of three that divides them.

$N^2$ pieces are placed on an $N \times N$ chessboard. Is it possible to rearrange them in such a way that any two pieces which can capture each other (when considered to be knights) after the rearrangement are on adjacent squares (i.e. squares having at least one common boundary point)? Consider two cases: (a) $N = 3$. (b) $N = 8$ (S Stefanov)

The leader of an IMO team chooses positive integers $n$ and $k$ with $n > k$, and announces them to the deputy leader and a contestant. The leader then secretly tells the deputy leader an $n$-digit binary string, and the deputy leader writes down all $n$-digit binary strings which differ from the leader’s in exactly $k$ positions. (For example, if $n = 3$ and $k = 1$, and if the leader chooses $101$, the deputy leader would write down $001, 111$ and $100$.) The contestant is allowed to look at the strings written by the deputy leader and guess the leader’s string. What is the minimum number of guesses (in terms of $n$ and $k$) needed to guarantee the correct answer?

Let $n,k$ be positive integers so that $n \ge k$.Find the maximum number of binary sequances of length $n$ so that fixing any arbitary $k$ bits they do not produce all binary sequances of length $k$.For exmple if $k=1$ we can only have one sequance otherwise they will differ in at least one bit which means that bit produces all binary sequances of length $1$.

Does there exist such a configuration of 22 circles and 22 point, that any circle contains at leats 7 points and any point belongs at least to 7 circles?

There are several rational numbers written on a board. If the numbers $x{}$ and $y{}$ are present on the board, we can add the number $(x+y)/(1-xy)$ to it. Prove that there is a rational number that cannot ever appear on the board.

A polyomino is region with connected interior that is a union of a finite number of squares from a grid of unit squares. Do there exist a positive integer $n>4$ and a polyomino $P$ contained entirely within and $n$-by-$n$ grid such that $P$ contains exactly $3$ unit squares in every row and every column of the grid? Proposed by [i]Nikolai Beluhov[/i]

In the movie ”Prison break $4$”. Michael Scofield has to break into The Company. There, he encountered a kind of code to protect Scylla from being taken away. This code require picking out every number in a $2015\times 2015$ grid satisfying: i) The number right above of this number is $\equiv 1 \mod 2$ ii) The number right on the right of this number is $\equiv 2 \mod 3$ iii) The number right below of this number is $\equiv 3 \mod 4$ iv) The number right on the right of this number is $\equiv 4 \mod 5$ . How many number does Schofield have to choose? Also, in a $n\times n$ grid, the numbers from $ 1$ to $n^2$ are arranged in the following way : On the first row, the numbers are written in an ascending order $1, 2, 3, 4, ..., n$, each cell has one number. On the second row, the number are written in descending order $2n, 2n -1, 2n- 2, ..., n + 1$. On the third row, it is ascending order again $2n + 1, 2n + 2, ..., 3n$. The numbers are written like that until $n$th row. For example, this is how a $3$ $\times$ $3$ board looks like:[img]https://cdn.artofproblemsolving.com/attachments/8/7/0a5c8aba6543fd94fd24ae4b9a30ef8a32d3bd.png[/img]

For which positive integers $n$ is it possible to cover a $(2n+1) \times (2n+1)$ chessboard which has one of its corner squares cut out with tiles shown in the figure (each tile covers exactly $4$ squares, tiles can be rotated and turned around)? [img]https://cdn.artofproblemsolving.com/attachments/6/5/8fddeefc226ee0c02353a1fc11e48ce42d8436.png[/img]

Let $S$ the set of natural numbers from $1$ up to $1001$ , $S=\{1,2,...,1001\}$. Lisandro thinks of a number $N$ of $S$ , and Carla has to find out that number with the following procedure. She gives Lisandro a list of subsets of $S$, Lisandro reads it and tells Carla how many subsets of her list contain $N$ . If Carla wishes, she can repeat the same thing with a second list, and then with a third, but no more than $3$ are allowed. What is the smallest total number of subsets that allow Carla to find $N$ for sure?

Suppose there are $997$ points given in a plane. If every two points are joined by a line segment with its midpoint coloured in red, show that there are at least $1991$ red points in the plane. Can you find a special case with exactly $1991$ red points?

Let $n \ge 2$ be a positive integer. For every number from $1$ to $n$, there is a card with this number and which is either black or white. A magician can repeatedly perform the following move: For any two tiles with different number and different colour, he can replace the card with the smaller number by one identical to the other card. For instance, when $n=5$ and the initial configuration is $(1B, 2B, 3W, 4B,5B)$, the magician can choose $1B, 3W$ on the first move to obtain $(3W, 2B, 3W, 4B, 5B)$ and then $3W, 4B$ on the second move to obtain $(4B, 2B, 3W, 4B, 5B)$. Determine in terms of $n$ all possible lengths of sequences of moves from any possible initial configuration to any configuration in which no more move is possible.

A $2015\times2015$ chessboard is given, the cells of which are painted white and black alternatively so that the corner cells are black. There are $n{}$ [url=https://i.stack.imgur.com/V1kdh.png]L-trominoes[/url] placed on the board, no two of which overlap and which cover all of the black cells. Find the smallest possible value of $n{}$.

Let $n$ be an integer bigger than $0$. Let $\mathbb{A}= ( a_1,a_2,...,a_n )$ be a set of real numbers. Find the number of functions $f:A \rightarrow A$ such that $f(f(x))-f(f(y)) \ge x-y$ for any $x,y \in \mathbb{A}$, with $x>y$.

In Venetiania, the smallest currency is the ducat. The finance minister instructs his officials as follows: "I wish six kinds of banknotes, each worth a whole number of ducats. Those six values must be such that there exists a number N with the following property: Any amount of money of $n$ ducats ($n$ positive and integer) where $n \le N$ may be paid in such a way that no more than two copies of each kind are required either to pay or to return. I also wish those six values to be as large as possible for $N$. Determine those six values and provide proof that all conditions have been met." Solve the problem of those officials

Fifteen stones are placed on a $4 \times 4$ board, one in each cell, the remaining cell being empty. Whenever two stones are on neighbouring cells (having a common side), one may jump over the other to the opposite neighbouring cell, provided this cell is empty. The stone jumped over is removed from the board. For which initial positions of the empty cell is it possible to end up with exactly one stone on the board?

Attached to each of a number of objects is a tag which states the correct mass of the object. The tags have fallen off and have been replaced on the objects at random. We wish to determine if by chance all tags are in fact correct. We may use exactly once a horizontal lever which is supported at its middle. The objects can be hung from the lever at any point on either side of the support. The lever either stays horizontal or tilts to one side. Is this task always possible?

Within a group of $ 2009$ people, every two people has exactly one common friend. Find the least value of the difference between the person with maximum number of friends and the person with minimum number of friends.

A sequence $a_1,a_2,\cdots$ of positive integers contains each positive integer exactly once. Moreover for every pair of distinct positive integer $m$ and $n$, $\frac{1}{1998} < \frac{|a_n- a_m|}{|n-m|} < 1998$, show that $|a_n - n | <2000000$ for all $n$.

For a positive integer $n$, we consider an $n \times n$ board and tiles with dimensions $1 \times 1, 1 \times 2, ..., 1 \times n$. In how many ways exactly can $\frac12 n (n + 1)$ cells of the board are colored red, so that the red squares can all be covered by placing the $n$ tiles all horizontally, but also by placing all $n$ tiles vertically? Two colorings that are not identical, but by rotation or reflection from the board into each other count as different.

Prove that there exists a $k_0\in\mathbb{N}$ such that for every $k\in\mathbb{N},k>k_0$, there exists a finite number of lines in the plane not all parallel to one of them, that divide the plane exactly in $k$ regions. Find $k_0$.

There are 7 lines in the plane. A point is called a [i]good[/i] point if it is contained on at least three of these seven lines. What is the maximum number of [i]good[/i] points?