On some planet, there are $2^N$ countries $(N \geq 4).$ Each country has a flag $N$ units wide and one unit high composed of $N$ fields of size $1 \times 1,$ each field being either yellow or blue. No two countries have the same flag. We say that a set of $N$ flags is diverse if these flags can be arranged into an $N \times N$ square so that all $N$ fields on its main diagonal will have the same color. Determine the smallest positive integer $M$ such that among any $M$ distinct flags, there exist $N$ flags forming a diverse set. [i]Proposed by Tonći Kokan, Croatia[/i]

Let $n$ be a positive integer. The numbers $1, 2, \dots, 2n+1$ are arranged in a circle in that order, and some of them are [i] marked[/i]. We define, for each $k$ such that $1\leq k \leq 2n+1$ , the interval $I_k$ to be the closed circular interval starting at $k$ and ending in $k+n$ (taking remainders mod(2n+1)). We call in interval [i]magical[/i] if it contains strictly more than half of all the marked elements. Prove that the following two statements are equivalent: 1. At least $n+1$ of the intervals $I_1, I_2, \dots, I_{2n+1}$ are magical 2. The number of marked numbers is odd

Let $n$ be a natural number greater than 2. $l$ is a line on a plane. There are $n$ distinct points $P_1$, $P_2$, …, $P_n$ on $l$. Let the product of distances between $P_i$ and the other $n-1$ points be $d_i$ ($i = 1, 2,$ …, $n$). There exists a point $Q$, which does not lie on $l$, on the plane. Let the distance from $Q$ to $P_i$ be $C_i$ ($i = 1, 2,$ …, $n$). Find $S_n = \sum_{i = 1}^{n} (-1)^{n-i} \frac{c_i^2}{d_i}$.

We are given five watches which can be winded forward. What is the smallest sum of winding intervals which allows us to set them to the same time, no matter how they were set initially?

We have a rectangle with integer sides $m, n$ that is subdivided into $mn$ squares of side $1$. Find the number of little squares that are crossed by the diagonal (without counting those that are touched only in one vertex)

Betty has a $3\times 4$ grid of dots. She colors each dot either red or maroon. Compute the number of ways Betty can color the grid such that there is no rectangle whose sides are parallel to the grid lines and whose vertices all have the same color.

During his excursion to the historical park, Pepito set out to collect stones whose weight in kilograms is a power of two. Once the first stone has been collected, Pepito only collects stones strictly heavier than the first. At the end of the excursion, her partner Ana chooses a positive integer $K \ge 2$ and challenges Pepito to divide the stones into $K$ groups of equal weight. a) Can Pepito meet the challenge if all the stones he collected have different weights? b) Can Pepito meet the challenge if some collected stones are allowed to have equal weight?

$3n-1$ points are given in the plane, no three are collinear. Prove that one can select $2n$ of them whose convex hull is not a triangle.

We are given $2n$ natural numbers \[1, 1, 2, 2, 3, 3, \ldots, n - 1, n - 1, n, n.\] Find all $n$ for which these numbers can be arranged in a row such that for each $k \leq n$, there are exactly $k$ numbers between the two numbers $k$.

p1. It is known that $f$ is a function such that $f(x)+2f\left(\frac{1}{x}\right)=3x$ for every $x\ne 0$. Find the value of $x$ that satisfies $f(x) = f(-x)$. p2. It is known that ABC is an acute triangle whose vertices lie at circle centered at point $O$. Point $P$ lies on side $BC$ so that $AP$ is the altitude of triangle ABC. If $\angle ABC + 30^o \le \angle ACB$, prove that $\angle COP + \angle CAB < 90^o$. p3. Find all natural numbers $a, b$, and $c$ that are greater than $1$ and different, and fulfills the property that $abc$ divides evenly $bc + ac + ab + 2$. p4. Let $A, B$, and $ P$ be the nails planted on the board $ABP$ . The length of $AP = a$ units and $BP = b$ units. The board $ABP$ is placed on the paths $x_1x_2$ and $y_1y_2$ so that $A$ only moves freely along path $x_1x_2$ and only moves freely along the path $y_1y_2$ as in following image. Let $x$ be the distance from point $P$ to the path $y_1y_2$ and y is with respect to the path $x_1x_2$ . Show that the equation for the path of the point $P$ is $\frac{x^2}{b^2}+\frac{y^2}{a^2}=1$. [img]https://cdn.artofproblemsolving.com/attachments/4/6/d88c337370e8c3bc5a1833bc9588d3fb047bd0.png[/img] p5. There are three boxes $A, B$, and $C$ each containing $3$ colored white balls and $2$ red balls. Next, take three ball with the following rules: 1. Step 1 Take one ball from box $A$. 2. Step 2 $\bullet$ If the ball drawn from box $A$ in step 1 is white, then the ball is put into box $B$. Next from box $B$ one ball is drawn, if it is a white ball, then the ball is put into box $C$, whereas if the one drawn is red ball, then the ball is put in box $A$. $\bullet$ If the ball drawn from box $A$ in step 1 is red, then the ball is put into box $C$. Next from box $C$ one ball is taken. If what is drawn is a white ball then the ball is put into box $A$, whereas if the ball drawn is red, the ball is placed in box $B$. 3. Step 3 Take one ball each from squares $A, B$, and $C$. What is the probability that all the balls drawn in step 3 are colored red?

[u]Round 5[/u] [b]p13.[/b] Determine the number of different circular bracelets can be made with $7$ beads, all either colored red or black. [b]p14.[/b] The product of $260$ and $n$ is a perfect square. The $2020$th least possible positive integer value of $n$ can be written as$ p^{e_1}_1 \cdot p^{e_2}_2\cdot p^{e_3}_3\cdot p^{e_4}_4$ . Find the sum $p_1 +p_2 +p_3 +p_4 +e_1 +e_2 +_e3 +e_4$. [b]p15.[/b] Let $B$ and $C$ be points along the circumference of circle $\omega$. Let $A$ be the intersection of the tangents at $B$ and $C$ and let $D \ne A$ be on $\overrightarrow{AC}$ such that $AC =CD = 6$. Given $\angle BAC = 60^o$, find the distance from point $D$ to the center of $\omega$. [u]Round 6[/u] [b]p16.[/b] Evaluate $\sqrt{2+\sqrt{2+\sqrt{2+...}}}$. [b]p17.[/b] Let $n(A)$ be the number of elements of set $A$ and $||A||$ be the number of subsets of set $A$. Given that $||A||+2||B|| = 2^{2020}$, find the value of $n(B)$. [b]p18.[/b] $a$ and $b$ are positive integers and $8^a9^b$ has $578$ factors. Find $ab$. [u]Round 7[/u] [b]p19.[/b] Determine the probability that a randomly chosen positive integer is relatively prime to $2019$. [b]p20.[/b] A $3$-by-$3$ grid of squares is to be numbered with the digits $1$ through $9$ such that each number is used once and no two even-numbered squares are adjacent. Determine the number of ways to number the grid. [b]p21.[/b] In $\vartriangle ABC$, point $D$ is on $AC$ so that $\frac{AD}{DC}= \frac{1}{13}$ . Let point $E$ be on $BC$, and let $F$ be the intersection of $AE$ and $BD$. If $\frac{DF}{FB}=\frac{2}{7}$ and the area of $\vartriangle DBC$ is $26$, compute the area of $\vartriangle F AB$. [u]Round 8[/u] [b]p22.[/b] A quarter circle with radius $1$ is located on a line with its horizontal base on the line and to the left of the vertical side. It is then rolled to the right until it reaches its original orientation. Determine the distance traveled by the center of the quarter circle. [b]p23.[/b] In $1734$, mathematician Leonhard Euler proved that $\frac{\pi^2}{6}=\frac11+\frac14+\frac19+\frac{1}{16}+...$. With this in mind, calculate the value of $\frac11-\frac14+\frac19-\frac{1}{16}+...$ (the series obtained by negating every other term of the original series). [b]p24.[/b] Billy the biker is competing in a bike show where he can do a variety of tricks. He knows that one trick is worth $2$ points, $1$ trick is worth $3$ points, and 1 is worth $5$ points, but he doesn’t remember which trick is worth what amount. When it’s Billy’s turn to perform, he does $6$ tricks, randomly choosing which trick to do. Compute the sum of all the possible values of points that Billy could receive in total. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3166016p28809598]here [/url] and 9-12 [url=https://artofproblemsolving.com/community/c3h3166115p28810631]here[/url].Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A country has $100$ cities and $n$ airplane companies which take care of a total of $2018$ two-way direct flights between pairs of cities. There is a pair of cities such that one cannot reach one from the other with just one or two flights. What is the largest possible value of $n$ for which between any two cities there is a route (a sequence of flights) using only one of the airplane companies?

What is the greatest number of parts that $5$ spheres can divide the space into?

Let $n>3$ be an integer. Integers $a_1, \dots, a_n$ are given so that $a_k\in \{k, -k\}$ for all $1\leq k\leq n$. Prove that there is a sequence of indices $1\leq k_1, k_2, \dots, k_n\leq n$, not necessarily distinct, for which the sums \[a_{k_1}\] \[a_{k_1}+a_{k_2}\] \[a_{k_1}+a_{k_2}+a_{k_3}\] \[\vdots\] \[a_{k_1}+a_{k_2}+\cdots+a_{k_n}\] have distinct residues modulo $2n+1$, and so that the last one is divisible by $2n+1$.

Is it possible to arrange the numbers $1,2,...,2011$ over the circle in some order so that among any $25$ successive numbers at least $8$ numbers are multiplies of $5$ or $7$ (or both $5$ and $7$) ? I. Gorodnin

Let us consider mathematical crossword which we fill with numbers $0$, $1$, $2$, $3$, $4$, $5$, $6$, $7$, $8$, $9$ such that: 1) All digits occur exactly twice 2) $10$ horizontally divides $4$ vertically 3) $4 \cdot$ ($4$ horizontally - $4$ vertically +$5$) equals $1$ vertically 4) $36$ divides $1$ horizontally and $5$ vertically 5) $9$ vertically divides $5$ vertically In how many ways we can solve this mathematical crossword? [img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvOC85LzgyNjUzYmNkNTVmNDE1YTg4OWVkNzAzYzE1M2JkZWE0MThiYWY1LnBuZw==&rn=Y3Jvc3N3b3JkLnBuZw==[/img]

Three lights are placed horizontally on a line on the ceiling. All the lights are initially off. Every second, Neil picks one of the three lights uniformly at random to switch: if it is off, he switches it on; if it is on, he switches it off. When a light is switched, any lights directly to the left or right of that light also get turned on (if they were off) or off (if they were on). The expected number of lights that are on after Neil has flipped switches three times can be expressed in the form $m/ n$ , where $m$ and $n$ are relatively prime positive integers. Compute $m + n$.

Ten points on a plane a such that any four of them lie on the boundary of some square. Is obligatory true that all ten points lie on the boundary of some square?

A strongman Bambula can carry several weights at the same time, if their total weight does not exceed $200$ kg, and these weights are no more than three. On the way to work, he injured his finger and found that he could now carry no more than two weights (and still no more than $200$ kg). At what minimum $k$ is the statement true: [i]any set of $100$ weights that Bambula could previously carry in $50$ runs, with a sore finger, he will be able to carry in no more than $k$ runs?[/i]

Given an infinite sequence of numbers $a_1, a_2,...$, in which there are no two equal members. Segment $a_i, a_{i+1}, ..., a_{i+m-1}$ of this sequence is called a monotone segment of length $m$, if $a_i < a_{i+1} <...<a_{i+m-1}$ or $a_i > a_{i+1} >... > a_{i+m-1}$. It turned out that for each natural $k$ the term $a_k$ is contained in some monotonic segment of length $k + 1$. Prove that there exists a natural $N$ such that the sequence $a_N , a_{N+1} ,...$ monotonic.

How many non-intersecting pairs of paths we have from (0,0) to (n,n) so that path can move two ways:top or right?

There is a population $P$ of $10000$ bacteria, some of which are friends (friendship is mutual), so that each bacterion has at least one friend and if we wish to assign to each bacterion a coloured membrane so that no two friends have the same colour, then there is a way to do it with $2021$ colours, but not with $2020$ or less. Two friends $A$ and $B$ can decide to merge in which case they become a single bacterion whose friends are precisely the union of friends of $A$ and $B$. (Merging is not allowed if $A$ and $B$ are not friends.) It turns out that no matter how we perform one merge or two consecutive merges, in the resulting population it would be possible to assign $2020$ colours or less so that no two friends have the same colour. Is it true that in any such population $P$ every bacterium has at least $2021$ friends?

$2021$ copies of each of the number from $1$ to $5$ are initially written on the board.Every second Alice picks any two f these numbers, say $a$ and $b$ and writes $\frac{ab}{c}$.Where $c$ is the length of the hypoteneus with sides $a$ and $b$.Alice stops when only one number is left.If the minnimum number she could write was $x$ and the maximum number she could write was $y$ then find the greatest integer lesser than $2021^2xy$. [hide=PS]Does any body know how to use floors and ceiling function?cuz actuall formation used ceiling,but since Idk how to use ceiling I had to do it like this :(]

Turbo the snail sits on a point on a circle with circumference $1$. Given an infinite sequence of positive real numbers $c_1, c_2, c_3, \dots$, Turbo successively crawls distances $c_1, c_2, c_3, \dots$ around the circle, each time choosing to crawl either clockwise or counterclockwise. Determine the largest constant $C > 0$ with the following property: for every sequence of positive real numbers $c_1, c_2, c_3, \dots$ with $c_i < C$ for all $i$, Turbo can (after studying the sequence) ensure that there is some point on the circle that it will never visit or crawl across.

What is the maximum number of knights that can be placed on a chessboard of size \(8 \times 8\) such that any knight, after making 1 or 2 arbitrary moves, does not land on a square occupied by another knight? [i]Proposed by Bogdan Rublov[/i]