Found problems: 5923
Let $a_1, a_2, \ldots$ be a sequence of real numbers such that $a_1=4$ and $a_2=7$ such that for all integers $n$, $\frac{1}{a_{2n-1}}, \frac{1}{a_{2n}}, \frac{1}{a_{2n+1}}$ forms an arithmetic progression, and $a_{2n}, a_{2n+1}, a_{2n+2}$ forms an arithmetic progression. Find, with proof, the prime factorization of $a_{2019}$.
An array $n \times n$ is given, consisting of $n^2$ unit squares. A pawn is placed arbitrarily on a unit square. A [i]move[/i] of the pawn means a jump from a square of the $k$th column to any square of the $k$th row. Show that there exists a sequence of $n^2$ moves of the pawn so that all the unit squares of the array are visited once and, in the end, the pawn returns to the original position.
Three numbers $a,b,c$, none zero, form an arithmetic progression. Increasing $a$ by $1$ or increasing $c$ by $2$ results in a geometric progression. Then $b$ equals:
$\textbf{(A)}\ 16 \qquad
\textbf{(B)}\ 14 \qquad
\textbf{(C)}\ 12 \qquad
\textbf{(D)}\ 10 \qquad
\textbf{(E)}\ 8$
The squares of an infinite chessboard are numbered $1,2,\ldots $ along a spiral, as shown in the picture. A [i]rightline[/i] is the sequence of the numbers in the squares obtained by starting at one square at going to the right.
a) Prove that exists a rightline without multiples of $3$.
b) Prove that there are infinitely many pairwise disjoint rightlines not containing multiples of $3$.
For integral $m$, let $p(m)$ be the greatest prime divisor of $m.$ By convention, we set $p(\pm 1) = 1$ and $p(0) = \infty.$ Find all polynomials $f$ with integer coefficients such that the sequence
\[ \{p \left( f \left( n^2 \right) \right) - 2n \}_{n \geq 0} \] is bounded above. (In particular, this requires $f \left (n^2 \right ) \neq 0$ for $n \geq 0.$)
Let $k$ be a fixed integer greater than 1, and let ${m=4k^2-5}$. Show that there exist positive integers $a$ and $b$ such that the sequence $(x_n)$ defined by \[x_0=a,\quad x_1=b,\quad x_{n+2}=x_{n+1}+x_n\quad\text{for}\quad n=0,1,2,\dots,\] has all of its terms relatively prime to $m$.
[i]Proposed by Jaroslaw Wroblewski, Poland[/i]
Consider the Fibonacci sequence $1$, $1$, $2$, $3$, $5$, $8$, $13$, ... What are the last three digits (from left to right) of the $2020$th term?
Let $f : R^+ \to R$ be a strictly increasing function such that $f\left(\frac{x+y}{2}\right) < \frac{f(x)+ f(y)}{2}$ for all $x,y > 0$.
Prove that the sequence $a_n = f(n)$ ($n \in N$) does not contain an infinite arithmetic progression.
The sequence of letters [b]TAGC[/b] is written in succession 55 times on a strip, as shown below. The strip is to be cut into segments between letters, leaving strings of letters on each segment, which we call words. For example, a cut after the first G, after the second T, and after the second C would yield the words [b]TAG[/b], [b]CT[/b] and [b]AGC[/b]. At most how many distinct words could be found if the entire strip were cut? Justify your answer.
\[\boxed{\textbf{T A G C T A G C T A G}}\ldots\boxed{\textbf{C T A G C}}\]
Let $f_n$ be $n$th Fibonacci number defined by recurrence $f_{n+1} - f_n - f_{n-1} = 0$, $n \in \mathbb{N}$ and initial conditions $f_0 = 0$, $f_1 = 1$. Prove that for any $n \in \mathbb{N}$ $$(n - 1) (n + 1) (2nf_{n+1} - (n + 6) f_n)$$is divisible by 150 for any $n \in \mathbb{N}$.
The angles of a convex quadrilateral form an arithmetic sequence in clockwise order, and its side lengths also form an arithmetic sequence (but not necessarily in clockwise order). If the quadrilateral is not a square, and its shortest side has length $1$, then its perimeter is $a + \sqrt{b}4$, where $ a$ and $b$ are positive integers. What is the value of $a + b$?
Consider any sequence of real numbers $a_0$, $a_1$, $\cdots$. If, for all pairs of nonnegative integers $(m, s)$, there exists some integer $n \in [m+1, m+2024(s+1)]$ satisfying $a_m+a_{m+1}+\cdots+a_{m+s}=a_n+a_{n+1}+\cdots+a_{n+s}$, say that this sequence has [i]repeating sums[/i]. Is a sequence with repeating sums always eventually periodic?
Given the natural $n$. We shall call [i]word [/i] sequence from $n$ letters of the alphabet, and [i]distance [/i] $\rho(A, B)$ between [i]words [/i] $A=a_1a_2\dots a_n$ and $B=b_1b_2\dots b_n$ , the number of digits in which they differ (that is, the number of such $i$, for which $a_i\ne b_i$). We will say that the [i]word [/i] $C$ [i]lies [/i] between words $A$ and $B$ , if $\rho (A,B)=\rho(A,C)+\rho(C,B)$. What is the largest number of [i]words [/i] you can choose so that among any three, there is a [i]word lying[/i] between the other two?
A sequence $y_1, y_2, \ldots, y_k$ of real numbers is called $\textit{zigzag}$ if $k=1$, or if $y_2-y_1, y_3-y_2, \ldots, y_k-y_{k-1}$ are nonzero and alternate in sign. Let $X_1, X_2, \ldots, X_n$ be chosen independently from the uniform distribution on $[0,1]$. Let $a\left(X_1, X_2, \ldots, X_n\right)$ be the largest value of $k$ for which there exists an increasing sequence of integers $i_1, i_2, \ldots, i_k$ such that $X_{i_1}, X_{i_2}, \ldots X_{i_k}$ is zigzag. Find the expected value of $a\left(X_1, X_2, \ldots, X_n\right)$ for $n \geq 2$.
A sequence of integers is defined as follows: $a_1=1,a_2=2,a_3=3$ and for $n>3$, $$a_n=\textsf{The smallest integer not occurring earlier, which is relatively prime to }a_{n-1}\textsf{ but not relatively prime to }a_{n-2}.$$Prove that every natural number occurs exactly once in this sequence.
[i]M. Ivanov[/i]
Starting from 37, adding 5 before each previous term, forms the following sequence:
\[37,537,5537,55537,555537,...\]
How many prime numbers are there in this sequence?
$a_{n}$ is a sequence of positive integers such that, for every $n\geq 1$, $0<a_{n+1}-a_{n}<\sqrt{a_{n}}$. Prove that for every $x,y\in{R}$ such that $0<x<y<1$ $x< \frac{a_{k}}{a_{m}}<y$ we can find such $k,m\in{Z^{+}}$.
Set $S=\{1,2,\cdots,n\}$. $A$ is an increasing arithmetic sequence (at least two numbers), and all numbers are in $S$. Also, we can't add any number in $S$ to $A$ without changing its tolerance. Find the number of such sequence $A$.
A sequence starts with $2017$ as its first term and each subsequent term is the sum of cubes of the digits in the previous number. What is the $2017$th term of this sequence?
[i]2017 CCA Math Bonanza Individual Round #3[/i]
Let $(a_n)_{n\in \mathbb N}$ be the sequence of integers defined recursively by $a_1 = a_2 = 1, a_{n+2} = 7a_{n+1} - a_n - 2$ for $n \geq 1$. Prove that $a_n$ is a perfect square for every $n.$
Let $d$ be a positive divisor of a positive integer $m$ and $(a_l), (b_l)$ two arithmetic sequences of positive integers. It is given that $gcd(a_i, b_j) = 1$ and $gcd(a_k, b_n) = m$ for some positive integers $i,j,k,$ and $n$. Prove that there exist positive integers $t$ and $s$ such that $gcd(a_t, b_s) = d$.
Consider the sequence of integers $ \left( a_n\right)_{n\ge 0} $ defined as
$$ a_n=\left\{\begin{matrix}n^6-2017, & 7|n\\ \frac{1}{7}\left( n^6-2017\right) , & 7\not | n\end{matrix}\right. . $$
Determine the largest length a string of consecutive terms from this sequence sharing a common divisor greater than $
1 $ may have.
Given a strictly increasing infinite sequence of natural numbers $ a_1, $ $ a_2, $ $ a_3, $ $ \ldots $. It is known that $ a_n \leq n + 2020 $ and the number $ n ^ 3 a_n - 1 $ is divisible by $ a_ {n + 1} $ for all natural numbers $ n $. Prove that $ a_n = n $ for all natural numbers $ n $.
There is a sequence of integers $ a_1, a_2, \ldots, a_{2n+1} $ with the following property: after eliminating any term, the remaining ones can be divided into two groups of $ n $ terms such that the sum of the terms in the first group is equal to the sum words in the second. Prove that all terms of the sequence are equal.
The [b]Collaptz function[/b] is defined as $$C(n) = \begin{cases} 3n - 1 & n\textrm{~odd}, \\ \frac{n}{2} & n\textrm{~even}.\end{cases}$$
We obtain the [b]Collaptz sequence[/b] of a number by repeatedly applying the Collaptz function to that number. For example, the Collaptz sequence of $13$ begins with $13, 38, 19, 56, 28, \cdots$ and so on. Find the sum of the three smallest positive integers $n$ whose Collaptz sequences do not contain $1,$ or in other words, do not [b]collaptzse[/b].
[i]Proposed by Andrew Wu and Jason Wang[/i]