Found problems: 5923
In an increasing infinite sequence of positive integers, every term starting from the $2002$-th term divides the sum of all preceding terms. Prove that every term starting from some term is equal to the sum of all preceding terms.
We create a sequence by setting $a_1 = 2010$ and requiring that $a_n-a_{n-1}\leq n$ and $a_n$ is also divisible by $n$.
Show that $a_{100},a_{101},a_{102},\dots$ form an arithmetic sequence.
Define a sequence $a_i$ as follows: $a_1 = 181$ and for $i \ge 2$, $a_i = a_{i-1}^2-1$ if $a_{i-1}$ is odd and $a_i = a_{i-1}/2$ if $a_{i-1}$ is even. Find the least $i$ such that $a_i = 0$.
(a) Suppose that $x_n~(n\ge0)$ is a sequence of real numbers with the property that $x_0^3+x_1^3+\ldots+x_n^3=(x_0+x_1+\ldots+x_n)^2$ for each $n\in\mathbb N$. Prove that for each $n\in\mathbb N_0$ there exists $m\in\mathbb N_0$ such that $x_0+x_1+\ldots+x_n=\frac{m(m+1)}2$.
(b) For natural numbers $n$ and $p$, we define $S_{n,p}=1^p+2^p+\ldots+n^p$. Find all natural numbers $p$ such that $S_{n,p}$ is a perfect square for each $n\in\mathbb N$.
The sequence $\{a_n\}$ is defined as follows: \begin{align*} a_n = \sqrt{1 + \left(1 + \frac 1n \right)^2} + \sqrt{1 + \left(1 - \frac 1n \right)^2}. \end{align*} What is the value of the expression given below? \begin{align*} \frac{4}{a_1} + \frac{4}{a_2} + \dots + \frac{4}{a_{96}}.\end{align*}
$\textbf{(A)}\ \sqrt{18241} \qquad\textbf{(B)}\ \sqrt{18625} - 1 \qquad\textbf{(C)}\ \sqrt{18625} \qquad\textbf{(D)}\ \sqrt{19013} - 1\qquad\textbf{(E)}\ \sqrt{19013}$
[i]Centered hexagonal numbers[/i] are the numbers of dots used to create hexagonal arrays of dots. The first four centered hexagonal numbers are 1, 7, 19, and 37 as shown below:
[asy]
size(250);defaultpen(linewidth(0.4));
dot(origin^^shift(-12,0)*origin^^shift(-24,0)*origin^^shift(-36,0)*origin);
int i;
for(i=0; i<360; i=i+60) {
dot(1*dir(i)^^2*dir(i)^^3*dir(i));
dot(shift(1/2, sqrt(3)/2)*1*dir(i)^^shift(1/2, sqrt(3)/2)*2*dir(i));
dot(shift(1, sqrt(3))*1*dir(i));
dot(shift(-12,0)*origin+1*dir(i)^^shift(-12,0)*origin+2*dir(i));
dot(shift(-12,0)*origin+sqrt(3)*dir(i+30));
dot(shift(-24,0)*origin+1*dir(i));
}
label("$1$", (-36, -5), S);
label("$7$", (-24, -5), S);
label("$19$", (-12, -5), S);
label("$37$", (0, -5), S);
label("Centered Hexagonal Numbers", (-18,-10), S);[/asy]
Consider an arithmetic sequence 1, $a$, $b$ and a geometric sequence 1,$c$,$d$, where $a$,$b$,$c$, and $d$ are all positive integers and $a+b=c+d$. Prove that each centered hexagonal number is a possible value of $a$, and prove that each possible value of $a$ is a centered hexagonal number.
Suppose that a sequence $(a_n)_{n=1}^{\infty}$ of integers has the following property: For all $n$ large enough (i.e. $n \ge N$ for some $N$ ), $a_n$ equals the number of indices $i$, $1 \le i < n$, such that $a_i + i \ge n$. Find the maximum possible number of integers which occur infinitely many times in the sequence.
A sequence $\left(a_n\right)$ with $a_1 = 1$ satisfies the following recursion: In the decimal expansion of $a_n$ (without trailing zeros) let $k$ be the smallest digest then $a_{n+1} = a_n + 2^k.$ How many digits does $a_{9 \cdot 10^{2010}}$ have in the decimal expansion?
A sequence $\{a_n\}$ is defined such that $a_i=i$ for $i=1,2,3\ldots,2020$ and for $i>2020$, $a_i$ is the average of the previous $2020$ terms. What is the largest integer less than or equal to $\displaystyle\lim_{n\to\infty}a_n$?
[i]2020 CCA Math Bonanza Lightning Round #4.4[/i]
Let $\mathcal{S}$ be a set consisting of $n \ge 3$ positive integers, none of which is a sum of two other distinct members of $\mathcal{S}$. Prove that the elements of $\mathcal{S}$ may be ordered as $a_1, a_2, \dots, a_n$ so that $a_i$ does not divide $a_{i - 1} + a_{i + 1}$ for all $i = 2, 3, \dots, n - 1$.
Let $a_1<a_2$ be two given integers. For any integer $n\ge 3$, let $a_n$ be the smallest integer which is larger than $a_{n-1}$ and can be uniquely represented as $a_i+a_j$, where $1\le i<j\le n-1$. Given that there are only a finite number of even numbers in $\{a_n\}$, prove that the sequence $\{a_{n+1}-a_{n}\}$ is eventually periodic, i.e. that there exist positive integers $T,N$ such that for all integers $n>N$, we have
\[a_{T+n+1}-a_{T+n}=a_{n+1}-a_{n}.\]
[b]p1.[/b] Consider a parallelogram $ABCD$ with sides of length $a$ and $b$, where $a \ne b$. The four points of intersection of the bisectors of the interior angles of the parallelogram form a rectangle $EFGH$. A possible configuration is given below.
Show that $$\frac{Area(ABCD)}{Area(EFGH)}=\frac{2ab}{(a - b)^2}$$
[img]https://cdn.artofproblemsolving.com/attachments/e/a/afaf345f2ef7c8ecf4388918756f0b56ff20ef.png[/img]
[b]p2.[/b] A metal wire of length $4\ell$ inches (where $\ell$ is a positive integer) is used as edges to make a cardboard rectangular box with surface area $32$ square inches and volume $8$ cubic inches. Suppose that the whole wire is used.
(i) Find the dimension of the box if $\ell= 9$, i.e., find the length, the width, and the height of the box without distinguishing the different orders of the numbers. Justify your answer.
(ii) Show that it is impossible to construct such a box if $\ell = 10$.
[b]p3.[/b] A Pythagorean n-tuple is an ordered collection of counting numbers $(x_1, x_2,..., x_{n-1}, x_n)$ satisfying the equation $$x^2_1+ x^2_2+ ...+ x^2_{n-1} = x^2_{n}.$$
For example, $(3, 4, 5)$ is an ordinary Pythagorean $3$-tuple (triple) and $(1, 2, 2, 3)$ is a Pythagorean $4$-tuple.
(a) Given a Pythagorean triple $(a, b, c)$ show that the $4$-tuple $(a^2, ab, bc, c^2)$ is Pythagorean.
(b) Extending part (a) or using any other method, come up with a procedure that generates Pythagorean $5$-tuples from Pythagorean $3$- and/or $4$-tuples. Few numerical examples will not suffice. You have to find a method that will generate infinitely many such $5$-tuples.
(c) Find a procedure to generate Pythagorean $6$-tuples from Pythagorean $3$- and/or $4$- and/or $5$-tuples.
Note. You can assume without proof that there are infinitely many Pythagorean triples.
[b]p4.[/b] Consider the recursive sequence defined by $x_1 = a$, $x_2 = b$ and $$x_{n+2} =\frac{x_{n+1} + x_n - 1}{x_n - 1}, n \ge 1 .$$
We call the pair $(a, b)$ the seed for this sequence. If both $a$ and $b$ are integers, we will call it an integer seed.
(a) Start with the integer seed $(2, 2019)$ and find $x_7$.
(b) Show that there are infinitely many integer seeds for which $x_{2020} = 2020$.
(c) Show that there are no integer seeds for which $x_{2019} = 2019$.
[b]p5.[/b] Suppose there are eight people at a party. Each person has a certain amount of money. The eight people decide to play a game. Let $A_i$, for $i = 1$ to $8$, be the amount of money person $i$ has in his/her pocket at the beginning of the game. A computer picks a person at random. The chosen person is eliminated from the game and their money is put into a pot. Also magically the amount of money in the pockets of the remaining players goes up by the dollar amount in the chosen person's pocket. We continue this process and at the end of the seventh stage emerges a single person and a pot containing $M$ dollars. What is the expected value of $M$? The remaining player gets the pot and the money in his/her pocket. What is the expected value of what he/she takes home?
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Is there a number in the decimal notation of the square which has a sequence of digits "$2018$"?
The infinite sequence $a_1,a_2,a_3,\ldots$ of positive integers is defined as follows: $a_1=1$, and for each $n \ge 2$, $a_n$ is the smallest positive integer, distinct from $a_1,a_2, \ldots , a_{n-1}$ such that:
$$\sqrt{a_n+\sqrt{a_{n-1}+\ldots+\sqrt{a_2+\sqrt{a_1}}}}$$
is an integer. Prove that all positive integers appear on the sequence $a_1,a_2,a_3,\ldots$
Consider the sequence $ a_1\equal{}\frac{3}{2}, a_{n\plus{}1}\equal{}\frac{3a_n^2\plus{}4a_n\minus{}3}{4a_n^2}.$
$ (a)$ Prove that $ 1<a_n$ and $ a_{n\plus{}1}<a_n$ for all $ n$.
$ (b)$ From $ (a)$ it follows that $ \displaystyle\lim_{n\to\infty}a_n$ exists. Find this limit.
$ (c)$ Determine $ \displaystyle\lim_{n\to\infty}a_1a_2a_3...a_n$.
Define a sequence $(a_n)$ by $a_0 =-4 , a_1 =-7$ and $a_{n+2}= 5a_{n+1} -6a_n$ for $n\geq 0.$ Prove that there are infinitely many positive integers $n$ such that $a_n$ is composite.
Two persons, A and B, set up an incantation contest in which they spell incantations (i.e. a finite sequence of letters) alternately. They must obey the following rules:
i) Any incantation can appear no more than once;
ii) Except for the first incantation, any incantation must be obtained by permuting the letters of the last one before it, or deleting one letter from the last incantation before it;
iii)The first person who cannot spell an incantation loses the contest. Answer the following questions:
a) If A says '$STAGEPREIMO$' first, then who will win?
b) Let $M$ be the set of all possible incantations whose lengths (i.e. the numbers of letters in them) are $2009$ and containing only four letters $A,B,C,D$, each of them appearing at least once. Find the first incantation (arranged in dictionary order) in $M$ such that A has a winning strategy by starting with it.
The sequence $a_1, a_2, a_3, ...$ satisfies that $a_1 = 3$, $a_2 = -1$, $a_na_{n-2} +a_{n-1} = 2$ for all $n \ge 3$. Calculate $a_1 + a_2+ ... + a_{99}$.
Let $n$ be a positive integer. Define a chameleon to be any sequence of $3n$ letters, with exactly $n$ occurrences of each of the letters $a, b,$ and $c$. Define a swap to be the transposition of two adjacent letters in a chameleon. Prove that for any chameleon $X$ , there exists a chameleon $Y$ such that $X$ cannot be changed to $Y$ using fewer than $3n^2/2$ swaps.
If $a$ is any number, $\lfloor a \rfloor$ is $a$ rounded down to the nearest integer. For example, $\lfloor \pi \rfloor =$ $3$.
Show that the sequence
$\lfloor \frac{2^{1}}{17} \rfloor$, $\lfloor \frac{2^{2}}{17} \rfloor$, $\lfloor \frac{2^{3}}{17} \rfloor$, $\dots$
contains infinitely many odd numbers.
For real numbers $x,y,z$, $3x,4y,5z$ are geometric series, $\frac{1}{x},\frac{1}{y},\frac{1}{z}$ are arithmetic sequence. Then $\frac{x}{z}+\frac{z}{x}=$________.
Let $a_{1}, \ldots, a_{n}$ be an infinite sequence of strictly positive integers, so that $a_{k} < a_{k+1}$ for any $k.$ Prove that there exists an infinity of terms $ a_{m},$ which can be written like $a_m = x \cdot a_p + y \cdot a_q$ with $x,y$ strictly positive integers and $p \neq q.$
Quadratics $g(x) = ax^2 + bx + c$ and $h(x) = dx^2 + ex + f$ are such that the six roots of $g,h$, and $g - h$ are distinct real numbers (in particular, they are not double roots) forming an arithmetic progression in some order. Determine all possible values of $a/d$.
Given a sequence of real numbers $a_1, a_2, ... , a_n$. Prove that it is possible to choose some of the numbers providing $3$ conditions:
a) not a triple of successive members is chosen,
b) at least one of every triple of successive members is chosen,
c) the absolute value of chosen numbers sum is not less that one sixth part of the initial numbers' absolute values sum.
Consider the sequence $<{a_n}>$ of natural numbers such that
{i} $a_n$ is a square numver for all $n$ ;
(ii) $a_{n+1} - a_n$ is either a prime or a square of a prime for each $n$.
Show that $<a_n>$ is a finite sequence. Determine the longest such sequence.