Let $\mathcal{P}_0=A_0A_1\ldots A_{n-1}$ be a convex polygon such that $A_iA_{i+1}=2^{[i/2]}$ for $i=0, 1,\ldots ,n-1$ (where $A_n=A_0$). Define the sequence of polygons $\mathcal{P}_k=A_0^kA_1^k\ldots A_{n-1}^k$ as follows: $A_i^1$ is symmetric to $A_i$ with respect to $A_0$, $A_i^2$ is symmetric to $A_i^1$ with respect to $A_1^1$, $A_i^3$ is symmetric to $A_i^2$ with respect to $A_2^2$ and so on. Find the values of $n$ for which infinitely many polygons $\mathcal{P}_k$ coincide with $\mathcal{P}_0$.

A finite sequence is said to be [i]disorderly[/i], if no two terms of the sequence have their average in between them. For example, $(0, 2, 1)$ is disorderly, for $1 = \frac{0+2}{2}$ is not in between $0$ and $2$, and the other averages $\frac{0+1}{2} = \frac{1}{2}$ and $\frac{2+1}{2} = 1\frac{1}{2}$ do not even occur in the sequence. Prove that for every $n \in \Bbb{N}$ there is a disorderly sequence enumerating the numbers $0, 1,\ldots , n$ without repetitions.

Suppose $n$ lines in plane are such that no two are parallel and no three are concurrent. For each two lines their angle is a real number in $[0,\frac{\pi}2]$. Find the largest value of the sum of the $\binom n2$ angles between line. [i]By Aliakbar Daemi[/i]

A $1 \times n$ rectangle ($n \geq 1 $) is divided into $n$ unit ($1 \times 1$) squares. Each square of this rectangle is colored red, blue or green. Let $f(n)$ be the number of colourings of the rectangle in which there are an even number of red squares. What is the largest prime factor of $f(9)/f(3)$? (The number of red squares can be zero.)

Let $m,n,k$ be positive integers, $m> n> k$. An $1 \times m$ strip of paper is divided into the $1 \times 1$ cells. A teacher asks Bill and Pit to place numbers $0$ and $1$ in the cells of the strip so that the sum of the numbers in any $n$ consecutive cells is equal to $k$. After the task was performed it turned out that the sum $S(B)$ of all numbers on the strip of Bill was different from the sum $S(P)$ of Pit. Find the largest possible value of $|S(B) - S(P) |$. (I. Voronovich)

Let $k$ be a positive integer. $12k$ persons have participated in a party and everyone shake hands with $3k+6$ other persons. We know that the number of persons who shake hands with every two persons is a fixed number. Find $k.$

Find the number of all unordered pairs $\{A,B \}$ of subsets of an $8$-element set, such that $A\cap B \neq \emptyset$ and $\left |A \right | \neq \left |B \right |$.

A fair coin is tossed repeatedly until there is a run of an odd number of heads followed by a tail. Determine the expected number of tosses.

Given the positive integer $n$. Let $X = \{1, 2,..., n\}$. For each nonempty subset $A$ of $X$, set $r(A) = max_A - min_A$, where $max_A, min_A$ are the greatest and smallest elements of $A$, respectively. Find the mean value of $r(A)$ when $A$ runs on subsets of $X$.

Let $k$ and $n$ be positive integers, with $k \le n$. A certain class has n students, and among any $k$ of them there is always one that is friends with the other $k- 1$. Find all values of $k$ and $n$ for which there must necessarily be a student who is friends with everyone else in the class.

Alice refuses to sit next to either Bob or Carla. Derek refuses to sit next to Eric. How many ways are there for the five of them to sit in a row of $5$ chairs under these conditions? $\textbf{(A)}\ 12\qquad\textbf{(B)}\ 16\qquad\textbf{(C)}\ 28\qquad\textbf{(D)}\ 32\qquad\textbf{(E)}\ 40$

Given is a set $A$ of $n$ elements and positive integers $k, m$ such that $4 \leq k <n$ and $m \leq \min \{k-3, \frac {n} {2}\}$. Let $A_1, A_2, \ldots, A_l$ be subsets of $A$, all with size $k$, such that $|A_i \cap A_j| \leq m$ for all $i \neq j$. Prove that there exists a subset $B$ of $A$ with at least $\sqrt[m+1]{n}+m$ elements which doesn't contain entirely any of the subsets $A_1, A_2, \ldots, A_l$.

A set of three nonnegative integers $\{x,y,z\}$ with $x < y < z$ is called [i]historic[/i] if $\{z-y,y-x\} = \{1776,2001\}$. Show that the set of all nonnegative integers can be written as the union of pairwise disjoint historic sets.

Cut pyramid $ABCD$ into $8$ equal and similar pyramids, if: a) $AB = BC = CD$, $\angle ABC =\angle BCD = 90^o$, dihedral angle at edge $BC$ is right b) all plane angles at vertex $B$ are right and $AB = BC = BD\sqrt2$. Note. Whether there are other types of triangular pyramids that can be cut into any number similar to the original pyramids (their number is not necessarily $8$ and the pyramids are not necessarily equal to each other) is currently unknown

A regular hexagon in the plane is called sweet if its area is equal to $1$. Is it possible to place $2000000$ sweet hexagons in the plane such that the union of their interiors is a convex polygon of area at least $1900000$? Remark: A subset $S$ of the plane is called convex if for every pair of points in $S$, every point on the straight line segment that joins the pair of points also belongs to $S$. The hexagons may overlap.

[b]p1.[/b] At a certain point in time, $20\%$ of seniors, $30\%$ of juniors, and $50\%$ of sophomores at a school had a cold. If the number of sick students was the same for each grade, the fraction of sick students across all three grades can be written as $\frac{a}{b}$ , where a and b are relatively prime positive integers. Find $a + b$. [b]p2.[/b] The average score on Mr. Feng’s recent test is a $63$ out of $100$. After two students drop out of the class, the average score of the remaining students on that test is now a $72$. What is the maximum number of students that could initially have been in Mr. Feng’s class? (All of the scores on the test are integers between $0$ and $100$, inclusive.) [b]p3.[/b] Madeline is climbing Celeste Mountain. She starts at $(0, 0)$ on the coordinate plane and wants to reach the summit at $(7, 4)$. Every hour, she moves either $1$ unit up or $1$ unit to the right. A strawberry is located at each of $(1, 1)$ and $(4, 3)$. How many paths can Madeline take so that she encounters exactly one strawberry? [b]p4.[/b] Let $E$ be a point on side $AD$ of rectangle $ABCD$. Given that $AB = 3$, $AE = 4$, and $\angle BEC = \angle CED$, the length of segment $CE$ can be written as $\sqrt{a}$ for some positive integer $a$. Find $a$. [b]p5.[/b] Lucy has some spare change. If she were to convert it into quarters and pennies, the minimum number of coins she would need is $66$. If she were to convert it into dimes and pennies, the minimum number of coins she would need is $147$. How much money, in cents, does Lucy have? [b]p6.[/b] For how many positive integers $x$ does there exist a triangle with altitudes of length $20$, $22$, and $x$? [b]p7.[/b] Compute the number of positive integers $x$ for which $\frac{x^{20}}{x+22}$ is an integer. [b]p8.[/b] Vincent the Bug is crawling along an octagonal prism. He starts on a fixed vertex $A$, visits all other vertices exactly once by traveling along the edges, and returns to $A$. Find the number of paths Vincent could have taken. [b]p9.[/b] Point $U$ is chosen inside square $ALEX$ so that $\angle AUL = 90^o$. Given that $UL = 56$ and $UE = 65$, what is the sum of all possible values for the area of square $ALEX$? [b]p10.[/b] Miranda has prepared $8$ outfits, no two of which are the same quality. She asks her intern Andrea to order these outfits for the new runway show. Andrea first randomly orders the outfits in a list. She then starts removing outfits according to the following method: she chooses a random outfit which is both immediately preceded and immediately succeeded by a better outfit and then removes it. Andrea repeats this process until there are no outfits that can be removed. Given that the expected number of outfits in the final routine can be written as $\frac{a}{b}$ for some relatively prime positive integers $a$ and $b$, find $a + b$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Yamin and Tamim are playing a game with subsets of $\{1, 2, \ldots, n\}$ where $n \geq 3$. [list] [*] Tamim starts the game with the empty set. [*] On Yamin's turn, he adds a proper non-empty subset of $\{1, 2, \ldots, n\}$ to his collection $F$ of blocked sets. [*] On Tamim's turn, he adds or removes a positive integer less than or equal to $n$ to or from their set but Tamim can never add or remove an element so that his set becomes one of the blocked sets in $F$. [/list] Tamim wins if he can make his set to be $\{1, 2, \ldots, n\}$. Yamin wins if he can stop Tamim from doing so. Yamin goes first and they alternate making their moves. Does Tamim have a winning strategy? [i]Proposed by Ahmed Ittihad Hasib[/i]

In the coordinate plane the points with both coordinates being rational numbers are called rational points. For any positive integer $n$, is there a way to use $n$ colours to colour all rational points, every point is coloured one colour, such that any line segment with both endpoints being rational points contains the rational points of every colour?

Let be a finite set $ A $ of real numbers, and define the sets $ S_{\pm }=\{ x\pm y| x,y\in A \} . $ Show that $ \left| A \right|\cdot\left| S_{-} \right| \le \left| S_{+} \right|^2 . $

Consider an infinite strip, divided into unit squares. A finite number of nuts is placed in some of these squares. In a step, we choose a square $A$ which has more than one nut and take one of them and put it on the square on the right, take another nut (from $A$) and put it on the square on the left. The procedure ends when all squares has at most one nut. Prove that, given the initial configuration, any procedure one takes will end after the same number of steps and with the same final configuration.

Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$. Prove that Sisyphus cannot reach the aim in less than \[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \] turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )

In a fish shop with 28 kinds of fish, there are 28 fish sellers. In every seller, there exists only one type of each fish kind, depending on where it comes, Mediterranean or Black Sea. Each of the $k$ people gets exactly one fish from each seller and exactly one fish of each kind. For any two people, there exists a fish kind which they have different types of it (one Mediterranean, one Black Sea). What is the maximum possible number of $k$?

For which positive integers $n \ge 4$ one can find n points in the plane, no three collinear, such that for each triangle formed with three of the $n$ points which are on the convex hull, exactly one of the $n - 3$ remaining points belongs to its interior.

The numbers from $1$ to $2n$ are arranged in a certain order in the cell of the strip $1 \times 2n$. Let's call a [i]flip[/i] an operation that takes one cell from the left half of the strip and one cell from the right half of the strip, after which it swaps the numbers written in them, but only if the larger of these numbers is located to the left of the smaller one. Prove that if all $n^2$ possible flips are performed in any order, then all numbers from $1$ to $n$ will be written in the left, and all numbers from $n + 1$ up to $2n$ — in the right half of the strip.

Let $n$ be an even positive integer. Show that there is a permutation $\left(x_{1},x_{2},\ldots,x_{n}\right)$ of $\left(1,\,2,\,\ldots,n\right)$ such that for every $i\in\left\{1,\ 2,\ ...,\ n\right\}$, the number $x_{i+1}$ is one of the numbers $2x_{i}$, $2x_{i}-1$, $2x_{i}-n$, $2x_{i}-n-1$. Hereby, we use the cyclic subscript convention, so that $x_{n+1}$ means $x_{1}$.