Given any positive integer $c$, denote $p(c)$ as the largest prime factor of $c$. A sequence $\{a_n\}$ of positive integers satisfies $a_1>1$ and $a_{n+1}=a_n+p(a_n)$ for all $n\ge 1$. Prove that there must exist at least one perfect square in sequence $\{a_n\}$.

Two positive integers $r$ and $k$ are given as is an infinite sequence of positive integers $a_1 \le a_2 \le a_3 \le ..$ such that $\frac{r}{a_r}= k + 1$. Prove that there is a positive integer $t$ such that $\frac{t}{a_t}= k$.

Suppose $(a,b)$ is an ordered pair of integers such that the three numbers $a$, $b$, and $ab$ form an arithmetic progression, in that order. Find the sum of all possible values of $a$. [i]Proposed by Nathan Xiong[/i]

Let $\{U_{n,1},...,U_{n,n}\}_{n=1}^\infty$ be iid rv, uniformly distributed over [0,1] , and for $\alpha\geq 1$ consider the sets $\{[n^\alpha U_{n,1}],...,[n^\alpha U_{n,n}]\}$ , where [·] denotes the whole part. Prove that the elements of the sets $H_n\cap(\cup_{m=n+1}^\infty H_m)$ form an almost surely bounded sequence if and only if $\alpha>3$.

[b]p1.[/b] A robot is at position $0$ on a number line. Each second, it randomly moves either one unit in the positive direction or one unit in the negative direction, with probability $\frac12$ of doing each. Find the probability that after $4$ seconds, the robot has returned to position $0$. [b]p2.[/b] How many positive integers $n \le 20$ are such that the greatest common divisor of $n$ and $20$ is a prime number? [b]p3.[/b] A sequence of points $A_1$, $A_2$, $A_3$, $...$, $A_7$ is shown in the diagram below, with $A_1A_2$ parallel to $A_6A_7$. We have $\angle A_2A_3A_4 = 113^o$, $\angle A_3A_4A_5 = 100^o$, and $\angle A_4A_5A_6 = 122^o$. Find the degree measure of $\angle A_1A_2A_3 + \angle A_5A_6A_7$. [center][img]https://cdn.artofproblemsolving.com/attachments/d/a/75b06a6663b2f4258e35ef0f68fcfbfaa903f7.png[/img][/center] [b]p4.[/b] Compute $$\log_3 \left( \frac{\log_3 3^{3^{3^3}}}{\log_{3^3} 3^{3^3}} \right)$$ [b]p5.[/b] In an $8\times 8$ chessboard, a pawn has been placed on the third column and fourth row, and all the other squares are empty. It is possible to place nine rooks on this board such that no two rooks attack each other. How many ways can this be done? (Recall that a rook can attack any square in its row or column provided all the squares in between are empty.) [b]p6.[/b] Suppose that $a, b$ are positive real numbers with $a > b$ and $ab = 8$. Find the minimum value of $\frac{a^2+b^2}{a-b} $. [b]p7.[/b] A cone of radius $4$ and height $7$ has $A$ as its apex and $B$ as the center of its base. A second cone of radius $3$ and height $7$ has $B$ as its apex and $A$ as the center of its base. What is the volume of the region contained in both cones? [b]p8.[/b] Let $a_1$, $a_2$, $a_3$, $a_4$, $a_5$, $a_6$ be a permutation of the numbers $1$, $2$, $3$, $4$, $5$, $6$. We say $a_i$ is visible if $a_i$ is greater than any number that comes before it; that is, $a_j < a_i$ for all $j < i$. For example, the permutation $2$, $4$, $1$, $3$, $6$, $5$ has three visible elements: $2$, $4$, $6$. How many such permutations have exactly two visible elements? [b]p9.[/b] Let $f(x) = x+2x^2 +3x^3 +4x^4 +5x^5 +6x^6$, and let $S = [f(6)]^5 +[f(10)]^3 +[f(15)]^2$. Compute the remainder when $S$ is divided by $30$. [b]p10.[/b] In triangle $ABC$, the angle bisector from $A$ and the perpendicular bisector of $BC$ meet at point $D$, the angle bisector from $B$ and the perpendicular bisector of $AC$ meet at point $E$, and the perpendicular bisectors of $BC$ and $AC$ meet at point $F$. Given that $\angle ADF = 5^o$, $\angle BEF = 10^o$, and $AC = 3$, find the length of $DF$. [img]https://cdn.artofproblemsolving.com/attachments/6/d/6bb8409678a4c44135d393b9b942f8defb198e.png[/img] [b]p11.[/b] Let $F_0 = 0$, $F_1 = 1$, and $F_n = F_{n-1} + F_{n-2}$. How many subsets $S$ of $\{1, 2,..., 2011\}$ are there such that $$F_{2012} - 1 =\sum_{i \in S}F_i?$$ [b]p12.[/b] Let $a_k$ be the number of perfect squares $m$ such that $k^3 \le m < (k + 1)^3$. For example, $a_2 = 3$ since three squares $m$ satisfy $2^3 \le m < 3^3$, namely $9$, $16$, and $25$. Compute$$ \sum^{99}_{k=0} \lfloor \sqrt{k}\rfloor a_k, $$ where $\lfloor x\rfloor$ denotes the largest integer less than or equal to $x$. [b]p13.[/b] Suppose that $a, b, c, d, e, f$ are real numbers such that $$a + b + c + d + e + f = 0,$$ $$a + 2b + 3c + 4d + 2e + 2f = 0,$$ $$a + 3b + 6c + 9d + 4e + 6f = 0,$$ $$a + 4b + 10c + 16d + 8e + 24f = 0,$$ $$a + 5b + 15c + 25d + 16e + 120f = 42.$$ Compute $a + 6b + 21c + 36d + 32e + 720f.$ [b]p14.[/b] In Cartesian space, three spheres centered at $(-2, 5, 4)$, $(2, 1, 4)$, and $(4, 7, 5)$ are all tangent to the $xy$-plane. The $xy$-plane is one of two planes tangent to all three spheres; the second plane can be written as the equation $ax + by + cz = d$ for some real numbers $a$, $b$, $c$, $d$. Find $\frac{c}{a}$ . [b]p15.[/b] Find the number of pairs of positive integers $a$, $b$, with $a \le 125$ and $b \le 100$, such that $a^b - 1$ is divisible by $125$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given a permutation of $1,2,3,\dots,n$, with consecutive elements $a,b,c$ (in that order), we may perform either of the [i]moves[/i]: [list] [*] If $a$ is the median of $a$, $b$, and $c$, we may replace $a,b,c$ with $b,c,a$ (in that order) [*] If $c$ is the median of $a$, $b$, and $c$, we may replace $a,b,c$ with $c,a,b$ (in that order) [/list] What is the least number of sets in a partition of all $n!$ permutations, such that any two permutations in the same set are obtainable from each other by a sequence of moves? [i]Proposed by Milan Haiman[/i]

Find the number of all infinite sequences $a_1$, $a_2$, ... of positive integers such that $a_n+a_{n+1}=2a_{n+2}a_{n+3}+2005$ for all positive integers $n$.

A sequence $a_0,a_1,a_2,\cdots,a_n,\cdots$ satisfies that $a_0=3$, and $(3-a_{n-1})(6+a_n)=18$, then the value of $\sum_{i=0}^{n}\frac{1}{a_i}$ is________.

Nine quadratics, $x^2+a_1x+b_1, x^2+a_2x+b_2,...,x^2+a_9x+b_9$ are written on the board. The sequences $a_1, a_2,...,a_9$ and $b_1, b_2,...,b_9$ are arithmetic. The sum of all nine quadratics has at least one real root. What is the the greatest possible number of original quadratics that can have no real roots?

The persons $P_1, P_2, . . . , P_{n-1}, P_n$ sit around a table, in this order, and each one of them has a number of coins. In the start, $P_1$ has one coin more than $P_2, P_2$ has one coin more than $P_3$, etc., up to $P_{n-1}$ who has one coin more than $P_n$. Now $P_1$ gives one coin to $P_2$, who in turn gives two coins to $P_3 $ etc., up to $ Pn$ who gives n coins to $ P_1$. Now the process continues in the same way: $P_1$ gives $n+ 1$ coins to $P_2$, $P_2$ gives $n+2$ coins to $P_3$; in this way the transactions go on until someone has not enough coins, i.e. a person no more can give away one coin more than he just received. At the moment when the process comes to an end in this manner, it turns out that there are two neighbours at the table such that one of them has exactly five times as many coins as the other. Determine the number of persons and the number of coins circulating around the table.

For any odd prime $p$ and any integer $n,$ let $d_p (n) \in \{ 0,1, \dots, p-1 \}$ denote the remainder when $n$ is divided by $p.$ We say that $(a_0, a_1, a_2, \dots)$ is a [i]p-sequence[/i], if $a_0$ is a positive integer coprime to $p,$ and $a_{n+1} =a_n + d_p (a_n)$ for $n \geqslant 0.$ (a) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_n >b_n$ for infinitely many $n,$ and $b_n > a_n$ for infinitely many $n?$ (b) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_0 <b_0,$ but $a_n >b_n$ for all $n \geqslant 1?$ [I]United Kingdom[/i]

[b]p1.[/b] There are $5$ weights of masses $1,2,3,5$, and $10$ grams. One of the weights is counterfeit (its weight is different from what is written, it is unknown if the weight is heavier or lighter). How to find the counterfeit weight using simple balance scales only twice? [b]p2.[/b] There are $998$ candies and chocolate bars and $499$ bags. Each bag may contain two items (either two candies, or two chocolate bars, or one candy and one chocolate bar). Ann distributed candies and chocolate bars in such a way that half of the candies share a bag with a chocolate bar. Helen wants to redistribute items in the same bags in such a way that half of the chocolate bars would share a bag with a candy. Is it possible to achieve that? [b]p3.[/b] Insert in sequence $2222222222$ arithmetic operations and brackets to get the number $999$ (For instance, from the sequence $22222$ one can get the number $45$: $22*2+2/2 = 45$). [b]p4.[/b] Put numbers from $15$ to $23$ in a $ 3\times 3$ table in such a way to make all sums of numbers in two neighboring cells distinct (neighboring cells share one common side). [b]p5.[/b] All integers from $1$ to $200$ are colored in white and black colors. Integers $1$ and $200$ are black, $11$ and $20$ are white. Prove that there are two black and two white numbers whose sums are equal. [b]p6.[/b] Show that $38$ is the sum of few positive integers (not necessarily, distinct), the sum of whose reciprocals is equal to $1$. (For instance, $11=6+3+2$, $1/16+1/13+1/12=1$.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A sequence of positive reals $\{ a_n \}$ is defined below. $$a_0 = 1, a_1 = 3, a_{n+2} = \frac{a_{n+1}^2+2}{a_n}$$ Show that for all nonnegative integer $n$, $a_n$ is a positive integer.

In the sequence of the natural (i.e. positive integers) numbers every member from the third equals the absolute value of the difference of the two previous. What is the maximal possible length of such a sequence, if every member is less or equal to $1967$?

Consider the sequence defined recursively by $(x_1,y_1)=(0,0)$, $(x_{n+1},y_{n+1})=\left(\left(1-\frac{2}{n}\right)x_n-\frac{1}{n}y_n+\frac{4}{n},\left(1-\frac{1}{n}\right)y_n-\frac{1}{n}x_n+\frac{3}{n}\right)$. Find $\lim_{n\to \infty}(x_n,y_n)$.

Let $b$ be a positive integer. Grogg writes down a sequence whose first term is $1$. Each term after that is the total number of digits in all the previous terms of the sequence when written in base $b$. For example, if $b = 3$, the sequence starts $1, 1, 2, 3, 5, 7, 9, 12, \dots$. If $b = 2521$, what is the first positive power of $b$ that does not appear in the sequence?