If $x\neq y$ and the sequences $x,a_1,a_2,y$ and $x,b_1,b_2,b_3,y$ each are in arithmetic progression, then $(a_2-a_1)/(b_2-b_1)$ equals $\textbf{(A) }\frac{2}{3}\qquad\textbf{(B) }\frac{3}{4}\qquad\textbf{(C) }1\qquad\textbf{(D) }\frac{4}{3}\qquad \textbf{(E) }\frac{3}{2}$

Consider the sequence $(x_n)_{n\ge 1}$ where $x_1=1,x_2=2011$ and $x_{n+2}=4022x_{n+1}-x_n$ for all $n\in\mathbb{N}$. Prove that $\frac{x_{2012}+1}{2012}$ is a perfect square.

On an infinite (in both directions) strip of squares, indexed by the integers, are placed several stones (more than one may be placed on a single square). We perform a sequence of moves of one of the following types: (a) Remove one stone from each of the squares $n - 1$ and $n$ and place one stone on square $n + 1$. (b) Remove two stones from square $n$ and place one stone on each of the squares $n + 1$, $n - 2$. Prove that any sequence of such moves will lead to a position in which no further moves can be made, and moreover that this position is independent of the sequence of moves. [i]D. Fon-der-Flaas[/i]

Let $p \geq 3$ be a prime and $a_1,a_2,\cdots , a_{p-2}$ be a sequence of positive integers such that for every $k \in \{1,2,\cdots,p-2\}$ neither $a_k$ nor $a_k^k-1$ is divisible by $p$. Prove that product of some of members of this sequence is equivalent to $2$ modulo $p$.

For all positive integers $n$, let $p(n)$ be the number of non-decreasing sequences of positive integers such that for each sequence, the sum of all terms of the sequence is equal to $n$. Prove that \[\dfrac{1+p(1)+p(2) + \dots + p(n-1)}{p(n)} \leq \sqrt {2n}.\]

Starting at $(0,0),$ an object moves in the coordinate plane via a sequence of steps, each of length one. Each step is left, right, up, or down, all four equally likely. Let $p$ be the probability that the object reaches $(2,2)$ in six or fewer steps. Given that $p$ can be written in the form $m/n,$ where $m$ and $n$ are relatively prime positive integers, find $m+n.$

Let a real number $\lambda > 1$ be given and a sequence $(n_k)$ of positive integers such that $\frac{n_{k+1}}{n_k}> \lambda$ for $k = 1, 2,\ldots$ Prove that there exists a positive integer $c$ such that no positive integer $n$ can be represented in more than $c$ ways in the form $n = n_k + n_j$ or $n = n_r - n_s$.

Let $a, b$ be distinct real numbers and $k,m$ be positive integers $k + m = n \ge 3, k \le 2m, m \le 2k$. Consider sequences $x_1,\dots , x_n$ with the following properties: (i) $k$ terms $x_i$, including $x_1$, are equal to $a$; (ii) $m$ terms $x_i$, including $x_n$, are equal to $b$; (iii) no three consecutive terms are equal. Find all possible values of $x_nx_1x_2 + x_1x_2x_3 + \cdots + x_{n-1}x_nx_1$.

[b]p1.[/b] Find the number of ordered triples $(a, b, c)$ satisfying $\bullet$ $a, b, c$ are are single-digit positive integers, and $\bullet$ $a \cdot b + c = a + b \cdot c$. [b]p2.[/b] In their class Introduction to Ladders at Greendale Community College, Jan takes four tests. They realize that their test scores in chronological order form an increasing arithmetic progression with integer terms, and that the average of those scores is an integer greater than or equal to $94$. How many possible combinations of test scores could they have had? (Test scores at Greendale range between $0$ and $100$, inclusive.) [b]p3.[/b] Suppose that $a + \frac{1}{b} = 2$ and $b +\frac{1}{a} = 3$. If$ \frac{a}{b} + \frac{b}{a}$ can be expressed as $\frac{p}{q}$ in simplest terms, find $p + q$. [b]p4.[/b] Suppose that $A$ and $B$ are digits between $1$ and $9$ such that $$0.\overline{ABABAB...}+ B \cdot (0.\overline{AAA...}) = A \cdot (0.\overline{B_1B_1B_1...}) + 1$$ Find the sum of all possible values of $10A + B$. [b]p5.[/b] Let $ABC$ be an isosceles right triangle with $m\angle ABC = 90^o$. Let $D$ and $E$ lie on segments $AC$ and $BC$, respectively, such that triangles $\vartriangle ADB$ and $\vartriangle CDE$ are similar and $DE = EB$. If $\frac{AC}{AD} = 1 +\frac{\sqrt{a}}{b}$ with $a, b$ positive integers and a squarefree, then find $a + b$. [b]p6.[/b] Five bowling pins $P_1$, $P_2$,..., $P_5$ are lined up in a row. Each turn, Jemma picks a pin at random from the standing pins, and throws a bowling ball at that pin; that pin and each pin directly adjacent to it are knocked down. If the expected value of the number of turns Jemma will take to knock down all the pins is a b where a and b are relatively prime, find $a + b$. (Pins $P_i$ and $P_j$ are adjacent if and only if $|i -j| = 1$.) [b]p7.[/b] Let triangle $ABC$ have side lengths $AB = 10$, $BC = 24$, and $AC = 26$. Let $I$ be the incenter of $ABC$. If the maximum possible distance between $I$ and a point on the circumcircle of $ABC$ can be expressed as $a +\sqrt{b}$ for integers $a$ and $b$ with $b$ squarefree, find $a + b$. (The incenter of any triangle $XY Z$ is the intersection of the angle bisectors of $\angle Y XZ$, $\angle XZY$, and $\angle ZY X$.) [b]p8.[/b] How many terms in the expansion of $$(1 + x + x^2 + x^3 +... + x^{2021})(1 + x^2 + x^4 + x^6 + ... + x^{4042})$$ have coefficients equal to $1011$? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]p1.[/b] The case of Mr. Brown, Mr. Potter, and Mr. Smith is investigated. One of them has committed a crime. Everyone of them made two statements. Mr. Brown: I have not done it. Mr. Potter has not done it. Mr. Potter: Mr. Brown has not done it. Mr. Smith has done it. Mr. Smith: I have not done it. Mr. Brown has done it. It is known that one of them told the truth both times, one lied both times, and one told the truth one time and lied one time. Who has committed the crime? [b]p2.[/b] Is it possible to draw in a plane $1000001$ circles of the radius $1$ such that every circle touches exactly three other circles? [b]p3.[/b] Consider a circle of radius $R$ centered at the origin. A particle is “launched” from the $x$-axis at a distance, $d$, from the origin with $0 < d < R$, and at an angle, $\alpha$, with the $x$-axis. The particle is reflected from the boundary of the circle so that the [b]angle of incidence[/b] equals the [b]angle of reflection[/b]. Determine the angle $\alpha$ so that the path of the particle contacts the circle’s interior at exactly eight points. Please note that $\alpha$ should be determined in terms of the qunatities $R$ and $d$. [img]https://cdn.artofproblemsolving.com/attachments/e/3/b8ef9bb8d1b54c263bf2b68d3de60be5b41ad0.png[/img] [b]p4.[/b] Is it possible to find four different real numbers such that the cube of every number equals the square of the sum of the three others? [b]p5. [/b]The Fibonacci sequence $(1, 2, 3, 5, 8, 13, 21, . . .)$ is defined by the following formula: $f_n = f_{n-2} + f_{n-1}$, where $f_1 = 1$, $f_2 = 2$. Prove that any positive integer can be represented as a sum of different members of the Fibonacci sequence. [b]p6.[/b] $10,000$ points are arbitrary chosen inside a square of area $1$ m$^2$ . Does there exist a broken line connecting all these points, the length of which is less than $201$ m$^2? PS. You should use hide for answers.

The symbol $R_k$ stands for an integer whose base-ten representation is a sequence of $k$ ones. For example, $R_3=111$, $R_5=11111$, etc. When $R_{24}$ is divided by $R_4$, the quotient $Q=\frac{R_{24}}{R_4}$ is an integer whose base-ten representation is a sequence containing only ones and zeros. The number of zeros in $Q$ is $ \textbf{(A)}\ 10 \qquad\textbf{(B)}\ 11 \qquad\textbf{(C)}\ 12 \qquad\textbf{(D)}\ 13 \qquad\textbf{(E)}\ 15 $

Define a sequence of integers $a_1, a_2, \dots, a_k$ where every term $a_i \in \{1,2\}$, and let $S$ denote their sum. Another sequence of integers $t_1, t_2,\ldots, t_k$ is defined by \[t_i=\sqrt{a_i(S-a_i)},\] for all $t_i$. Suppose that $\sum_{1 \leq i \leq k} t_i=4000.$ Find the value of $\sum_{1 \leq i \leq k} a^2_i$. [i]Individual #8[/i]

Find the sum of the digits of all numerals in the sequence $1,2,3,4,\cdots ,10000$. $\textbf{(A) }180,001\qquad\textbf{(B) }154,756\qquad\textbf{(C) }45,001\qquad\textbf{(D) }154,755\qquad \textbf{(E) }270,001$

Let $n$ be a positive integer. Find the number of permutations $a_1$, $a_2$, $\dots a_n$ of the sequence $1$, $2$, $\dots$ , $n$ satisfying $$a_1 \le 2a_2\le 3a_3 \le \dots \le na_n$$. Proposed by United Kingdom

Consider sequences $a_1, a_2, a_3,...$ of positive integers. Determine the smallest possible value of $a_{2010}$ if (i) $a_n < a_{n+1}$ for all $n\ge 1$, (ii) $a_i + a_l > a_j + a_k$ for all quadruples $ (i, j, k, l)$ which satisfy $1 \le i < j \le k < l$.

Let be a matrix $ A\in\mathcal{M}_2(\mathbb{R}) $ having the property that the numbers $ \det (A+X) ,\det (A^2+X^2) ,\det (A^3+X^3) $ are (in this order) in geometric progression, for any matrix $ X\in\mathcal{M}_2(\mathbb{R}) . $ Prove that $ A=0. $ [i]Marius Ghergu[/i]