Find all number sets $(a,b,c,d)$ s.t. $1 < a \le b \le c \le d$, $a,b,c,d \in \mathbb{N}$, and $a^2+b+c+d$, $a+b^2+c+d$, $a+b+c^2+d$, and $a+b+c+d^2$ are all square numbers. Sum the value of $d$ across all solution set(s).

Let $X=\left\{1,2,3,4\right\}$. Consider a function $f:X\to X$. Let $f^1=f$ and $f^{k+1}=\left(f\circ f^k\right)$ for $k\geq1$. How many functions $f$ satisfy $f^{2014}\left(x\right)=x$ for all $x$ in $X$? $\text{(A) }9\qquad\text{(B) }10\qquad\text{(C) }12\qquad\text{(D) }15\qquad\text{(E) }18$

$E$ is the intersection point of the diagonals of the cyclic quadrilateral, $ABCD, F$ is the intersection point of the lines $AB$ and $CD, M$ is the midpoint of the side $AB$, and $N$ is the midpoint of the side $CD$. The circles circumscribed around the triangles $ABE$ and $ACN$ intersect for the second time at point $K$. Prove that the points $F, K, M$ and $N$ lie on one circle.

Let $\omega_1,\omega_2, . . . ,\omega_k$ be distinct real numbers with a nonzero sum. Prove that there exist integers $n_1, n_2, . . . , n_k$ such that $\sum_{i=1}^k n_i\omega_i>0$, and for any non-identical permutation $\pi$ of $\{1, 2,\dots, k\}$ we have \[\sum_{i=1}^k n_i\omega_{\pi(i)}<0.\]

An integer $n>2$ is called [i]tasty[/i] if for every ordered pair of positive integers $(a,b)$ with $a+b=n,$ at least one of $\frac{a}{b}$ and $\frac{b}{a}$ is a terminating decimal. Do there exist infinitely many tasty integers? [i]Proposed by Vincent Huang[/i]

[b]p1.[/b] Will is distributing his money to three friends. Since he likes some friends more than others, the amount of money he gives each is in the ratio of $5 : 3 : 2$. If the person who received neither the least nor greatest amount of money was given $42$ dollars, how many dollars did Will distribute in all? [b]p2.[/b] Fan, Zhu, and Ming are driving around a circular track. Fan drives $24$ times as fast as Ming and Zhu drives $9$ times as fast as Ming. All three drivers start at the same point on the track and keep driving until Fan and Zhu pass Ming at the same time. During this interval, how many laps have Fan and Zhu driven together? [b]p3.[/b] Mr. DoBa is playing a game with Gunga the Gorilla. They both agree to think of a positive integer from $1$ to $120$, inclusive. Let the sum of their numbers be $n$. Let the remainder of the operation $\frac{n^2}{4}$ be $r$. If $r$ is $0$ or $1$, Mr. DoBa wins. Otherwise, Gunga wins. Let the probability that Mr. DoBa wins a given round of this game be $p$. What is $120p$? [b]p4.[/b] Let S be the set $\{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\}$. How many subsets of $S$ are there such that if $a$ is the number of even numbers in the subset and $b$ is the number of odd numbers in the subset, then $a$ and $b$ are either both odd or both even? By definition, subsets of $S$ are unordered and only contain distinct elements that belong to $S$. [b]p5.[/b] Phillips Academy has five clusters, $WQN$, $WQS$, $PKN$, $FLG$ and $ABB$. The Blue Key heads are going to visit all five clusters in some order, except $WQS$ must be visited before $WQN$. How many total ways can they visit the five clusters? [b]p6.[/b] An astronaut is in a spaceship which is a cube of side length $6$. He can go outside but has to be within a distance of $3$ from the spaceship, as that is the length of the rope that tethers him to the ship. Out of all the possible points he can reach, the surface area of the outer surface can be expressed as $m+n\pi$, where $m$ and $n$ are relatively prime positive integers. What is $m + n$? [b]p7.[/b] Let $ABCD$ be a square and $E$ be a point in its interior such that $CDE$ is an equilateral triangle. The circumcircle of $CDE$ intersects sides $AD$ and $BC$ at $D$, $F$ and $C$, $G$, respectively. If $AB = 30$, the area of $AFGB$ can be expressed as $a-b\sqrt{c}$, where $a$, $b$, and $c$ are positive integers and c is not divisible by the square of any prime. Find $a + b + c$. [b]p8.[/b] Suppose that $x, y, z$ satisfy the equations $$x + y + z = 3$$ $$x^2 + y^2 + z^2 = 3$$ $$x^3 + y^3 + z^3 = 3$$ Let the sum of all possible values of $x$ be $N$. What is $12000N$? [b]p9.[/b] In circle $O$ inscribe triangle $\vartriangle ABC$ so that $AB = 13$, $BC = 14$, and $CA = 15$. Let $D$ be the midpoint of arc $BC$, and let $AD$ intersect $BC$ at $E$. Determine the value of $DE \cdot DA$. [b]p10.[/b] How many ways are there to color the vertices of a regular octagon in $3$ colors such that no two adjacent vertices have the same color? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n\ge 3$ be an integer. Two players, Ana and Beto, play the following game. Ana tags the vertices of a regular $n$- gon with the numbers from $1$ to $n$, in any order she wants. Every vertex must be tagged with a different number. Then, we place a turkey in each of the $n$ vertices. These turkeys are trained for the following. If Beto whistles, each turkey moves to the adjacent vertex with greater tag. If Beto claps, each turkey moves to the adjacent vertex with lower tag. Beto wins if, after some number of whistles and claps, he gets to move all the turkeys to the same vertex. Ana wins if she can tag the vertices so that Beto can't do this. For each $n\ge 3$, determine which player has a winning strategy. [i]Proposed by Victor and Isaías de la Fuente[/i]

Let $ R_1,R_2, \ldots$ be the family of finite sequences of positive integers defined by the following rules: $ R_1 \equal{} (1),$ and if $ R_{n - 1} \equal{} (x_1, \ldots, x_s),$ then \[ R_n \equal{} (1, 2, \ldots, x_1, 1, 2, \ldots, x_2, \ldots, 1, 2, \ldots, x_s, n).\] For example, $ R_2 \equal{} (1, 2),$ $ R_3 \equal{} (1, 1, 2, 3),$ $ R_4 \equal{} (1, 1, 1, 2, 1, 2, 3, 4).$ Prove that if $ n > 1,$ then the $ k$th term from the left in $ R_n$ is equal to 1 if and only if the $ k$th term from the right in $ R_n$ is different from 1.

Show that from any five integers, not necessarily distinct, one can always choose three of these integers whose sum is divisible by 3.

How many integers between $1000$ and $2000$ have all three of the numbers $15$, $20$, and $25$ as factors? $\textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$

Determine the values of the positive integer $n$ for which $$A =\sqrt{\frac{9n - 1}{n + 7}}$$ is rational.

For all real numbers $a$ prove that $3(a^4+a^2+1)\geq (a^2+a+1)^2$

Prove that for any triangle the bisector lies between the median and the height drawn from the same vertex.

Anton has an isosceles right triangle, which he wants to cut into $9$ triangular parts in the way shown in the picture. What is the largest number of the resulting $9$ parts that can be equilateral triangles? A more formal description of partitioning. Let triangle $ABC$ be given. We choose two points on its sides so that they go in the order $AC_1C_2BA_1A_2CB_1B_2$, and no two coincide. In addition, the segments $C_1A_2$, $A_1B_2$ and $B_1C_2$ must intersect at one point. Then the partition is given by segments $C_1A_2$, $A_1B_2$, $B_1C_2$, $A_1C_2$, $B_1A_2$ and $C_1B_2$. [img]https://cdn.artofproblemsolving.com/attachments/0/5/5dd914b987983216342e23460954d46755d351.png[/img]

I roll three special six-sided dice. Each die has faces labeled U, S, M, C, A, or *. The star can represent any of U, S, M, C, A. What is the probability that I can arrange the dice to spell out USA? (For instance, A*U is valid, but UU* is not valid.)

In the multiplication question, the sum of the digits in the four boxes is [img]http://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvNy83L2NmMTU0MzczY2FhMGZhM2FjMjMwZDcwYzhmN2ViZjdmYjM4M2RmLnBuZw==&rn=U2NyZWVuc2hvdCAyMDE3LTAyLTI1IGF0IDUuMzguMjYgUE0ucG5n[/img] $\textbf{(A)}\ 13 \qquad \textbf{(B)}\ 12 \qquad \textbf{(C)}\ 27 \qquad \textbf{(D)}\ 9 \qquad \textbf{(E)}\ 22$

The figure below shows a $90 \times90$ square with each side divided into three equal segments. Some of the endpoints of these segments are connected by straight lines. Find the area of the shaded region. [asy] import graph; size(6cm); real labelscalefactor = 0.5; pen dotstyle = black; draw((-4,6)--(86,6)--(86,96)--(-4,96)--cycle); filldraw((16,76)--(-4,36)--(32,60)--(56,96)--cycle,grey); filldraw((32,60)--(-4,6)--(50,42)--(86,96)--cycle,grey); filldraw((50,42)--(26,6)--(66,26)--(86,66)--cycle,grey); draw((-4,6)--(26,6)); draw((26,6)--(56,6)); draw((56,6)--(86,6)); draw((-4,6)--(86,6)); draw((86,6)--(86,96)); draw((86,96)--(-4,96)); draw((-4,96)--(-4,6)); draw((26,96)--(-4,36)); draw((56,96)--(-4,6)); draw((86,96)--(26,6)); draw((86,66)--(56,6)); draw((-4,66)--(56,96)); draw((-4,36)--(86,96)); draw((-4,6)--(86,66)); draw((26,6)--(86,36)); draw((16,76)--(-4,36)); draw((-4,36)--(32,60)); draw((32,60)--(56,96)); draw((56,96)--(16,76)); draw((32,60)--(-4,6)); draw((-4,6)--(50,42)); draw((50,42)--(86,96)); draw((86,96)--(32,60)); draw((50,42)--(26,6)); draw((26,6)--(66,26)); draw((66,26)--(86,66)); draw((86,66)--(50,42)); dot((-4,96),dotstyle); dot((26,96),dotstyle); dot((56,96),dotstyle); dot((86,96),dotstyle); dot((-4,6),dotstyle); dot((-4,36),dotstyle); dot((-4,66),dotstyle); dot((27.09,6),dotstyle); dot((56,6),dotstyle); dot((86,36),dotstyle); dot((86,66),dotstyle); dot((86,6),dotstyle); [/asy]

In the following expression, Melanie changed some of the plus signs to minus signs: $$ 1 + 3+5+7+\cdots+97+99$$ When the new expression was evaluated, it was negative. What is the least number of plus signs that Melanie could have changed to minus signs? $ \textbf{(A) }14 \qquad \textbf{(B) }15 \qquad \textbf{(C) }16 \qquad \textbf{(D) }17 \qquad \textbf{(E) }18 \qquad $

Seongcheol has $3$ red shirts and $2$ green shirts, such that he cannot tell the difference between his three red shirts and he similarly cannot tell the difference between his two green shirts. In how many ways can he hang them in a row in his closet, given that he does not want the two green shirts next to each other?

If $15$ and $9$ are lengths of two medians of a triangle, what is the maximum possible area of the triangle to the nearest integer ?

Find all polynomials $P$ with real coefficients having no repeated roots, such that for any complex number $z$, the equation $zP(z) = 1$ holds if and only if $P(z-1)P(z + 1) = 0$. Remark: Remember that the roots of a polynomial are not necessarily real numbers.

Define a sequence $a_n$ satisfying : \[a_1=1,\ \ a_{n+1}=\frac{na_n}{2+n(a_n+1)}\ (n=1,\ 2,\ 3,\ \cdots).\] Find $\lim_{m\to\infty} m\sum_{n=m+1}^{2m} a_n.$

In some cells of the table $2025 \times 2025$ crosses are placed. A set of 2025 cells we will call balanced if no two of them are in the same row or column. It is known that any balanced set has at least $k$ crosses. Find the minimal $k$ for which it is always possible to color crosses in two colors such that any balanced set has crosses of both colors. [i]M. Karpuk[/i]

Diameter $ \overline{AB}$ of a circle with center $ O$ is $ 10$ units. $ C$ is a point $ 4$ units from $ A$, and on $ \overline{AB}$. $ D$ is a point $ 4$ units from $ B$, and on $ \overline{AB}$. $ P$ is any point on the circle. Then the broken-line path from $ C$ to $ P$ to $ D$: $ \textbf{(A)}\ \text{has the same length for all positions of }{P}\qquad\\ \textbf{(B)}\ \text{exceeds }{10}\text{ units for all positions of }{P}\qquad \\ \textbf{(C)}\ \text{cannot exceed }{10}\text{ units}\qquad \\ \textbf{(D)}\ \text{is shortest when }{\triangle CPD}\text{ is a right triangle}\qquad \\ \textbf{(E)}\ \text{is longest when }{P}\text{ is equidistant from }{C}\text{ and }{D}.$

Can a paper circle be cut into pieces and then rearranged into a square of the same area, if only a finite number of cuts is allowed and they must be along segments of straight lines or circular arcs? (A Belov)