There are $n$ sticks which have distinct integer length. Suppose that it's possible to form a non-degenerate triangle from any $3$ distinct sticks among them. It's also known that there are sticks of lengths $5$ and $12$ among them. What's the largest possible value of $n$ under such conditions? [i](Proposed by Bogdan Rublov)[/i]

Let $n,k \in \mathbb{Z}^{+}$ with $k \leq n$ and let $S$ be a set containing $n$ distinct real numbers. Let $T$ be a set of all real numbers of the form $x_1 + x_2 + \ldots + x_k$ where $x_1, x_2, \ldots, x_k$ are distinct elements of $S.$ Prove that $T$ contains at least $k(n-k)+1$ distinct elements.

Five girls and five boys randomly sit in ten seats that are equally spaced around a circle. The probability that there is at least one diameter of the circle with two girls sitting on opposite ends of the diameter is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

[u]Round 9[/u] [b]p25.[/b] For how many nonempty subsets of $\{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16\}$ is the sum of the elements divisble by $32$? [b]p26.[/b] America declared independence in $1776$. Take the sum of the cubes of the digits of $1776$ and let that equal $S_1$. Sum the cubes of the digits of $S_1$ to get $S_2$. Repeat this process $1776$ times. What is $S_{1776}$? [b]p27.[/b] Every Golden Grahams box contains a randomly colored toy car, which is one of four colors. What is the expected number of boxes you have to buy in order to obtain one car of each color? [u]Round 10[/u] [b]p28.[/b] Let $B$ be the answer to Question $29$ and $C$ be the answer to Question $30$. What is the sum of the square roots of $B$ and $C$? [b]p29.[/b] Let $A$ be the answer to Question $28$ and $C$ be the answer to Question $30$. What is the sum of the sums of the digits of $A$ and $C$? [b]p30.[/b] Let $A$ be the answer to Question $28$ and $B$ be the answer to Question $29$. What is $A + B$? [u]Round 11[/u] [b]p31.[/b] If $x + \frac{1}{x} = 4$, find $x^6 + \frac{1}{x^6}$. [b]p32.[/b] Given a positive integer $n$ and a prime $p$, there is are unique nonnegative integers $a$ and $b$ such that $n = p^b \cdot a$ and $gcd (a, p) = 1$. Let $v_p(n)$ denote this uniquely determined $a$. Let $S$ denote the set of the first 20 primes. Find $\sum_{ p \in S} v_p \left(1 + \sum^{100}_{i=0} p^i \right)$. [b]p33. [/b] Find the maximum value of n such that $n+ \sqrt{(n - 1) +\sqrt{(n - 2) + ... +\sqrt{1}}} < 49$ (Note: there would be $n - 1$ square roots and $n$ total terms). [u]Round 12[/u] [b]p34.[/b] Give two numbers $a$ and $b$ such that $2015^a < 2015! < 2015^b$. If you are incorrect you get $-5$ points; if you do not answer you get $0$ points; otherwise you get $\max \{20-0.02(|b - a| - 1), 0\}$ points, rounded down to the nearest integer. [b]p35.[/b] Twin primes are prime numbers whose difference is $2$. Let $(a, b)$ be the $91717$-th pair of twin primes, with $a < b$. Let $k = a^b$, and suppose that $j$ is the number of digits in the base $10$ representation of $k$. What is $j^5$? If the correct answer is $n$ and you say $m$, you will receive $\max \left(20 - | \log \left(| \frac{m}{n} |\right), 0 \right)$ points, rounded down to the nearest integer. [b]p36.[/b] Write down any positive integer. Let the sum of the valid submissions (i.e. positive integer submissions) for all teams be $S$. One team will be chosen randomly, according to the following distribution: if your team's submission is $n$, you will be chosen with probability $\frac{n}{S}$ . The amount of points that the chosen team will win is the greatest integer not exceeding $\min \{K, \frac{ 10000}{S} \}$. $K$ is a predetermined secret value. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3157009p28696627]here [/url] and 5-8 [url=https://artofproblemsolving.com/community/c3h3157013p28696685]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[i]A. Akopyan, A. Akopyan, A. Akopyan, I. Bogdanov[/i] A conjurer Arutyun and his assistant Amayak are going to show following super-trick. A circle is drawn on the board in the room. Spectators mark $2007$ points on this circle, after that Amayak removes one of them. Then Arutyun comes to the room and shows a semicircle, to which the removed point belonged. Explain, how Arutyun and Amayak may show this super-trick.

Let $n$ be a positive integer and $\{A,B,C\}$ a partition of $\{1,2,\ldots,3n\}$ such that $|A|=|B|=|C|=n$. Prove that there exist $x \in A$, $y \in B$, $z \in C$ such that one of $x,y,z$ is the sum of the other two.

For a tournament with $8$ vertices, if from any vertex it is impossible to follow a route to return to itself, we call the graph a [i]good[/i] graph. Otherwise, we call it a [i]bad[/i] graph. Prove that $(1)$ there exists a tournament with $8$ vertices such that after changing the orientation of any at most $7$ edges of the tournament, the graph is always a[i]bad[/i] graph; $(2)$ for any tournament with $8$ vertices, one can change the orientation of at most $8$ edges of the tournament to get a [i]good[/i] graph. (A tournament is a complete graph with directed edges.)

Each vertex of a convex polygon has integer coordinates, and no side of this polygon is horizontal or vertical. Prove that the sum of the lengths of the segments of lines of the form $x = m$, $m$ an integer, that lie within the polygon is equal to the sum of the lengths of the segments of lines of the form $y = n$, $n$ an integer, that lie within the polygon. (G Galperin)

$a$ and $b$ are natural numbers such that $b > a > 1$, and $a$ does not divide $b$. The sequence of natural numbers $\{b_n\}_{n=1}^\infty$ satisfies $b_{n + 1} \geq 2b_n \forall n \in \mathbb{N}$. Does there exist a sequence $\{a_n\}_{n=1}^\infty$ of natural numbers such that for all $n \in \mathbb{N}$, $a_{n + 1} - a_n \in \{a, b\}$, and for all $m, l \in \mathbb{N}$ ($m$ may be equal to $l$), $a_m + a_l \not\in \{b_n\}_{n=1}^\infty$?

Do there exist 2021 points with integer coordinates on the plane such that the pairwise distances between them are pairwise distinct consecutive integers?

Let $n,k$ be positive integers, satisfying $n$ is even, $k\geq 2$ and $n>4k.$ There are $n$ points on the circumference of a circle. If the endpoints of $\frac{n}{2}$ chords in a circle that do not intersect with each other are exactly the $n$ points, we call these chords a matching.Determine the maximum of integer $m,$ such that for any matching, there exists $k$ consecutive points, satisfying all the endpoints of at least $m$ chords are in the $k$ points.

Each of the numbers $1, 2, ... , 10$ is colored red or blue. $5$ is red and at least one number is blue. If $m, n$ are different colors and $m+n \le 10$, then $m+n$ is blue. If $m, n$ are different colors and $mn \le 10$, then $mn$ is red. Find all the colors.

A stage course is attended by $n \ge 4$ students. The day before the final exam, each group of three students conspire against another student to throw him/her out of the exam. Prove that there is a student against whom there are at least $\sqrt[3]{(n-1)(n- 2)} $conspirators.

Given an initial integer $ n_0 > 1$, two players, $ {\mathcal A}$ and $ {\mathcal B}$, choose integers $ n_1$, $ n_2$, $ n_3$, $ \ldots$ alternately according to the following rules : [b]I.)[/b] Knowing $ n_{2k}$, $ {\mathcal A}$ chooses any integer $ n_{2k \plus{} 1}$ such that \[ n_{2k} \leq n_{2k \plus{} 1} \leq n_{2k}^2. \] [b]II.)[/b] Knowing $ n_{2k \plus{} 1}$, $ {\mathcal B}$ chooses any integer $ n_{2k \plus{} 2}$ such that \[ \frac {n_{2k \plus{} 1}}{n_{2k \plus{} 2}} \] is a prime raised to a positive integer power. Player $ {\mathcal A}$ wins the game by choosing the number 1990; player $ {\mathcal B}$ wins by choosing the number 1. For which $ n_0$ does : [b]a.)[/b] $ {\mathcal A}$ have a winning strategy? [b]b.)[/b] $ {\mathcal B}$ have a winning strategy? [b]c.)[/b] Neither player have a winning strategy?

Determine the number of sets $A = \{a_1,a_2,...,a_{1000}\}$ of positive integers satisfying $a_1 < a_2 <...< a_{1000} \le 2014$, for which we have that the set $S = \{a_i + a_j | 1 \le i, j \le 1000$ with $i + j \in A\}$ is a subset of $A$.

Let ${A}$ be a finite collection of squares in the coordinate plane such that the vertices of all squares that belong to ${A}$ are ${(m, n), (m + 1, n), (m, n + 1)}$, and ${(m + 1, n + 1)}$ for some integers ${m}$ and ${n}$. Show that there exists a subcollection ${B}$ of ${A}$ such that ${B}$ contains at least ${25 \% }$ of the squares in ${A}$, but no two of the squares in ${B}$ have a common vertex.

Kira has $3$ blocks with the letter $A$, $3$ blocks with the letter $B$, and $3$ blocks with the letter $C$. She puts these $9$ blocks in a sequence. She wants to have as many distinct distances between blocks with the same letter as possible. For example, in the sequence $ABCAABCBC$ the blocks with the letter A have distances $1, 3$, and $4$ between one another, the blocks with the letter $B$ have distances $2, 4$, and $6$ between one another, and the blocks with the letter $C$ have distances $2, 4$, and $6$ between one another. Altogether, we got distances of $1, 2, 3, 4$, and $6$; these are $5$ distinct distances. What is the maximum number of distinct distances that can occur?

Find all ordered pairs of positive integers $(m,n)$ for which there exists a set $C=\{c_1,\ldots,c_k\}$ ($k\ge1$) of colors and an assignment of colors to each of the $mn$ unit squares of a $m\times n$ grid such that for every color $c_i\in C$ and unit square $S$ of color $c_i$, exactly two direct (non-diagonal) neighbors of $S$ have color $c_i$. [i]David Yang.[/i]

Find the smallest real $\alpha$, such that for any convex polygon $P$ with area $1$, there exist a point $M$ in the plane, such that the area of convex hull of $P\cup Q$ is at most $\alpha$, where $Q$ denotes the image of $P$ under central symmetry with respect to $M$.

We are given a supply of $a \times b$ tiles with $a$ and $b$ distinct positive integers. The tiles are to be used to tile a $28 \times 48$ rectangle. Find $a, b$ such that the tile has the smallest possible area and there is only one possible tiling. (If there are two distinct tilings, one of which is a reflection of the other, then we treat that as more than one possible tiling. Similarly for other symmetries.) Find $a, b$ such that the tile has the largest possible area and there is more than one possible tiling.

Let $ a_1,a_2,...,a_n$ is permutaion of $ 1,2,...,n$. For this permutaion call the pair $ (a_i,a_j)$ [i]wrong pair [/i]if $ i<j$ and $ a_i >a_j$.Let [i]number of inversion [/i] is number of [i]wrong pair [/i] of permutation $ a_1,a_2,a_3,..,a_n$. Let $ n \ge 2$ is positive integer. Find the number of permutation of $ 1,2,..,n$ such that its [i]number of inversion [/i]is divisible by $ n$.

Every brick has $5$ holes in a line. The holes can be filled with bolts (fitting in one hole) and braces (fitting into two neighboring holes). No hole may remain free. One puts $n$ of these bricks in a line to form a pattern from left to right. In this line no two braces and no three bolts may be adjacent. How many different such patterns can be produced with $n$ bricks?

Let $m$ be a positive integer, and $A_1, A_2, \ldots, A_m$ (not necessarily different) be $m$ subsets of a finite set $A$. It is known that for any nonempty subset $I$ of $\{1, 2 \ldots, m \}$, \[ \Big| \bigcup_{i \in I} A_i \Big| \ge |I|+1. \] Show that the elements of $A$ can be colored black and white, so that each of $A_1,A_2,\ldots,A_m$ contains both black and white elements.

For a positive integer $n$, consider a square cake which is divided into $n \times n$ pieces with at most one strawberry on each piece. We say that such a cake is [i]delicious[/i] if both diagonals are fully occupied, and each row and each column has an odd number of strawberries. Find all positive integers $n$ such that there is an $n \times n$ delicious cake with exactly $\left\lceil\frac{n^2}{2}\right\rceil$ strawberries on it.

[b](a)[/b] A $2 \times n$-table (with $n > 2$) is filled with numbers so that the sums in all the columns are different. Prove that it is possible to permute the numbers in the table so that the sums in the columns would still be different and the sums in the rows would also be different. [i]($2$ points)[/i] [b](b)[/b] A $100 \times 100$-table is filled with numbers such that the sums in all the columns are different. Is it always possible to permute the numbers in the table so that the sums in the columns would still be different and the sums in the rows would also be different? [i]($6$ points)[/i]