If $\overrightarrow{u_1},\overrightarrow{u_2}, ...,\overrightarrow{u_n}$ be vectors in the plane such that the sum of their lengths is at least $1$, then between them we find vectors whose sum is a vector of length at least $\sqrt2/8$. Prove it.

Each vertex of a regular polygon is colored in one of three colors so that an odd number of vertices are colored in each of the three colors. Prove that the number of isosceles triangles whose vertices are colored in three different colors is odd. [i]From foreign Olympiads[/i]

Let $n>1$ be an integer. A set $S \subset \{ 0,1,2, \ldots, 4n-1\}$ is called [i]rare[/i] if, for any $k\in\{0,1,\ldots,n-1\}$, the following two conditions take place at the same time (1) the set $S\cap \{4k-2,4k-1,4k, 4k+1, 4k+2 \}$ has at most two elements; (2) the set $S\cap \{4k+1,4k+2,4k+3\}$ has at most one element. Prove that the set $\{0,1,2,\ldots,4n-1\}$ has exactly $8 \cdot 7^{n-1}$ rare subsets.

Alice has $100$ balls and $10$ buckets. She takes each ball and puts it in a bucket that she chooses at random. After she is done, let $b_i$ be the number of balls in the $i$th bucket, for $1\le i \le 10$. Compute the expected value of $\Sigma_{i=1}^{10}b_i^2$

p1. Find all real numbers that satisfy the equation $$(1 + x^2 + x^4 + .... + x^{2014})(x^{2016} + 1) = 2016x^{2015}$$ p2. Let $A$ be an integer and $A = 2 + 20 + 201 + 2016 + 20162 + ... + \underbrace{20162016...2016}_{40\,\, digits}$ Find the last seven digits of $A$, in order from millions to units. p3. In triangle $ABC$, points $P$ and $Q$ are on sides of $BC$ so that the length of $BP$ is equal to $CQ$, $\angle BAP = \angle CAQ$ and $\angle APB$ is acute. Is triangle $ABC$ isosceles? Write down your reasons. p4. Ayu is about to open the suitcase but she forgets the key. The suitcase code consists of nine digits, namely four $0$s (zero) and five $1$s. Ayu remembers that no four consecutive numbers are the same. How many codes might have to try to make sure the suitcase is open? p5. Fulan keeps $100$ turkeys with the weight of the $i$-th turkey, being $x_i$ for $i\in\{1, 2, 3, ... , 100\}$. The weight of the $i$-th turkey in grams is assumed to follow the function $x_i(t) = S_it + 200 - i$ where $t$ represents the time in days and $S_i$ is the $i$-th term of an arithmetic sequence where the first term is a positive number $a$ with a difference of $b =\frac15$. It is known that the average data on the weight of the hundred turkeys at $t = a$ is $150.5$ grams. Calculate the median weight of the turkey at time $t = 20$ days.

Given a positive integer $n \geq 2$ and real numbers $a_1, a_2, \ldots, a_n \in [0,1]$. Prove that there exist real numbers $b_1, b_2, \ldots, b_n \in \{0,1\}$, such that for all $1\leq k\leq l \leq n$ we have $$\left| \sum_{i=k}^l (a_i-b_i)\right| \leq \frac{n}{n+1}.$$

For any natural $n$, $f(n)$ is the number of labeled digraphs with $n$ vertices such that for any vertex the number if in-edges is equal to the number of out-edges and the total of (in+out) edges is even. Let $g(n)$ be the odd-analogous of $f(n)$. Find $g(n)-f(n)$ with proof . [hide=original formulation] Dado $n$ natural, seja $f(n)$ o número de grafos rotulados direcionados com $n$ vértices de modo que em cada vértice o número de arestas que chegam é igual ao número de arestas que saem e o número de arestas total do grafo é par . Defina $g(n)$ analogamente trocando "par" por "ímpar" na definição acima. Calcule $f(n) - g (n)$. (Observação: Um grafo rotulado direcionado é um par $G = (V, E)$ onde $V = \{1, 2, …, n\}$ e $E$ é um subconjunto de $V^2 -\{(i, i); 0 < i < n + 1\}$).[/hide]

A hunter and an invisible rabbit play a game in the Euclidean plane. The rabbit's starting point, $A_0,$ and the hunter's starting point, $B_0$ are the same. After $n-1$ rounds of the game, the rabbit is at point $A_{n-1}$ and the hunter is at point $B_{n-1}.$ In the $n^{\text{th}}$ round of the game, three things occur in order: [list=i] [*]The rabbit moves invisibly to a point $A_n$ such that the distance between $A_{n-1}$ and $A_n$ is exactly $1.$ [*]A tracking device reports a point $P_n$ to the hunter. The only guarantee provided by the tracking device to the hunter is that the distance between $P_n$ and $A_n$ is at most $1.$ [*]The hunter moves visibly to a point $B_n$ such that the distance between $B_{n-1}$ and $B_n$ is exactly $1.$ [/list] Is it always possible, no matter how the rabbit moves, and no matter what points are reported by the tracking device, for the hunter to choose her moves so that after $10^9$ rounds, she can ensure that the distance between her and the rabbit is at most $100?$ [i]Proposed by Gerhard Woeginger, Austria[/i]

[b]p1.[/b] Replace $*$’s by an arithmetic operations (addition, subtraction, multiplication or division) to obtain true equality $$2*0*1*6*7=1.$$ [b]p2.[/b] The interval of length $88$ cm is divided into three unequal parts. The distance between middle points of the left and right parts is $46$ cm. Find the length of the middle part. [b]p3.[/b] A $5\times 6$ rectangle is drawn on a square grid. Paint some cells of the rectangle in such a way that every $3\times 2$ sub‐rectangle has exactly two cells painted. [b]p4.[/b] There are $8$ similar coins. $5$ of them are counterfeit. A detector can analyze any set of coins and show if there are counterfeit coins in this set. The detector neither determines which coins nare counterfeit nor how many counterfeit coins are there. How to run the detector twice to find for sure at least one counterfeit coin? [b]p5.[/b] There is a set of $20$ weights of masses $1, 2, 3,...$ and $20$ grams. Can one divide this set into three groups of equal total masses? [b]p6.[/b] Replace letters $A,B,C,D,E,F,G$ by the digits $0,1,...,9$ to get true equality $AB+CD=EF * EG$ (different letters correspond to different digits, same letter means the same digit, $AB$, $CD$, $EF$, and $EG$ are two‐digit numbers). PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A subset $S$ of positive real numbers is called [i]powerful[/i] if for any two distinct elements $a, b$ of $S$, at least one of $a^{b}$ or $b^{a}$ is also an element of $S$. [b]a)[/b] Give an example of a four elements powerful set. [b]b)[/b] Prove that every finite powerful set has at most four elements.

Three players $A, B$ and $C$ take turns taking stones from a pile of $N$ stones. They play in the order $A$, $B$, $C$, $A$, $B$, $C$, $....$, $A$ starts the game and the one who takes the last stone loses. Players $A$ and $C$ They form a team against $B$, they agree on a strategy joint. $B$ can take $1, 2, 3, 4$ or $5$ stones on each move, while that $A$ and $C$ can each draw $1, 2$ or $3$ stones in each turn. Determine for which values of $N$ have winning strategies $A$ and $C$ , and for what values the winning strategy is $B$'s.

Find all pair $(m,n)$ of integer ($m >1,n \geq 3$) with the following property:If an $n$-gon can be partitioned into $m$ isoceles triangles,then the $n$-gon has two congruent sides.

Boy A and $2016$ flags are on a circumference whose length is $1$ of a circle. He wants to get all flags by moving on the circumference. He can get all flags by moving distance $l$ regardless of the positions of boy A and flags. Find the possible minimum value as $l$ like this. Note that boy A doesn’t have to return to the starting point to leave gotten flags.

We consider a number of points in a plane. Each of these points is connected to at least one of the other points by a line segment, in such a way that a figure arises that does not break up into different parts (that is, from any point along drawn line segments we can reach any other point).. We assign a point the ”order” $n$, when in this point $n$ line segments meet. We characterize the obtained figure by writing down the order of each of its points one after the other. For example, a hexagon is characterized by the combination $\{2,2,2,2,2,2\}$ and a star with six rays by $\{6,1,1,1,1,1,1\}$. (a) Sketch a figure' belonging to the combination $\{4,3,3,3,3\}$. (b) Give the combinations of all possible figures, of which the sum of the order numbers is equal to $6$. (c) Prove that every such combination contains an even number of odd numbers.

[b]p1.[/b] Let $X = 2022 + 022 + 22 + 2$. When $X$ is divided by $22$, there is a remainder of $R$. What is the value of $R$? [b]p2.[/b] When Amy makes paper airplanes, her airplanes fly $75\%$ of the time. If her airplane flies, there is a $\frac56$ chance that it won’t fly straight. Given that she makes $80$ airplanes, what is the expected number airplanes that will fly straight? [b]p3.[/b] It takes Joshua working alone $24$ minutes to build a birdhouse, and his son working alone takes $16$ minutes to build one. The effective rate at which they work together is the sum of their individual working rates. How long in seconds will it take them to make one birdhouse together? [b]p4.[/b] If Katherine’s school is located exactly $5$ miles southwest of her house, and her soccer tournament is located exactly $12$ miles northwest of her house, how long, in hours, will it take Katherine to bike to her tournament right after school given she bikes at $0.5$ miles per hour? Assume she takes the shortest path possible. [b]p5.[/b] What is the largest possible integer value of $n$ such that $\frac{4n+2022}{n+1}$ is an integer? [b]p6.[/b] A caterpillar wants to go from the park situated at $(8, 5)$ back home, located at $(4, 10)$. He wants to avoid routes through $(6, 7)$ and $(7, 10)$. How many possible routes are there if the caterpillar can move in the north and west directions, one unit at a time? [b]p7.[/b] Let $\vartriangle ABC$ be a triangle with $AB = 2\sqrt{13}$, $BC = 6\sqrt2$. Construct square $BCDE$ such that $\vartriangle ABC$ is not contained in square $BCDE$. Given that $ACDB$ is a trapezoid with parallel bases $\overline{AC}$, $\overline{BD}$, find $AC$. [b]p8.[/b] How many integers $a$ with $1 \le a \le 1000$ satisfy $2^a \equiv 1$ (mod $25$) and $3^a \equiv 1$ (mod $29$)? [b]p9.[/b] Let $\vartriangle ABC$ be a right triangle with right angle at $B$ and $AB < BC$. Construct rectangle $ADEC$ such that $\overline{AC}$,$\overline{DE}$ are opposite sides of the rectangle, and $B$ lies on $\overline{DE}$. Let $\overline{DC}$ intersect $\overline{AB}$ at $M$ and let $\overline{AE}$ intersect $\overline{BC}$ at $N$. Given $CN = 6$, $BN = 4$, find the $m+n$ if $MN^2$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m, n$. [b]p10.[/b] An elimination-style rock-paper-scissors tournament occurs with $16$ players. The $16$ players are all ranked from $1$ to $16$ based on their rock-paper-scissor abilities where $1$ is the best and $16$ is the worst. When a higher ranked player and a lower ranked player play a round, the higher ranked player always beats the lower ranked player and moves on to the next round of the tournament. If the initial order of players are arranged randomly, and the expected value of the rank of the $2$nd place player of the tournament can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m, n$ what is the value of $m+n$? [b]p11.[/b] Estimation (Tiebreaker) Estimate the number of twin primes (pairs of primes that differ by $2$) where both primes in the pair are less than $220022$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The integers $1, 2, 3, 4, 5$ and $6$ are written on a board. You can perform the following kind of move: select two of the numbers, say $a$ and $b$, such that $4a - 2b$ is nonnegative; erase $a$ and $b$, then write down $4a - 2b$ on the board (hence replacing two of the numbers by just one). Continue performing such moves until only one number remains on the board. What is the smallest possible positive value of this last remaining number?

Fix an integer $n \ge 2$. A fairy chess piece [i]leopard [/i] may move one cell up, or one cell to the right, or one cell diagonally down-left. A leopard is placed onto some cell of a $3n \times 3n$ chequer board. The leopard makes several moves, never visiting a cell twice, and comes back to the starting cell. Determine the largest possible number of moves the leopard could have made. Dmitry Khramtsov, Russia

There are $6$ points on the plane such that no three of them are collinear. It's known that between every $4$ points of them, there exists a point that it's power with respect to the circle passing through the other three points is a constant value $k$.(Power of a point in the interior of a circle has a negative value.) Prove that $k=0$ and all $6$ points lie on a circle. [i]Proposed by Morteza Saghafian[/I]

See all the problems from 5-th Kyiv math festival [url=http://www.mathlinks.ro/Forum/viewtopic.php?p=506789#p506789]here[/url] The number $123456789$ is written on the blackboard. At each step it is allowed to choose its digits $a$ and $b$ of the same parity and to replace each of them by $\frac{a+b}{2}.$ Is it possible to obtain a number larger then a)$800000000$; b)$880000000$ by such replacements?

Given the positive integer $m \geq 2$, $n \geq 3$. Define the following set $$S = \left\{(a, b) | a \in \{1, 2, \cdots, m\}, b \in \{1, 2, \cdots, n\} \right\}.$$Let $A$ be a subset of $S$. If there does not exist positive integers $x_1, x_2, y_1, y_2, y_3$ such that $x_1 < x_2, y_1 < y_2 < y_3$ and $$(x_1, y_1), (x_1, y_2), (x_1, y_3), (x_2, y_2) \in A.$$Determine the largest possible number of elements in $A$.

Let $n$ be a positive integer. We are given a $3n \times 3n$ board whose unit squares are colored in black and white in such way that starting with the top left square, every third diagonal is colored in black and the rest of the board is in white. In one move, one can take a $2 \times 2$ square and change the color of all its squares in such way that white squares become orange, orange ones become black and black ones become white. Find all $n$ for which, using a finite number of moves, we can make all the squares which were initially black white, and all squares which were initially white black. Proposed by [i]Boris Stanković and Marko Dimitrić, Bosnia and Herzegovina[/i]

Consider the infinite grid of lattice points in $\mathbb{Z}^3$. Little D and Big Z play a game, where Little D first loses a shoe on an unmunched point in the grid. Then, Big Z munches a shoe-free plane perpendicular to one of the coordinate axes. They continue to alternate turns in this fashion, with Little D's goal to lose a shoe on each of $n$ consecutive lattice points on a line parallel to one of the coordinate axes. Determine all $n$ for which Little D can accomplish his goal. [i]David Yang.[/i]

A [i]calendar[/i] is a (finite) rectangular grid. A calendar is [i]valid[/i] if it satisfies the following conditions: (i) Each square of the calendar is colored white or red, and there are exactly 10 red squares. (ii) Suppose that there are $N$ columns of squares in the calendar. Then if we fill in the numbers $1,2,\ldots$ from the top row to the bottom row, and within each row from left to right, there do not exist $N$ consecutive numbers such that the squares they are in are all white. (iii) Suppose that there are $M$ rows of squares in the calendar. Then if we fill in the numbers $1,2,\ldots$ from the left-most column to the right-most column, and within each column from bottom to top, there do not exist $M$ consecutive numbers such that the squares they are in are all white. In other words, if we rotate the calendar clockwise by $90^{\circ}$, the resulting calendar still satisfies (ii). How many different kinds of valid calendars are there? (Remark: During the actual exam, the contestants were confused about what counts as different calendars. So although this was not in the actual exam, I would like to specify that two calendars are considered different if they have different side lengths or if the $10$ red squares are at different locations.)

The Bank of Oslo issues two types of coin: aluminum (denoted A) and bronze (denoted B). Marianne has $n$ aluminum coins and $n$ bronze coins arranged in a row in some arbitrary initial order. A chain is any subsequence of consecutive coins of the same type. Given a fixed positive integer $k \leq 2n$, Gilberty repeatedly performs the following operation: he identifies the longest chain containing the $k^{th}$ coin from the left and moves all coins in that chain to the left end of the row. For example, if $n=4$ and $k=4$, the process starting from the ordering $AABBBABA$ would be $AABBBABA \to BBBAAABA \to AAABBBBA \to BBBBAAAA \to ...$ Find all pairs $(n,k)$ with $1 \leq k \leq 2n$ such that for every initial ordering, at some moment during the process, the leftmost $n$ coins will all be of the same type.

Let $n\ge 3$ be an integer. In a country there are $n$ airports and $n$ airlines operating two-way flights. For each airline, there is an odd integer $m\ge 3$, and $m$ distinct airports $c_1, \dots, c_m$, where the flights offered by the airline are exactly those between the following pairs of airports: $c_1$ and $c_2$; $c_2$ and $c_3$; $\dots$ ; $c_{m-1}$ and $c_m$; $c_m$ and $c_1$. Prove that there is a closed route consisting of an odd number of flights where no two flights are operated by the same airline.