It is known that each two of the 12 competitors, that participated in the finals of the competition “Mathematical duels”, have a common friend among the other 10. Prove that there is one of them that has at least 5 friends among the group.

On a table lie $289$ coins that form a square array $17 \times 17$. All coins are facing with the crown up. In one move, it is possible to reverse any five coins lying in a row: vertical, horizontal or diagonal. Is it possible that after a number of such moves, all the coins to be arranged with tails up?

A Pokemon Go player starts at $(0,0)$ and carries a pedometer that records the number of steps taken. He then takes steps with length $1$ unit in the north, south, east, or west direction, such that each move after the first is perpendicular to the move before it. Somehow, the player eventually returns to $(0, 0)$, but he had visited no point (except $(0, 0)$) twice. Let $n$ be the number on the pedometer when the player returns to $(0, 0)$. Of the numbers from $1$ to $2019$ inclusive, how many can be the value of $n$?

Find the number of nondegenerate triangles whose vertices lie in the set of points $(s,t)$ in the plane such that $0 \leq s \leq 4$, $0 \leq t \leq 4$, $s$ and $t$ are integers.

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

For any four points on a plane, if the areas of four triangles formed are different positive integer and six distances between those four points are also six different positive integers, then the convex closure of $4$ points is called a "lotus design." (1) Construct an example of "lotus design". Also what are areas and distances in your example? (2) Prove that there are infinitely many "lotus design" which are not similar.

Doofy duck buy tangerines in the store. All tangerines have equal weight and are divided into $9$, $10$, $11$, $12$, or $13$ equal wedges, although this cannot be seen without peeling them. How many tangerines does Doofy duck need to buy if he wishes to eat exactly one tangerine’s worth while eating at most one wedge from every tangerine? [i]Doofy duck only peels the tangerines at home.[/i]

The phrase "COLORFUL TARTAN'' is spelled out with wooden blocks, where blocks of the same letter are indistinguishable. How many ways are there to distribute the blocks among two bags of different color such that neither bag contains more than one of the same letter?

A convex $2019$-gon $A_1A_2...A_{2019}$ is cut into smaller pieces along its $2019$ diagonals of the form $A_iA_{i+3}$ for $1 \le i \le2019$, where $A_{2020} = A_1$, $A_{2021} = A_2$, and $A_{2022} = A_3$. What is the least possible number of resulting pieces?

In neverland, there are $n$ cities and $n$ airlines. Each airline serves an odd number of cities in a circular way, that is, if it serves cities $c_1,c_2,\dots,c_{2k+1}$, then they fly planes connecting $c_1c_2,c_2c_3,\dots,c_1c_{2k+1}$. Show that we can select an odd number of cities $d_1,d_2,\dots,d_{2m+1}$ such that we can fly $d_1\rightarrow d_2\rightarrow\dots\rightarrow d_{2m+1}\rightarrow d_1$ while using each airline at most once.

[u]Round 6[/u] [b]p16.[/b] Let $ABC$ be a triangle with $AB = 3$, $BC = 4$, and $CA = 5$. There exist two possible points $X$ on $CA$ such that if $Y$ and $Z$ are the feet of the perpendiculars from $X$ to $AB$ and $BC,$ respectively, then the area of triangle $XY Z$ is $1$. If the distance between those two possible points can be expressed as $\frac{a\sqrt{b}}{c}$ for positive integers $a$, $b$, and $c$ with $b$ squarefree and $gcd(a, c) = 1$, then find $a +b+ c$. [b]p17.[/b] Let $f(n)$ be the number of orderings of $1,2, ... ,n$ such that each number is as most twice the number preceding it. Find the number of integers $k$ between $1$ and $50$, inclusive, such that $f (k)$ is a perfect square. [b]p18.[/b] Suppose that $f$ is a function on the positive integers such that $f(p) = p$ for any prime p, and that $f (xy) = f(x) + f(y)$ for any positive integers $x$ and $y$. Define $g(n) = \sum_{k|n} f (k)$; that is, $g(n)$ is the sum of all $f(k)$ such that $k$ is a factor of $n$. For example, $g(6) = f(1) + 1(2) + f(3) + f(6)$. Find the sum of all composite $n$ between $50$ and $100$, inclusive, such that $g(n) = n$. [u]Round 7[/u] [b]p19.[/b] AJ is standing in the center of an equilateral triangle with vertices labelled $A$, $B$, and $C$. They begin by moving to one of the vertices and recording its label; afterwards, each minute, they move to a different vertex and record its label. Suppose that they record $21$ labels in total, including the initial one. Find the number of distinct possible ordered triples $(a, b, c)$, where a is the number of $A$'s they recorded, b is the number of $B$'s they recorded, and c is the number of $C$'s they recorded. [b]p20.[/b] Let $S = \sum_{n=1}^{\infty} (1- \{(2 + \sqrt3)^n\})$, where $\{x\} = x - \lfloor x\rfloor$ , the fractional part of $x$. If $S =\frac{\sqrt{a} -b}{c}$ for positive integers $a, b, c$ with $a $ squarefree, find $a + b + c$. [b]p21.[/b] Misaka likes coloring. For each square of a $1\times 8$ grid, she flips a fair coin and colors in the square if it lands on heads. Afterwards, Misaka places as many $1 \times 2$ dominos on the grid as possible such that both parts of each domino lie on uncolored squares and no dominos overlap. Given that the expected number of dominos that she places can be written as $\frac{a}{b}$, for positive integers $a$ and $b$ with $gcd(a, b) = 1$, find $a + b$. PS. You should use hide for answers. Rounds 1-3 have been posted [url=https://artofproblemsolving.com/community/c4h3131401p28368159]here [/url] and 4-5 [url=https://artofproblemsolving.com/community/c4h3131422p28368457]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

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?

Michael is trying to drive a bus from his home, $(0,0)$, to school, located at $(6,6)$. There are horizontal and vertical roads at every line $x=0,1,\ldots,6$ and $y=0,1,\ldots,6$. The city has placed $6$ roadblocks on lattice point intersections $(x,y)$ with $0\leq x,y \leq 6$. Michael notices that the only path he can take that only goes up and to the right is directly up from $(0,0)$ to $(0,6)$, and then right to $(6,6)$. How many sets of $6$ locations could the city have blocked?

A rich knight has a chest and a lot of coins, so every day he puts into the chest some quantity of coins - among the numbers $1, 2, \ldots, 100$. If there exist two days on which he added equal quantities of coins (say, $k$ coins) and he has added in total at most $100k$ coins on the days between these two days, he stops putting coins into the chest. Prove that this will necessarily happen eventually.

Initially the numbers $19$ and $98$ are written on a board. Every minute, each of the two numbers is either squared or increased by $1$. Is it possible to obtain two equal numbers at some time?

For a finite set $A$ of positive integers, a partition of $A$ into two disjoint nonempty subsets $A_1$ and $A_2$ is $\textit{good}$ if the least common multiple of the elements in $A_1$ is equal to the greatest common divisor of the elements in $A_2$. Determine the minimum value of $n$ such that there exists a set of $n$ positive integers with exactly $2015$ good partitions.

An ant crawled a total distance of $1$ in the plane and returned to its original position (so that its path is a closed loop of length $1$; the width is considered to be $0$). Prove that there is a circle of radius $\frac{1}{4}$ containing the path. Illustration of an example path:

Initially on the blackboard eight zeros are written. In one step, it is allowed to choose numbers $a,b,c,d$, erase them and replace them with the numbers $a+1$, $b+2$, $c+3$, $d+3$. Determine: a) the minimum number of steps required to achieve $8$ consecutive integers on the board b) whether it is possible to achieve that sum of the numbers is $2021$ c) whether it is possible to achieve that product of the numbers is $2145$

Given an $ n\times n$ chessboard. a) Find the number of rectangles on the chessboard. b) Assume there exists an $ r\times r$ square (label $ B$) with $ r<n$ which is located on the upper left corner of the board. Define "inner border" of $ A$ as the border of $ A$ which is not the border of the chessboard. How many rectangles in $ B$ that touch exactly one inner border of $ B$?

We call a system of non-empty sets $H$ [i]entwined[/i], if for every disjoint pair of sets $A$ and $B$ in $H$ there exists $b\in B$ such that $A\cup\{b\}$ is in $H$ or there exists $a\in A$ such that $B\cup\{a\}$ is in $H.$ Let $H$ be an entwined system of sets containing all of $\{1\},\{2\},\ldots,\{n\}.$ Prove that if $n>k(k+1)/2,$ then $H$ contains a set with at least $k+1$ elements, and this is sharp for every $k,$ i.e. if $n=k(k+1),$ it is possible that every set in $H$ has at most $k$ elements.

Determine the maximal length $L$ of a sequence $a_1,\dots,a_L$ of positive integers satisfying both the following properties: [list=disc] [*]every term in the sequence is less than or equal to $2^{2023}$, and [*]there does not exist a consecutive subsequence $a_i,a_{i+1},\dots,a_j$ (where $1\le i\le j\le L$) with a choice of signs $s_i,s_{i+1},\dots,s_j\in\{1,-1\}$ for which \[s_ia_i+s_{i+1}a_{i+1}+\dots+s_ja_j=0.\] [/list]

[b]p1.[/b] Roll two dice. What is the probability that the sum of the rolls is prime? [b]p2. [/b]Compute the sum of the first $20$ squares. [b]p3.[/b] How many integers between $0$ and $999$ are not divisible by $7, 11$, or $13$? [b]p4.[/b] Compute the number of ways to make $50$ cents using only pennies, nickels, dimes, and quarters. [b]p5.[/b] A rectangular prism has side lengths $1, 1$, and $2$. What is the product of the lengths of all of the diagonals? [b]p6.[/b] What is the last digit of $7^{6^{5^{4^{3^{2^1}}}}}$ ? [b]p7.[/b] Given square $ABCD$ with side length $3$, we construct two regular hexagons on sides $AB$ and $CD$ such that the hexagons contain the square. What is the area of the intersection of the two hexagons? [img]https://cdn.artofproblemsolving.com/attachments/f/c/b2b010cdd0a270bc10c6e3bb3f450ba20a03e7.png[/img] [b]p8.[/b] Brooke is driving a car at a steady speed. When she passes a stopped police officer, she begins decelerating at a rate of $10$ miles per hour per minute until she reaches the speed limit of $25$ miles per hour. However, when Brooke passed the police officer, he immediately began accelerating at a rate of $20$ miles per hour per minute until he reaches the rate of $40$ miles per hour. If the police officer catches up to Brooke after 3 minutes, how fast was Brooke driving initially? [b]p9.[/b] Find the ordered pair of positive integers $(x, y)$ such that $144x - 89y = 1$ and $x$ is minimal. [b]p10.[/b] How many zeroes does the product of the positive factors of $10000$ (including $1$ and $10000$) have? [b]p11.[/b] There is a square configuration of desks. It is known that one can rearrange these desks such that it has $7$ fewer rows but $10$ more columns, with $13$ desks remaining. How many desks are there in the square configuration? [b]p12.[/b] Given that there are $168$ primes with $3$ digits or less, how many numbers between $1$ and $1000$ inclusive have a prime number of factors? [b]p13.[/b] In the diagram below, we can place the integers from $1$ to $19$ exactly once such that the sum of the entries in each row, in any direction and of any size, is the same. This is called the magic sum. It is known that such a configuration exists. Compute the magic sum. [img]https://cdn.artofproblemsolving.com/attachments/3/4/7efaa5ba5ad250e24e5ad7ef03addbf76bcfb4.png[/img] [b]p14.[/b] Let $E$ be a random point inside rectangle $ABCD$ with side lengths $AB = 2$ and $BC = 1$. What is the probability that angles $ABE$ and $CDE$ are both obtuse? [b]p15.[/b] Draw all of the diagonals of a regular $13$-gon. Given that no three diagonals meet at points other than the vertices of the $13$-gon, how many intersection points lie strictly inside the $13$-gon? [b]p16.[/b] A box of pencils costs the same as $11$ erasers and $7$ pencils. A box of erasers costs the same as $6$ erasers and a pencil. A box of empty boxes and an eraser costs the same as a pencil. Given that boxes cost a penny and each of the boxes contain an equal number of objects, how much does it costs to buy a box of pencils and a box of erasers combined? [b]p17.[/b] In the following figure, all angles are right angles and all sides have length $1$. Determine the area of the region in the same plane that is at most a distance of $1/2$ away from the perimeter of the figure. [img]https://cdn.artofproblemsolving.com/attachments/6/2/f53ae3b802618703f04f41546e3990a7d0640e.png[/img] [b]p18.[/b] Given that $468751 = 5^8 + 5^7 + 1$ is a product of two primes, find both of them. [b]p19.[/b] Your wardrobe contains two red socks, two green socks, two blue socks, and two yellow socks. It is currently dark right now, but you decide to pair up the socks randomly. What is the probability that none of the pairs are of the same color? [b]p20.[/b] Consider a cylinder with height $20$ and radius $14$. Inside the cylinder, we construct two right cones also with height $20$ and radius $14$, such that the two cones share the two bases of the cylinder respectively. What is the volume ratio of the intersection of the two cones and the union of the two cones? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[u]Round 1[/u] [b]1.1[/b] If the sum of two non-zero integers is $28$, then find the largest possible ratio of these integers. [b]1.2[/b] If Tom rolls a eight-sided die where the numbers $1$ − $8$ are all on a side, let $\frac{m}{n}$ be the probability that the number is a factor of $16$ where $m, n$ are relatively prime positive integers. Find $m + n$. [b]1.3[/b] The average score of $35$ second graders on an IQ test was $180$ while the average score of $70$ adults was $90$. What was the total average IQ score of the adults and kids combined? [u]Round 2[/u] [b]2.1[/b] So far this year, Bob has gotten a $95$ and a 98 in Term $1$ and Term $2$. How many different pairs of Term $3$ and Term $4$ grades can Bob get such that he finishes with an average of $97$ for the whole year? Bob can only get integer grades between $0$ and $100$, inclusive. [b]2.2[/b] If a complement of an angle $M$ is one-third the measure of its supplement, then what would be the measure (in degrees) of the third angle of an isosceles triangle in which two of its angles were equal to the measure of angle $M$? [b]2.3[/b] The distinct symbols $\heartsuit, \diamondsuit, \clubsuit$ and $\spadesuit$ each correlate to one of $+, -, \times , \div$, not necessarily in that given order. Given that $$((((72 \,\, \,\, \diamondsuit \,\, \,\,36) \,\, \,\,\spadesuit \,\, \,\,0 ) \,\, \,\, \diamondsuit \,\, \,\, 32) \,\, \,\, \clubsuit \,\, \,\, 3)\,\, \,\, \heartsuit \,\, \,\, 2 = \,\, \,\, 6,$$ what is the value of $$(((((64 \,\, \,\, \spadesuit \,\, \,\, 8) \heartsuit \,\, \,\, 6) \,\, \,\, \spadesuit \,\, \,\, 5) \,\, \,\, \heartsuit \,\, \,\, 1) \,\, \,\, \clubsuit \,\, \,\, 7) \,\, \,\, \diamondsuit \,\, \,\, 1?$$ [u]Round 3[/u] [b]3.1[/b] How many ways can $5$ bunnies be chosen from $7$ male bunnies and $9$ female bunnies if a majority of female bunnies is required? All bunnies are distinct from each other. [b]3.2[/b] If the product of the LCM and GCD of two positive integers is $2021$, what is the product of the two positive integers? [b]3.3[/b] The month of April in ABMC-land is $50$ days long. In this month, on $44\%$ of the days it rained, and on $28\%$ of the days it was sunny. On half of the days it was sunny, it rained as well. The rest of the days were cloudy. How many days were cloudy in April in ABMC-land? [u]Round 4[/u] [b]4.1[/b] In how many ways can $4$ distinct dice be rolled such that a sum of $10$ is produced? [b]4.2[/b] If $p, q, r$ are positive integers such that $p^3\sqrt{q}r^2 = 50$, find the sum of all possible values of $pqr$. [b]4.3[/b] Given that numbers $a, b, c$ satisfy $a + b + c = 0$, $\frac{a}{b}+\frac{b}{c}+\frac{c}{a}= 10$, and $ab + bc + ac \ne 0$, compute the value of $\frac{-a^2 - b^2 - a^2}{ab + bc + ac}$. PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h2826137p24988781]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $\sigma$ be a random permutation of $\{0, 1, \ldots, 6\}$. Let $L(\sigma)$ be the length of the longest initial monotonic consecutive subsequence of $\sigma$ not containing $0$; for example, \[L(\underline{2,3,4},6,5,1,0) = 3,\ L(\underline{3,2},4,5,6,1,0) = 2,\ L(0,1,2,3,4,5,6) = 0.\] If the expected value of $L(\sigma)$ can be written as $\frac mn$, where $m$ and $n$ are relatively prime positive integers, then find $m + n$.

Anna must write $7$ positive integers, not necessarily distinct, around a circle such that the following conditions are met: $\bullet$ The sum of the seven numbers equals $36$. $\bullet$ If two numbers are neighbours, the difference between the largest and the smallest is equal to $2$ or $3$. Find the maximum value of the largest of the numbers that Anna can write.