When two stars are very far apart their gravitational potential energy is zero; when they are separated by a distance $d$ the gravitational potential energy of the system is $U$. If the stars are separated by a distance $2d$ the gravitational potential energy of the system is $ \textbf{(A)}\ U/4\qquad\textbf{(B)}\ U/2 \qquad\textbf{(C)}\ U \qquad\textbf{(D)}\ 2U\qquad\textbf{(E)}\ 4U $

Let $n$ be a positive integer. Define a chameleon to be any sequence of $3n$ letters, with exactly $n$ occurrences of each of the letters $a, b,$ and $c$. Define a swap to be the transposition of two adjacent letters in a chameleon. Prove that for any chameleon $X$ , there exists a chameleon $Y$ such that $X$ cannot be changed to $Y$ using fewer than $3n^2/2$ swaps.

For every positive integer $n$ let $\tau (n)$ denote the number of its positive factors. Determine all $n \in N$ that satisfy the equality $\tau (n) = \frac{n}{3}$

Let $M$ be a positive integer. At a party with 120 people, 30 wear red hats, 40 wear blue hats, and 50 wear green hats. Before the party begins, $M$ pairs of people are friends. (Friendship is mutual.) Suppose also that no two friends wear the same colored hat to the party. During the party, $X$ and $Y$ can become friends if and only if the following two conditions hold: [list] [*] There exists a person $Z$ such that $X$ and $Y$ are both friends with $Z$. (The friendship(s) between $Z,X$ and $Z,Y$ could have been formed during the party.) [*] $X$ and $Y$ are not wearing the same colored hat. [/list] Suppose the party lasts long enough so that all possible friendships are formed. Let $M_1$ be the largest value of $M$ such that regardless of which $M$ pairs of people are friends before the party, there will always be at least one pair of people $X$ and $Y$ with different colored hats who are not friends after the party. Let $M_2$ be the smallest value of $M$ such that regardless of which $M$ pairs of people are friends before the party, every pair of people $X$ and $Y$ with different colored hats are friends after the party. Find $M_1+M_2$. [hide="Clarifications"] [list] [*] The definition of $M_2$ should read, ``Let $M_2$ be the [i]smallest[/i] value of $M$ such that...''. An earlier version of the test read ``largest value of $M$''.[/list][/hide] [i]Victor Wang[/i]

Prove the inequalities \[\frac{u}{v}\le \frac{\sin u}{\sin v}\le \frac{\pi}{2}\times\frac{u}{v},\text{ for }0 \le u < v \le \frac{\pi}{2}\]

Let $ABCD$ be a square with side $20$ and $T_1, T_2, ..., T_{2000}$ are points in $ABCD$ such that no $3$ points in the set $S = \{A, B, C, D, T_1, T_2, ..., T_{2000}\}$ are collinear. Prove that there exists a triangle with vertices in $S$, such that the area is less than $1/10$.

The [i]minimal polynomial[/i] of a complex number $r$ is the unique polynomial with rational coefficients of minimal degree with leading coefficient $1$ that has $r$ as a root. If $f$ is the minimal polynomial of $\cos\frac\pi7$, what is $f(-1)$?

Evaluate $ \int_1^e \frac{\sqrt[3]{x}}{x(\sqrt{x}\plus{}\sqrt[3]{x})}\ dx$.

[b]p1.[/b] Compute $1 + 3 + 6 + 10 + 15 + 21 + 28 + 36 + 45 + 55$. [b]p2.[/b] Given that $a$, $b$, and $c$ are positive integers such that $a+b = 9$ and $bc = 30$, find the minimum possible value of $a + c$. [b]p3.[/b] Points $X$ and $Y$ lie outside regular pentagon $ABCDE$ such that $ABX$ and $DEY$ are equilateral triangles. Find the degree measure of $\angle XCY$ . [b]p4.[/b] Let $N$ be the product of the positive integer divisors of $8!$, including itself. The largest integer power of $2$ that divides $N$ is $2^k$. Compute $k$. [b]p5.[/b] Let $A=(-20, 22)$, $B = (k, 0)$, and $C = (202, 2)$ be points on the coordinate plane. Given that $\angle ABC = 90^o$, find the sum of all possible values of $k$. [b]p6.[/b] Tej is typing a string of $L$s and $O$s that consists of exactly $7$ $L$s and $4$ $O$s. How many different strings can he type that do not contain the substring ‘$LOL$’ anywhere? A substring is a sequence of consecutive letters contained within the original string. [b]p7.[/b] How many ordered triples of integers $(a, b, c)$ satisfy both $a+b-c = 12$ and $a^2+b^2-c^2 = 24$? [b]p8.[/b] For how many three-digit base-$7$ numbers $\overline{ABC}_7$ does $\overline{ABC}_7$ divide $\overline{ABC}_{10}$? (Note: $\overline{ABC}_D$ refers to the number whose digits in base $D$ are, from left to right, $A$, $B$, and $C$; for example, $\overline{123}_4$ equals $27$ in base ten). [b]p9.[/b] Natasha is sitting on one of the $35$ squares of a $5$-by-$7$ grid of squares. Wanda wants to walk through every square on the board exactly once except the one Natasha is on, starting and ending on any $2$ squares she chooses, such that from any square she can only go to an adjacent square (two squares are adjacent if they share an edge). How many squares can Natasha choose to sit on such that Wanda cannot go on her walk? [b]p10.[/b] In triangle $ABC$, $AB = 13$, $BC = 14$, and $CA = 15$. Point $P$ lies inside $ABC$ and points $D,E$, and $F$ lie on sides $BC$, $CA$, and $AB$, respectively, so that $PD \perp BC$, $PE \perp CA$, and $PF \perp AB$. Given that $PD$, $PE$, and $PF$ are all integers, find the sum of all possible distinct values of $PD \cdot PE \cdot PF$. [b]p11.[/b] A palindrome is a positive integer which is the same when read forwards or backwards. Find the sum of the two smallest palindromes that are multiples of $137$. [b]p12.[/b] Let $P(x) = x^2+px+q$ be a quadratic polynomial with positive integer coefficients. Compute the least possible value of p such that 220 divides p and the equation $P(x^3) = P(x)$ has at least four distinct integer solutions. [b]p13.[/b] Everyone at a math club is either a truth-teller, a liar, or a piggybacker. A truth-teller always tells the truth, a liar always lies, and a piggybacker will answer in the style of the previous person who spoke (i.e., if the person before told the truth, they will tell the truth, and if the person before lied, then they will lie). If a piggybacker is the first one to talk, they will randomly either tell the truth or lie. Four seniors in the math club were interviewed and here was their conversation: Neil: There are two liars among us. Lucy: Neil is a piggybacker. Kevin: Excluding me, there are more truth-tellers than liars here. Neil: Actually, there are more liars than truth-tellers if we exclude Kevin. Jacob: One plus one equals three. Define the base-$4$ number $M = \overline{NLKJ}_4$, where each digit is $1$ for a truth-teller, $2$ for a piggybacker, and $3$ for a liar ($N$ corresponds to Neil, $L$ to Lucy, $K$ corresponds to Kevin, and $J$ corresponds to Jacob). What is the sum of all possible values of $M$, expressed in base $10$? [b]p14.[/b] An equilateral triangle of side length $8$ is tiled by $64$ equilateral triangles of unit side length to form a triangular grid. Initially, each triangular cell is either living or dead. The grid evolves over time under the following rule: every minute, if a dead cell is edge-adjacent to at least two living cells, then that cell becomes living, and any living cell remains living. Given that every cell in the grid eventually evolves to be living, what is the minimum possible number of living cells in the initial grid? [b]p15.[/b] In triangle $ABC$, $AB = 7$, $BC = 11$, and $CA = 13$. Let $\Gamma$ be the circumcircle of $ABC$ and let $M$, $N$, and $P$ be the midpoints of minor arcs $BC$ , $CA$, and $AB$ of $\Gamma$, respectively. Given that $K$ denotes the area of $ABC$ and $L$ denotes the area of the intersection of $ABC$ and $MNP$, the ratio $L/K$ can be written as $a/b$ , where $a$ and $b$ are relatively prime positive integers. Compute $a + b$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In each cell of a table $8\times 8$ lives a knight or a liar. By the tradition, the knights always say the truth and the liars always lie. All the inhabitants of the table say the following statement "The number of liars in my column is (strictly) greater than the number of liars in my row". Determine how many possible configurations are compatible with the statement.

Let be a natural number $ n, $ and $ n $ real numbers $ a_1,a_2,\ldots ,a_n . $ Then, $$ \sum_{1\le i<j\le n} \cos\left( a_i-a_j \right)\ge -n/2. $$

Find all the polynomials with real coefficients which satisfy $ (x^2-6x+8)P(x)=(x^2+2x)P(x-2)$ for all $x\in \mathbb{R}$.

Find all the functions $ f :\mathbb{R}\mapsto\mathbb{R} $ with the following property: $ \forall x$ $f(x)= f(x/2) + (x/2)f'(x)$

An equilateral pentagon $AMNPQ$ is inscribed in triangle $ABC$ such that $M\in\overline{AB}$, $Q\in\overline{AC}$, and $N,P\in\overline{BC}$. Let $S$ be the intersection of $\overleftrightarrow{MN}$ and $\overleftrightarrow{PQ}$. Denote by $\ell$ the angle bisector of $\angle MSQ$. Prove that $\overline{OI}$ is parallel to $\ell$, where $O$ is the circumcenter of triangle $ABC$, and $I$ is the incenter of triangle $ABC$.

Let $x$ and $n$ be integers such that $1\le x\le n$. We have $x+1$ separate boxes and $n-x$ identical balls. Define $f(n,x)$ as the number of ways that the $n-x$ balls can be distributed into the $x+1$ boxes. Let $p$ be a prime number. Find the integers $n$ greater than $1$ such that the prime number $p$ is a divisor of $f(n,x)$ for all $x\in\{1,2,\ldots ,n-1\}$.

Let $x,y,z$ be nonnegative positive integers. Prove $\frac{x-y}{xy+2y+1}+\frac{y-z}{zy+2z+1}+\frac{z-x}{xz+2x+1}\ge 0$

There are 20 people at a party. Each person holds some number of coins. Every minute, each person who has at least 19 coins simultaneously gives one coin to every other person at the party. (So, it is possible that $A$ gives $B$ a coin and $B$ gives $A$ a coin at the same time.) Suppose that this process continues indefinitely. That is, for any positive integer $n$, there exists a person who will give away coins during the $n$th minute. What is the smallest number of coins that could be at the party? [i]Proposed by Ray Li[/i]

For how many paths comsisting of a sequence of horizontal and/or vertical line segments, with each segment connecting a pair of adjacent letters in the diagram below, is the word $\textup{OLYMPIADS}$ spelled out as the path is traversed from beginning to end? $\begin{tabular}{ccccccccccccccccc}& & & & & & & & O & & & & & & & &\\ & & & & & & & O & L & O & & & & & & &\\ & & & & & & O & L & Y & L & O & & & & & &\\ & & & & & O & L & Y & M & Y & L & O & & & & &\\ & & & & O & L & Y & M & P & M & Y & L & O & & & &\\ & & & O & L & Y & M & P & I & P & M & Y & L & O & & &\\ & & O & L & Y & M & P & I & A & I & P & M & Y & L & O & &\\ & O & L & Y & M & P & I & A & D & A & I & P & M & Y & L & O &\\ O & L & Y & M & P & I & A & D & S & D & A & I & P & M & Y & L & O \end{tabular}$

Real numbers $a_1,a_2,...,a_{16}$ satisfy the conditions $\sum_{i=1}^{16}a_i = 100$ and $\sum_{i=1}^{16}a_i^2 = 1000$ . What is the greatest possible value of $a_16$?

An isosceles trapezium is called [i]right[/i] if only one pair of its sides are parallel (i.e parallelograms are not right). A dissection of a rectangle into $n$ (can be different shapes) right isosceles trapeziums is called [i]strict[/i] if the union of any $i,(2\leq i \leq n)$ trapeziums in the dissection do not form a right isosceles trapezium. Prove that for any $n, n\geq 9$ there is a strict dissection of a $2017 \times 2018$ rectangle into $n$ right isosceles trapeziums. [i]Proposed by Bojan Basic[/i]

Let $p$ be a prime number. Prove that there exists a prime number $q$ such that for every integer $n$, $n^p -p$ is not divisible by $q$.

Find all positive integers $x, y, z$ such that $2^x + 21^y = z^2$

Let $P(x)$ be a nonconstant polynomial of degree $n$ with rational coefficients which can not be presented as a product of two nonconstant polynomials with rational coefficients. Prove that the number of polynomials $Q(x)$ of degree less than $n$ with rational coefficients such that $P(x)$ divides $P(Q(x))$ a) is finite b) does not exceed $n$.

Consider a computer network consisting of servers and bi-directional communication channels among them. Unfortunately, not all channels operate. Each direction of each channel fails with probability $p$ and operates otherwise. (All of these stochastic events are mutually independent, and $0 \le p \le 1$.) There is a root serve, denoted by $r$. We call the network [i]operational[/i], if all serves can reach $r$ using only operating channels. Note that we do not require $r$ to be able to reach any servers. Show that the probability of the network to be operational does not depend on the choice of $r$. (In other words, for any two distinct root servers $r_1$ and $r_2$, the operational probability is the same.)

Two congruent right circular cones each with base radius $3$ and height $8$ have axes of symmetry that intersect at right angles at a point in the interior of the cones a distance $3$ from the base of each cone. A sphere with radius $r$ lies inside both cones. The maximum possible value for $r^2$ is $\frac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.