Found problems: 766
For all $n$, $t_{n+1} = 2(t_n)^2 - 1$. Prove that gcd $(t_n,t_m) = 1$ if $n \ne m$.
Let $d$ be a positive integer.
The seqeunce $a_1, a_2, a_3,...$ of positive integers is defined by $a_1 = 1$ and $a_{n + 1} = n\left \lfloor \frac{a_n}{n} \right \rfloor+ d$ for $n = 1,2,3, ...$ .
Prove that there exists a positive integer $N$ so that the terms $a_N,a_{N + 1}, a_{N + 2},...$ form an arithmetic progression.
Note: If $x$ is a real number, $\left \lfloor x \right \rfloor $ denotes the largest integer that is less than or equal to $x$.
Let $x_0 = 5$ and $x_{n+1} = x_n + \frac{1}{x_n} \ (n = 0, 1, 2, \ldots )$. Prove that
\[45 < x_{1000} < 45. 1.\]
There are $n$ people in line, counting $1,2,\cdots, n$ from left to right, those who count odd numbers quit the line, the remaining people press 1,2 from right to left, and count off again, those who count odd numbers quit the line, and then the remaining people count off again from left to right$\cdots$ Keep doing that until only one person is in the line. $f(n)$ is the number of the last person left at the first count. Find the expression for $f(n)$ and find the value of $f(2022)$
A sequence of natural numbers $a_1,a_2,...$ satisfies $a_1 = 1, a_{n+2} = 2a_{n+1} - a_n +2$ for $n \in N$.
Prove that for every natural $n$ there exists a natural $m$ such that $a_na_{n+1} = a_m$.
An integer sequence $\{a_{n}\}_{n \ge 1}$ is defined by \[a_{1}=1, \; a_{n+1}=a_{n}+\lfloor \sqrt{a_{n}}\rfloor.\] Show that $a_{n}$ is a square if and only if $n=2^{k}+k-2$ for some $k \in \mathbb{N}$.
Consider the system \begin{align*}x + y &= z + u,\\2xy & = zu.\end{align*} Find the greatest value of the real constant $m$ such that $m \leq x/y$ for any positive integer solution $(x,y,z,u)$ of the system, with $x \geq y$.
Let $\{a_n\}_{n\geq 1}$ be a sequence with $a_1=1$, $a_2=4$ and for all $n>1$, \[ a_{n} = \sqrt{ a_{n-1}a_{n+1} + 1 } . \]
a) Prove that all the terms of the sequence are positive integers.
b) Prove that $2a_na_{n+1}+1$ is a perfect square for all positive integers $n$.
[i]Valentin Vornicu[/i]
Define a sequence of positive rational numbers $x_0, x_1, x_2, x_3, \cdots$ by $x_0 = 2, x_1 = 3,$ and
for all $n \geq 2,$
$$x_n = \frac{x_{n-1}^2 + 5}{x_{n-2}}$$
(a) Prove that $x_n$ is an integer for all $n \geq 0.$
(b) Prove that if $x_n$ is prime, then either $n = 0$ or $n = 2^k$ for some integer $k \geq 0.$
Let $p$ be an odd prime $p$ such that $2h \neq 1 \; \pmod{p}$ for all $h \in \mathbb{N}$ with $h< p-1$, and let $a$ be an even integer with $a \in] \tfrac{p}{2}, p [$. The sequence $\{a_n\}_{n \ge 0}$ is defined by $a_{0}=a$, $a_{n+1}=p -b_{n}$ \; $(n \ge 0)$, where $b_{n}$ is the greatest odd divisor of $a_n$. Show that the sequence $\{a_n\}_{n \ge 0}$ is periodic and find its minimal (positive) period.
Let $ x_0 \equal{} 1$ and for $ n\ge0,$ let $ x_{n \plus{} 1} \equal{} 3x_n \plus{} \left\lfloor x_n\sqrt {5}\right\rfloor.$ In particular, $ x_1 \equal{} 5,\ x_2 \equal{} 26,\ x_3 \equal{} 136,\ x_4 \equal{} 712.$ Find a closed-form expression for $ x_{2007}.$ ($ \lfloor a\rfloor$ means the largest integer $ \le a.$)
Let $k>1$ be an integer. The sequence $a_1,a_2, \cdots$ is defined as:
$a_1=1, a_2=k$ and for all $n>1$ we have: $a_{n+1}-(k+1)a_n+a_{n-1}=0$
Find all positive integers $n$ such that $a_n$ is a power of $k$.
[i]Proposed by Amirhossein Pooya[/i]
$ c$ is a positive integer. Consider the following recursive sequence: $ a_1\equal{}c, a_{n\plus{}1}\equal{}ca_{n}\plus{}\sqrt{(c^2\minus{}1)(a_n^2\minus{}1)}$, for all $ n \in N$.
Prove that all the terms of the sequence are positive integers.
The sequence of positive integers $a_0, a_1, a_2, . . .$ is defined by $a_0 = 3$ and $$a_{n+1} - a_n = n(a_n - 1)$$ for all $n \ge 0$. Determine all integers $m \ge 2$ for which $gcd (m, a_n) = 1$ for all $n \ge 0$.
Let $A$ be an acute angle such that $\tan A = 2\cos A$. Find the number of positive integers $n$ less than or equal to $1000$ such that $\sec^n A + \tan^n A$ is a positive integer whose units digit is $9$.
A sequence of integers, $\{a_{n}\}_{n \ge 1}$ with $a_{1}>0$, is defined by \[a_{n+1}=\frac{a_{n}}{2}\;\;\; \text{if}\;\; n \equiv 0 \;\; \pmod{4},\] \[a_{n+1}=3 a_{n}+1 \;\;\; \text{if}\;\; n \equiv 1 \; \pmod{4},\] \[a_{n+1}=2 a_{n}-1 \;\;\; \text{if}\;\; n \equiv 2 \; \pmod{4},\] \[a_{n+1}=\frac{a_{n}+1}{4}\;\;\; \text{if}\;\; n \equiv 3 \; \pmod{4}.\] Prove that there is an integer $m$ such that $a_{m}=1$.
Let $a_1, a_2, a_3, . . . , a_n, . . . $ be an infinite sequence of natural numbers in which $a_1$ is not divisible by $5$. Suppose $a_{n+1} = a_n + b_n$ where bn is the last digit of $a_n$, for every $n$. Prove that the sequence $\{a_n\}$ contains infinitely many powers of 2.
Determine whether there exist two reals $x,y$ and a sequence $\{a_n\}_{n=0}^{\infty}$ of nonzero reals such that $a_{n+2}=xa_{n+1}+ya_n$ for all $n\ge0$ and for every positive real number $r$, there exist positive integers $i,j$ such that $|a_i|<r<|a_j|$.
[i]Alex Zhu.[/i]
Define the numbers $a_0, a_1, \ldots, a_n$ in the following way:
\[ a_0 = \frac{1}{2}, \quad a_{k+1} = a_k + \frac{a^2_k}{n} \quad (n > 1, k = 0,1, \ldots, n-1). \]
Prove that \[ 1 - \frac{1}{n} < a_n < 1.\]
A sequence of integers $a_0, a_1 …$ is called [i]kawaii[/i] if $a_0 =0, a_1=1,$ and $$(a_{n+2}-3a_{n+1}+2a_n)(a_{n+2}-4a_{n+1}+3a_n)=0$$ for all integers $n \geq 0$. An integer is called [i]kawaii[/i] if it belongs to some kawaii sequence.
Suppose that two consecutive integers $m$ and $m+1$ are both kawaii (not necessarily belonging to the same kawaii sequence). Prove that $m$ is divisible by $3,$ and that $m/3$ is also kawaii.
The positive integers $a_0, a_1, a_2, \ldots, a_{3030}$ satisfy $$2a_{n + 2} = a_{n + 1} + 4a_n \text{ for } n = 0, 1, 2, \ldots, 3028.$$
Prove that at least one of the numbers $a_0, a_1, a_2, \ldots, a_{3030}$ is divisible by $2^{2020}$.
Define a sequence $\{a_i\}$ by $a_1=3$ and $a_{i+1}=3^{a_i}$ for $i\geq 1$. Which integers between $00$ and $99$ inclusive occur as the last two digits in the decimal expansion of infinitely many $a_i$?
Prove that $(2m)!(2n)!$ is a multiple of $m!n!(m+n)!$ for any non-negative integers $m$ and $n$.
A penny is placed in the coordinate plane $\left(0,0\right)$. The penny can be moved $1$ unit to the right, $1$ unit up, or diagonally $1$ unit to the right and $1$ unit up. How many different ways are there for the penny to get to the point $\left(5,5\right)$?
$\text{(A) }8\qquad\text{(B) }25\qquad\text{(C) }99\qquad\text{(D) }260\qquad\text{(E) }351$
Consider the sequences $(a_n), (b_n)$ defined by
\[a_1=3, \quad b_1=100 , \quad a_{n+1}=3^{a_n} , \quad b_{n+1}=100^{b_n} \]
Find the smallest integer $m$ for which $b_m > a_{100}.$