The sequence of integers $ a_1 $, $ a_2 $, $ \dots $ is defined as follows: $ a_1 = 1 $ and $ n> 1 $, $ a_ {n + 1} $ is the smallest integer greater than $ a_n $ and such, that $ a_i + a_j \neq 3a_k $ for any $ i, j $ and $ k $ from $ \{1, 2, \dots, n + 1 \} $ are not necessarily different. Define $ a_ {2004} $.

Determine all pairs of prime numbers $p$ and $q$ greater than $1$ and less than $100$, such that the following five numbers: $$p+6,p+10,q+4,q+10,p+q+1,$$ are all prime numbers.

There is a set of $N\geq 3$ points in the plane, such that no three of them are collinear. Three points $A$, $B$, $C$ in the set are said to form a [i]Baltic triangle[/i] if no other point in the set lies on the circumcircle of triangle $ABC$. Assume that there exists at least one Baltic triangle. Show that there exist at least $\displaystyle\frac{N}{3}$ Baltic triangles.

Evaluate \[ \log_{10}(\tan 1^{\circ})+ \log_{10}(\tan 2^{\circ})+ \log_{10}(\tan 3^{\circ})+ \cdots + \log_{10}(\tan 88^{\circ})+\log_{10}(\tan 89^{\circ}). \] $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ \frac{1}{2}\log_{10}(\frac{\sqrt{3}}{2}) \qquad\textbf{(C)}\ \frac{1}{2}\log_{10}2 \qquad\textbf{(D)}\ 1 \qquad\textbf{(E)}\ \text{none of these} $

Let $S(n)$ equal the sum of the digits of positive integer $n$. For example, $S(1507) = 13$. For a particular positive integer $n$, $S(n) = 1274$. Which of the following could be the value of $S(n+1)$? $\textbf{(A)}\ 1 \qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 12\qquad\textbf{(D)}\ 1239\qquad\textbf{(E)}\ 1265$

A $6\times6$ square is given, and a quadratic trinomial with a positive leading coefficient is placed in each of its cells. There are $108$ coefficents in total, and these coefficents are chosen from the set $[-66;47]$, and each coefficient is different from each other. Prove that there exists at least one column such that the polynomial you get by summing the six trinomials in that column has a real root.

Let a triangle $ABC, A_1$ be the midpoint of the segment $[BC], B_1 \in (AC)$ ¸and $C_1 \in (AB)$ such that $[A_1B_1$ is the bisector of the angle $AA_1C$ and $A_1C_1$ is perpendicular to $AB$. Show that the lines $AA_1, BB_1$ and $CC_1$ are concurrent if and only if $ \angle BAC = 90^o$

Prove that the number $$2^{2^k-1}-2^k-1$$is composite (not prime) for all positive integers $k>2$.

Two equal-radii circles with centres $ O_1$ and $ O_2$ intersect each other at $ P$ and $ Q$, $ O$ is the midpoint of the common chord $ PQ$. Two lines $ AB$ and $ CD$ are drawn through $ P$ ( $ AB$ and $ CD$ are not coincide with $ PQ$ ) such that $ A$ and $ C$ lie on circle $ O_1$ and $ B$ and $ D$ lie on circle $ O_2$. $ M$ and $ N$ are the mipoints of segments $ AD$ and $ BC$ respectively. Knowing that $ O_1$ and $ O_2$ are not in the common part of the two circles, and $ M$, $ N$ are not coincide with $ O$. Prove that $ M$, $ N$, $ O$ are collinear.

Find all functions $f:\mathbb{R}\to\mathbb{R}$ which satisfy for all $x$: $(i)$ $f(x)=-f(-x);$ $(ii)$ $f(x+1)=f(x)+1;$ $(iii)$ $f\left( \frac{1}{x}\right)=\frac{1}{x^2}f(x)$ for $x\ne 0$

Let $k$, $n$ be fixed positive integers. In a circular table, there are placed pins numbered successively with the numbers $1, 2 \dots, n$, with $1$ and $n$ neighbors. It is known that pin $1$ is golden and the others are white. Arnaldo and Bernaldo play a game, in which a ring is placed initially on one of the pins and at each step it changes position. The game begins with Bernaldo choosing a starting pin for the ring, and the first step consists of the following: Arnaldo chooses a positive integer $d$ any and Bernaldo moves the ring $d$ pins clockwise or counterclockwise (positions are considered modulo $n$, i.e., pins $x$, $y$ equal if and only if $n$ divides $x-y$). After that, the ring changes its position according to one of the following rules, to be chosen at every step by Arnaldo: [b]Rule 1:[/b] Arnaldo chooses a positive integer $d$ and Bernaldo moves the ring $d$ pins clockwise or counterclockwise. [b]Rule 2:[/b] Arnaldo chooses a direction (clockwise or counterclockwise), and Bernaldo moves the ring in the chosen direction in $d$ or $kd$ pins, where $d$ is the size of the last displacement performed. Arnaldo wins if, after a finite number of steps, the ring is moved to the golden pin. Determine, as a function of $k$, the values of $n$ for which Arnaldo has a strategy that guarantees his victory, no matter how Bernaldo plays.

In a regular square room of side length $2\sqrt{2}$ ft, two cats that can see $2$ feet ahead of them are randomly placed into the four corners such that they do not share the same corner. If the probability that they don't see the mouse, also placed randomly into the room can be expressed as $\frac{a-b\pi}{c},$ where $a,b,c$ are positive integers with a greatest common factor of $1,$ then find $a+b+c.$ [i]Proposed by Ada Tsui[/i]

Any five points are taken inside or on a square with side length $1$. Let $a$ be the [i]smallest[/i] possible number with the property that it is always possible to select one pair of points from these five such that the distance between them is equal to or less than $a$. Then $a$ is: ${{ \textbf{(A)}\ \sqrt{3}/3 \qquad\textbf{(B)}\ \sqrt{2}/2 \qquad\textbf{(C)}\ 2\sqrt{2}/3 \qquad\textbf{(D)}\ 1 }\qquad\textbf{(E)}\ \sqrt{2} } $

This is an ARML Super Relay! I'm sure you know how this works! You start from #1 and #15 and meet in the middle. We are going to require you to solve all $15$ problems, though -- so for the entire task, submit the sum of all the answers, rather than just the answer to #8. Also, uhh, we can't actually find the slip for #1. Sorry about that. Have fun anyways! Problem 2. Let $T = TNYWR$. Find the number of way to distribute $6$ indistinguishable pieces of candy to $T$ hungry (and distinguishable) schoolchildren, such that each child gets at most one piece of candy. Problem 3. Let $T = TNYWR$. If $d$ is the largest proper divisor of $T$, compute $\frac12 d$. Problem 4. Let $T = TNYWR$ and flip $4$ fair coins. Suppose the probability that at most $T$ heads appear is $\frac mn$, where $m$ and $n$ are coprime positive integers. Compute $m+n$. Problem 5. Let $T = TNYWR$. Compute the last digit of $T^T$ in base $10$. Problem 6. Let $T = TNYWR$ and flip $6$ fair coins. Suppose the probability that at most $T$ heads appear is $\frac mn$, where $m$ and $n$ are coprime positive integers. Compute $m+n$. Problem 7. Let $T = TNYWR$. Compute the smallest prime $p$ for which $n^T \not\equiv n \pmod{p}$ for some integer $n$. Problem 8. Let $M$ and $N$ be the two answers received, with $M \le N$. Compute the number of integer quadruples $(w,x,y,z)$ with $w+x+y+z = M \sqrt{wxyz}$ and $1 \le w,x,y,z \le N$. Problem 9. Let $T = TNYWR$. Compute the smallest integer $n$ with $n \ge 2$ such that $n$ is coprime to $T+1$, and there exists positive integers $a$, $b$, $c$ with $a^2+b^2+c^2 = n(ab+bc+ca)$. Problem 10. Let $T = TNYWR$ and flip $10$ fair coins. Suppose the probability that at most $T$ heads appear is $\frac mn$, where $m$ and $n$ are coprime positive integers. Compute $m+n$. Problem 11. Let $T = TNYWR$. Compute the last digit of $T^T$ in base $10$. Problem 12. Let $T = TNYWR$ and flip $12$ fair coins. Suppose the probability that at most $T$ heads appear is $\frac mn$, where $m$ and $n$ are coprime positive integers. Compute $m+n$. Problem 13. Let $T = TNYWR$. If $d$ is the largest proper divisor of $T$, compute $\frac12 d$. Problem 14. Let $T = TNYWR$. Compute the number of way to distribute $6$ indistinguishable pieces of candy to $T$ hungry (and distinguishable) schoolchildren, such that each child gets at most one piece of candy. Also, we can't find the slip for #15, either. We think the SFBA coaches stole it to prevent us from winning the Super Relay, but that's not going to stop us, is it? We have another #15 slip that produces an equivalent answer. Here you go! Problem 15. Let $A$, $B$, $C$ be the answers to #8, #9, #10. Compute $\gcd(A,C) \cdot B$.

Find the second smallest prime factor of $18!+1.$ [i]Proposed by Kaylee Ji[/i]

Find all lists $(x_1, x_2, \ldots, x_{2020})$ of non-negative real numbers such that the following three conditions are all satisfied: [list] [*] $x_1 \le x_2 \le \ldots \le x_{2020}$; [*] $x_{2020} \le x_1 + 1$; [*] there is a permutation $(y_1, y_2, \ldots, y_{2020})$ of $(x_1, x_2, \ldots, x_{2020})$ such that $$\sum_{i = 1}^{2020} ((x_i + 1)(y_i + 1))^2 = 8 \sum_{i = 1}^{2020} x_i^3.$$ [/list] [i]A permutation of a list is a list of the same length, with the same entries, but the entries are allowed to be in any order. For example, $(2, 1, 2)$ is a permutation of $(1, 2, 2)$, and they are both permutations of $(2, 2, 1)$. Note that any list is a permutation of itself.[/i]

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.