Chandler the Octopus is at a tentacle party! At this party, there is $1$ creature with $2$ tentacles, $2$ creatures with $3$ tentacles, $3$ creatures with $4$ tentacles, all the way up to $14$ creatures with $15$ tentacles. Each tentacle is distinguishable from all other tentacles. For some $2\le m < n \le 15$, a creature with m tentacles “meets” a creature with n tentacles; “meeting” another creature consists of shaking exactly 1 tentacle with each other. Find the number of ways there are to pick distinct $m < n$ between $2$ and $15$, inclusive, and then to pick a creature with $m$ tentacles to “meet” a selected creature with $n$ tentacles. [i]Proposed by Armaan Tipirneni, Richard Chen, and Denise the Octopus[/i]

$10$ people attended a party. For every $3$ people, there exist at least $2$ people who don’t know each other. Prove that there exist $4$ people who don’t know each other.

Five students $ A, B, C, D, E$ took part in a contest. One prediction was that the contestants would finish in the order $ ABCDE$. This prediction was very poor. In fact, no contestant finished in the position predicted, and no two contestants predicted to finish consecutively actually did so. A second prediction had the contestants finishing in the order $ DAECB$. This prediction was better. Exactly two of the contestants finished in the places predicted, and two disjoint pairs of students predicted to finish consecutively actually did so. Determine the order in which the contestants finished.

John is flipping his favorite bottle, which currently contains $10$ ounces of water. However, his bottle is broken from excessive flipping, so after he performs a flip, one ounce of water leaks out of his bottle. When his bottle contains k ounces of water, he has a $\frac{1}{k+1}$ probability of landing it on its bottom. What is the expected number of number of flips it takes for John’s bottle to land on its bottom ?

Jerry writes down all binary strings of length $10$ without any two consecutive $1$s. How many $1$s does Jerry write?

Let a [i]lattice tetrahedron[/i] denote a tetrahedron whose vertices have integer coordinates. Given a lattice tetrahedron, a [i]move[/i] consists of picking some vertex and moving it parallel to one of the three edges of the face opposite the vertex so that it lands on a different point with integer coordinates. Prove that any two lattice tetrahedra with the same volume can be transformed into each other by a series of moves

Given $n>4$ points in the plane, no three collinear. Prove that there are at least $\frac{(n-3)(n-4)}{2}$ convex quadrilaterals with vertices amongst the $n$ points.

Annie stands at one vertex of a regular hexagon. Every second, she moves independently to one of the two vertices adjacent to her, each with equal probability. Determine the probability that she is at her starting position after ten seconds.

[b]p1.[/b] What is $(2 + 4 + ... + 20) - (1 + 3 + ...+ 19)$? [b]p2.[/b] Two ants start on opposite vertices of a dodecagon ($12$-gon). Each second, they randomly move to an adjacent vertex. What is the probability they meet after four moves? [b]p3.[/b] How many distinct $8$-letter strings can be made using $8$ of the $9$ letters from the words $FORK$ and $KNIFE$ (e.g., $FORKNIFE$)? [b]p4.[/b] Let $ABC$ be an equilateral triangle with side length $8$ and let $D$ be a point on segment $BC$ such that $BD = 2$. Given that $E$ is the midpoint of $AD$, what is the value of $CE^2 - BE^2$? [b][color=#f00](mistyped p4)[/color][/b] Let $ABC$ be an equilateral triangle with side length $8$ and let $D$ be a point on segment $BC$ such that $BD = 2$. Given that $E$ is the midpoint of $AD$, what is the value of $CE^2 + BE^2$? [b]p5.[/b] You have two fair six-sided dice, one labeled $1$ to $6$, and for the other one, each face is labeled $1$, $2$, $3$, or $4$ (not necessarily all numbers are used). Let $p$ be the probability that when the two dice are rolled, the number on the special die is smaller than the number on the normal die. Given that $p = 1/2$, how many distinct combinations of $1$, $2$, $3$, $4$ can appear on the special die? The arrangement of the numbers on the die does not matter. [b]p6.[/b] Let $\omega_1$ and $\omega_2$ be two circles with centers $A$ and $B$ and radii $3$ and $13$, respectively. Suppose $AB = 10$ and that $C$ is the midpoint of $AB$. Let $\ell$ be a line that passes through $C$ and is tangent to $\omega_1$ at $P$. Given that $\ell$ intersects $\omega_2$ at $X$ and $Y$ such that $XP < Y P$, what is $XP$? [b]p7.[/b] Let $f(x)$ be a cubic polynomial. Given that $f(1) = 13$, $f(4) = 19$, $f(7) = 7$, and $f(10) = 13$, find $f(13)$. [b]p8.[/b] For all integers $0 \le n \le 202$ not divisible by seven, define $f(n) = \{\sqrt{7n}\}$. For what value $n$ does $f(n)$ take its minimum value? (Note: $\{x\} = x - \lfloor x \rfloor$, where $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$.) [b]p9.[/b] Let $ABC$ be a triangle with $AB = 14$ and $AC = 25$. Let the incenter of $ABC$ be $I$. Let line $AI$ intersect the circumcircle of $BIC$ at $D$ (different from $I$). Given that line $DC$ is tangent to the circumcircle of $ABC$, find the area of triangle $BCD$. [b]p10.[/b] Evaluate the infinite sum $$\frac{4^2 + 3}{1 \cdot 3 \cdot 5 \cdot 7} +\frac{6^2 + 3}{3 \cdot 5 \cdot 7 \cdot 9}+\frac{8^2 + 3}{5 \cdot 7 \cdot 9 \cdot 11}+ ...$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n\ge 2$ be a positive integer. Fill up a $n\times n$ table with the numbers $1,2,...,n^2$ exactly once each. Two cells are termed adjacent if they have a common edge. It is known that for any two adjacent cells, the numbers they contain differ by at most $n$. Show that there exist a $2\times 2$ square of adjacent cells such that the diagonally opposite pairs sum to the same number.

In a box there are $n$ balls, each colored in one of the following colors: green, red, blue or yellow. It is known that among any $28$ balls in the box at least one is green. Among any $26$ balls at least one is red. Among any $24$ balls at least one is blue. Among any $23$ balls at least one is yellow. Find the largest possible value of the number $n$.

Let $n$ be an integer greater than or equal to $1$. Find, as a function of $n$, the smallest integer $k\ge 2$ such that, among any $k$ real numbers, there are necessarily two of which the difference, in absolute value, is either strictly less than $1 / n$, either strictly greater than $n$.

In some of the $ 1\times1 $ squares of a square garden $ 50\times50 $ we've grown apple, pomegranate and peach trees (At most one tree in each square). We call a $ 1\times1 $ square a [i]room[/i] and call two rooms [i]neighbor[/i] if they have one common side. We know that a pomegranate tree has at least one apple neighbor room and a peach tree has at least one apple neighbor room and one pomegranate neighbor room. We also know that an empty room (a room in which there’s no trees) has at least one apple neighbor room and one pomegranate neighbor room and one peach neighbor room. Prove that the number of empty rooms is not greater than $ 1000. $

Let $m,k$ be positive integers, $k<m$ and $M$ a set with $m$ elements. Prove that the maximal number of subsets $A_1,A_2,\ldots ,A_p$ of $M$ for which $A_i\cap A_j$ has at most $k$ elements, for every $1\le i<j\le p$, equals \[ p_{max}=\binom{m}{0}+\binom{m}{1}+\binom{m}{2}+\ldots+\binom{m}{k+1}\]

Let $G$ be a connected (simple) graph with $n$ vertices and at least $n$ edges. Prove that it is possible to color the vertices of $G$ red and blue, so that the following conditions hold: i. There is at least one vertex of each color, ii. There is an even number of edges connecting a red vertex to a blue vertex, and iii. If all such edges are deleted, one is left with two connected graphs.

Forty-nine students solve a set of 3 problems. The score for each problem is a whole number of points from 0 to 7. Prove that there exist two students $ A$ and $ B$ such that, for each problem, $ A$ will score at least as many points as $ B.$

Positive integers 1 to 9 are written in each square of a $ 3 \times 3 $ table. Let us define an operation as follows: Take an arbitrary row or column and replace these numbers $ a, b, c$ with either non-negative numbers $ a-x, b-x, c+x $ or $ a+x, b-x, c-x$, where $ x $ is a positive number and can vary in each operation. (1) Does there exist a series of operations such that all 9 numbers turn out to be equal from the following initial arrangement a)? b)? \[ a) \begin{array}{ccc} 1 & 2 & 3 \\ 4 & 5 & 6 \\ 7 & 8 & 9 \end{array} )\] \[ b) \begin{array}{ccc} 2 & 8 & 5 \\ 9 & 3 & 4 \\ 6 & 7 & 1 \end{array} )\] (2) Determine the maximum value which all 9 numbers turn out to be equal to after some steps.

Consider a polynomial $P(x) = \prod^9_{j=1}(x+d_j),$ where $d_1, d_2, \ldots d_9$ are nine distinct integers. Prove that there exists an integer $N,$ such that for all integers $x \geq N$ the number $P(x)$ is divisible by a prime number greater than 20. [i]Proposed by Luxembourg[/i]

$10$ students bought some books in a bookstore. It is known that every student bought exactly three kinds of books, and any two of them shared at least one kind of book. Determine, with proof, how many students bought the most popular book at least? (Note: the most popular book means most students bought this kind of book)

Suppose $S=\{1,2,3,...,2017\}$,for every subset $A$ of $S$,define a real number $f(A)\geq 0$ such that: $(1)$ For any $A,B\subset S$,$f(A\cup B)+f(A\cap B)\leq f(A)+f(B)$; $(2)$ For any $A\subset B\subset S$, $f(A)\leq f(B)$; $(3)$ For any $k,j\in S$,$$f(\{1,2,\ldots,k+1\})\geq f(\{1,2,\ldots,k\}\cup \{j\});$$ $(4)$ For the empty set $\varnothing$, $f(\varnothing)=0$. Confirm that for any three-element subset $T$ of $S$,the inequality $$f(T)\leq \frac{27}{19}f(\{1,2,3\})$$ holds.

A set $S$ of four distinct points is given in the plane. It is known that for any point $X\in S$ the remaining points can be denoted by $Y,Z$ and $W$ so that $|XY|=|XZ|+|XW|$ Prove that all four points lie on a line.

a) A certain committee has gathered $40$ times. There were $10$ members on every meeting. Not a single couple has met on the meetings twice. Prove that there were no less then $60$ members in the committee. b) Prove that you can not construct more then $30$ subcommittees of $5$ members from the committee of $25$ members, with no couple of subcommittees having more than one common member.

It is said that a set of three different numbers is an [i]arithmetical set[/i] if one of the three numbers is the average of the other two. Consider the set $A_n = \{1, 2,..., n\}$, where $n $ is a positive integer, $n\ge 3$. a) How many [i]arithmetical sets[/i] are in $A_{10}$? b) Find the smallest $n$, such that the number of [i]arithmetical sets[/i] in $A_n$ is greater than $2004$.

A bag contains $5$ identical blue marbles and $5$ identical green marbles. In how many ways can $5$ marbles from the bag be arranged in a row if each blue marble must be adjacent to at least $1$ green marble?

A finite list of rational numbers is written on a blackboard. In an [i]operation[/i], we choose any two numbers $a$, $b$, erase them, and write down one of the numbers \[ a + b, \; a - b, \; b - a, \; a \times b, \; a/b \text{ (if $b \neq 0$)}, \; b/a \text{ (if $a \neq 0$)}. \] Prove that, for every integer $n > 100$, there are only finitely many integers $k \ge 0$, such that, starting from the list \[ k + 1, \; k + 2, \; \dots, \; k + n, \] it is possible to obtain, after $n - 1$ operations, the value $n!$.