Alice, Bob, and Carol are playing a game. Each turn, one of them says one of the $3$ players' names, chosen from {Alice, Bob, Carol} uniformly at random. Alice goes first, Bob goes second, Carol goes third, and they repeat in that order. Let $E$ be the expected number of names that are have been said when, for the first time, all $3$ names have been said twice. If $E = \tfrac{m}{n}$ for relatively prime positive integers $m$ and $n$, find $m + n$. (Include the last name to be said twice in your count.)

Jake, Jonathan, and Joe are playing a dice game involving polyhedron dice. The dice are as follows: 4 sides, 6 sides, 12 sides, and 20 sides. An n-sided dice has the numbers 1 through n labeled on the sides. Jake starts by selecting a 4-sided die and a 20-sided die. The amount of points that a player gets is the sum of the numbers on the rolled dice. Jonathan then selects a 12-sided die and an 20-sided die. Finally, Joe selects a 20-sided die and a 6-sided die. [list=a] [*]What is the probability that Joe places last? [*]What is the probability that Joe places second? [*]What is the probability that Joe places first? [*]What is the probability that there is a three-way tie? [/list] [i]Proposed by beanielove2[/i]

Lunasa, Merlin, and Lyrica are performing in a concert. Each of them will perform two different solos, and each pair of them will perform a duet, for nine distinct pieces in total. Since the performances are very demanding, no one is allowed to perform in two pieces in a row. In how many different ways can the pieces be arranged in this concert? [i]Proposed by Yannick Yao[/i]

The CMU Kiltie Band is attempting to crash a helicopter via grappling hook. The helicopter starts parallel (angle $0$ degrees) to the ground. Each time the band members pull the hook, they tilt the helicopter forward by either $x$ or $x+1$ degrees, with equal probability, if the helicopter is currently at an angle $x$ degrees with the ground. Causing the helicopter to tilt to $90$ degrees or beyond will crash the helicopter. Find the expected number of times the band must pull the hook in order to crash the helicopter. [i]Proposed by Justin Hsieh[/i]

Square $ABCD$ has side length of $2$. Quarter-circle arcs $BD$ (centered at $C$) and $AC$ (centered at $D$) divide $ABCD$ into four sections. The area of the smallest of the four sections that are formed can be expressed as $a - \frac{b\pi }{c} - \sqrt{d}$. Find abcd, where $a, b, c$ and $d$ are integers, $ \sqrt{d}$ is a written in simplestradical form, and $\frac{b}{c}$ is written in simplest form.

Find one pair of positive integers $a,b$ such that $ab(a+b)$ is not divisible by $7$, but $(a+b)^7-a^7-b^7$ is divisible by $7^7$.

Let $\triangle{ABC}$ be an equilateral triangle. Let $E_{AB}$ be the ellipse with foci $A, B$ passing through $C,$ and in the parallel manner define $E_{BC}, E_{AC}.$ Let $\triangle{GHI}$ be a (nondegenerate) triangle with vertices where two ellipses intersect such that the edges of $\triangle{GHI}$ do not intersect those of $\triangle{ABC}.$ Compute the ratio of the largest sides of $\triangle{GHI}$ and $\triangle{ABC}.$

Let $z\ne0$ be a complex number such that $z^8=\overline z$. What are the possible values of $z^{2001}$?

Find all value of $ n$ for which there are nonzero real numbers $ a, b, c, d$ such that after expanding and collecting similar terms, the polynomial $ (ax \plus{} b)^{100} \minus{} (cx \plus{} d)^{100}$ has exactly $ n$ nonzero coefficients.

For an arbitrary point $M$ inside a given square $ABCD$, let $T_1,T_2,T_3$ be the centroids of triangles $ABM,BCM$, and $DAM$, respectively. Let $OM$ be the circumcenter of triangle $T_1T_2T_3$. Find the locus of points $OM$ when $M$ takes all positions within the interior of the square.

Given are a prime $p$ and a positive integer $a$. Let $q$ be a prime divisor of $\frac{a^{p^3}-1}{a^{p^2}-1}$ and $q\neq p$. Prove that $q\equiv 1 ( \mod p^3)$.

Find the sum of all integer values of $n$ such that the equation $\frac{x}{(yz)^2} + \frac{y}{(zx)^2} + \frac{z}{(xy)^2} = n$ has a solution in positive integers.

Aaron takes a square sheet of paper, with one corner labeled $A$. Point $P$ is chosen at random inside of the square and Aaron folds the paper so that points $A$ and $P$ coincide. He cuts the sheet along the crease and discards the piece containing $A$. Let $p$ be the probability that the remaining piece is a pentagon. Find the integer nearest to $100p$. [i]Proposed by Aaron Lin[/i]

Let two circles $C_1$ and $C_2$ intersect in points $A$ and $B$. The tangent to $C_1$ at $A$ intersects $C_2$ in $P$ and the line $PB$ intersects $C_1$ for the second time in $Q$ (suppose that $Q$ is outside $C_2$). The tangent to $C_2$ from $Q$ intersects $C_1$ and $C_2$ in $C$ and $D$, respectively. (The points $A$ and $D$ lie on different sides of the line $PQ$.) Show that $AD$ is the bisector of $\angle CAP$. [i]Proposed by Iman Maghsoudi[/i]

Find all functions $f:\mathbb {R}^{+} \rightarrow \mathbb{R}^{+}$, such that $$f(af(b)+a)(f(bf(a))+a)=1$$ for any positive reals $a, b$.

Let be given positive reals $a$, $b$, $c$. Prove that: $\frac{a^{3}}{\left(a+b\right)^{3}}+\frac{b^{3}}{\left(b+c\right)^{3}}+\frac{c^{3}}{\left(c+a\right)^{3}}\geq \frac{3}{8}$.

[b]p1.[/b] Compute $x$ such that $2009^{2010} \equiv x$ (mod $2011$) and $0 \le x < 2011$. [b]p2.[/b] Compute the number of "words" that can be formed by rearranging the letters of the word "syzygy" so that the y's are evenly spaced. (The $y$'s are evenly spaced if the number of letters (possibly zero) between the first $y$ and the second $y$ is the same as the number of letters between the second $y$ and the third $y$.) [b]p3.[/b] Let $A$ and $B$ be subsets of the integers, and let $A + B$ be the set containing all sums of the form $a + b$, where $a$ is an element of $A$, and $b$ is an element of $B$. For example, if $A = \{0, 4, 5\}$ and $B =\{-3,-1, 2, 6\}$, then $A + B = \{-3,-1, 1, 2, 3, 4, 6, 7, 10, 11\}$. If $A$ has $1955$ elements and $B$ has $1891$ elements, compute the smallest possible number of elements in $A + B$. [b]p4.[/b] Compute the sum of all integers of the form $p^n$ where $p$ is a prime, $n \ge 3$, and $p^n \le 1000$. [b]p5.[/b] In a season of interhouse athletics at Caltech, each of the eight houses plays each other house in a particular sport. Suppose one of the houses has a $1/3$ chance of beating each other house. If the results of the games are independent, compute the probability that they win at least three games in a row. [b]p6.[/b] A positive integer $n$ is special if there are exactly $2010$ positive integers smaller than $n$ and relatively prime to $n$. Compute the sum of all special numbers. [b]p7.[/b] Eight friends are playing informal games of ultimate frisbee. For each game, they split themselves up into two teams of four. They want to arrange the teams so that, at the end of the day, each pair of players has played at least one game on the same team. Determine the smallest number of games they need to play in order to achieve this. [b]p8.[/b] Compute the number of ways to choose five nonnegative integers $a, b, c, d$, and $e$, such that $a + b + c + d + e = 20$. [b]p9.[/b] Is $23$ a square mod $41$? Is $15$ a square mod $41$? [b]p10.[/b] Let $\phi (n)$ be the number of positive integers less than or equal to $n$ that are relatively prime to $n$. Compute $ \sum_{d|15015} \phi (d)$. [b]p11.[/b] Compute the largest possible volume of an regular tetrahedron contained in a cube with volume $1$. [b]p12.[/b] Compute the number of ways to cover a $4 \times 4$ grid with dominoes. [b]p13.[/b] A collection of points is called mutually equidistant if the distance between any two of them is the same. For example, three mutually equidistant points form an equilateral triangle in the plane, and four mutually equidistant points form a regular tetrahedron in three-dimensional space. Let $A$, $B$, $C$, $D$, and $E$ be five mutually equidistant points in four-dimensional space. Let $P$ be a point such that $AP = BP = CP = DP = EP = 1$. Compute the side length $AB$. [b]p14. [/b]Ten turtles live in a pond shaped like a $10$-gon. Because it's a sunny day, all the turtles are sitting in the sun, one at each vertex of the pond. David decides he wants to scare all the turtles back into the pond. When he startles a turtle, it dives into the pond. Moreover, any turtles on the two neighbouring vertices also dive into the pond. However, if the vertex opposite the startled turtle is empty, then a turtle crawls out of the pond and sits at that vertex. Compute the minimum number of times David needs to startle a turtle so that, by the end, all but one of the turtles are in the pond. [b]p15.[/b] The game hexapawn is played on a $3 \times 3$ chessboard. Each player starts with three pawns on the row nearest him or her. The players take turns moving their pawns. Like in chess, on a player's turn he or she can either $\bullet$ move a pawn forward one space if that square is empty, or $\bullet$ capture an opponent's pawn by moving his or her own pawn diagonally forward one space into the opponent's pawn's square. A player wins when either $\bullet$ he or she moves a pawn into the last row, or $\bullet$ his or her opponent has no legal moves. Eve and Fred are going to play hexapawn. However, they're not very good at it. Each turn, they will pick a legal move at random with equal probability, with one exception: If some move will immediately win the game (by either of the two winning conditions), then he or she will make that move, even if other moves are available. If Eve moves first, compute the probability that she will win. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Does there exist a convex $N$-gon such that all its sides are equal and all vertices belong to the parabola $y = x^2$ for a) $N = 2011$ b) $N = 2012$ ?

A candy store has $100$ pieces of candy to give away. When you get to the store, there are five people in front of you, numbered from $1$ to $5$. The $i$th person in line considers the set of positive integers congruent to $i$ modulo $5$ which are at most the number of pieces of candy remaining. If this set is empty, then they take no candy. Otherwise they pick an element of this set and take that many pieces of candy. For example, the first person in line will pick an integer from the set $\{1,6,\dots,96\}$ and take that many pieces of candy. How many ways can the first five people take their share of candy so that after they are done there are at least $35$ pieces of candy remaining?

Let $n$ be a natural number. Find the number of real roots of the following equation: $1+\frac{x}{1}+\frac{x^2}{2}+...+\frac{x^n}{n}=0$.

Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that $f(yf(x))+f(x-1)=f(x)f(y)$ and $|f(x)|<2022$ for all $0<x<1$.

On sides $AB$ and $AC$ of an acute triangle $\Delta ABC$, with orthocenter $H$ and circumcenter $O$, are given points $P$ and $Q$ respectively such that $APHQ$ is a parallelogram. Prove the following equality: \begin{align*} \frac{PB\cdot PQ}{QA\cdot QO}=2 \end{align*}

Find the least positive integer $m$ such that $105| 9^{(p^2)} -29^p +m$ for all prime numbers $p > 3$.

Fix a sequence $a_1,a_2,a_3\ldots$ of integers satisfying the following condition:for all prime numbers $p$ and all positive integers $k$,we have $a_{pk+1}=pa_k-3a_p+13$.Determine all possible values of $a_{2013}$.

If two real numbers $ x$ and $ y$ satisfy the equation $ \frac{x}{y} \equal{} x \minus{} y$, then: $ \textbf{(A)}\ {x \ge 4}\text{ and }{x \le 0}\qquad \\ \textbf{(B)}\ {y}\text{ can equal }{1}\qquad \\ \textbf{(C)}\ \text{both }{x}\text{ and }{y}\text{ must be irrational}\qquad \\ \textbf{(D)}\ {x}\text{ and }{y}\text{ cannot both be integers}\qquad \\ \textbf{(E)}\ \text{both }{x}\text{ and }{y}\text{ must be rational}$