Found problems: 766
For each positive integer $n$, find the number of $n$-digit positive integers that satisfy both of the following conditions:
[list]
[*] no two consecutive digits are equal, and
[*] the last digit is a prime.
[/list]
Let $m$ be a positive integer. Define the sequence $\{a_{n}\}_{n \ge 0}$ by \[a_{0}=0, \; a_{1}=m, \; a_{n+1}=m^{2}a_{n}-a_{n-1}.\] Prove that an ordered pair $(a, b)$ of non-negative integers, with $a \le b$, gives a solution to the equation \[\frac{a^{2}+b^{2}}{ab+1}= m^{2}\] if and only if $(a, b)$ is of the form $(a_{n}, a_{n+1})$ for some $n \ge 0$.
The sequences $(a_n),(b_n)$ are defined by $a_0=1,b_0=4$ and for $n\ge 0$
\[a_{n+1}=a_n^{2001}+b_n,\ \ b_{n+1}=b_n^{2001}+a_n\]
Show that $2003$ is not divisor of any of the terms in these two sequences.
The sequence $x_1, x_2, x_3, . . .$ is defined by $x_1 = 2022$ and $x_{n+1}= 7x_n + 5$ for all positive integers $n$. Determine the maximum positive integer $m$ such that $$\frac{x_n(x_n - 1)(x_n - 2) . . . (x_n - m + 1)}{m!}$$ is never a multiple of $7$ for any positive integer $n$.
Anne-Marie has a deck of $16$ cards, each with a distinct positive factor of $2002$ written on it. She shuffles the deck and begins to draw cards from the deck without replacement. She stops when there exists a nonempty subset of the cards in her hand whose numbers multiply to a perfect square. What is the expected number of cards in her hand when she stops?
[i]Proposed by Michael Ren.[/i]
For each positive integer $m> 1$, let $P (m)$ be the product of all prime numbers that divide $m$.
Define the sequence $a_1, a_2, a_3,...$ as followed:
$a_1> 1$ is an arbitrary positive integer,
$a_{n + 1} = a_n + P (a_n)$ for each positive integer $n$.
Prove that there exist positive integers $j$ and $k$ such that $a_j$ is the product of the first $k$ prime numbers.
The Fibonacci numbers are defined by $F_1=1,$ $F_2=1,$ and $F_n=F_{n-1}+F_{n-2}$ for $n\geq 3.$ What is $$\dfrac{F_2}{F_1}+\dfrac{F_4}{F_2}+\dfrac{F_6}{F_3}+\cdots+\dfrac{F_{20}}{F_{10}}?$$
$\textbf{(A) }318 \qquad\textbf{(B) }319\qquad\textbf{(C) }320\qquad\textbf{(D) }321\qquad\textbf{(E) }322$
For a given value $t$, we consider number sequences $a_1, a_2, a_3,...$ such that $a_{n+1} =\frac{a_n + t}{a_n + 1}$ for all $n \ge 1$.
(a) Suppose that $t = 2$. Determine all starting values $a_1 > 0$ such that $\frac43 \le a_n \le \frac32$ holds for all $n \ge 2$.
(b) Suppose that $t = -3$. Investigate whether $a_{2020} = a_1$ for all starting values $a_1$ different from $-1$ and $1$.
Define $a_1 = 1979$ and $a_{n+1} = 9^{a_n}$ for $n = 1,2,3,...$. Determine the last two digits of $a_{1979}$.
Functions $f_0, f_1,f_2,...$ are recursively defined by
$f_0(x) = x$ and $f_{2k+1} (x) = 3^{f_{2k}(x)}$ and $f_{2k+2} = 2^{f_{2k+1}(x)}$, $k = 0,1,2,...$ for all $x \in R$.
Find the greater one of the numbers $f_{10}(1)$ and $f_9(2)$.
Consider the sequence $a(n)$ defined by the following conditions:$$a(1) = 1\,\,\,\, a(n + 1) = a(n) + [\sqrt{a(n)}] \,\,\, , \,\,\,\, n = 1,2,3,...$$ How many perfect squares no greater in value than $1000 000$ will be found among the first terms of the sequence? ( (Note: $[x]$ means the integer part of $x$, that is the greatest integer not greater than $x$.)
(A Andjans)
Let $n \in \mathbb N$ and $A_n$ set of all permutations $(a_1, \ldots, a_n)$ of the set $\{1, 2, \ldots , n\}$ for which
\[k|2(a_1 + \cdots+ a_k), \text{ for all } 1 \leq k \leq n.\]
Find the number of elements of the set $A_n$.
[i]Proposed by Vidan Govedarica, Serbia[/i]
Let $n$ be a positive integer and let $a_1, \ldots, a_{n-1} $ be arbitrary real numbers. Define the sequences $u_0, \ldots, u_n $ and $v_0, \ldots, v_n $ inductively by $u_0 = u_1 = v_0 = v_1 = 1$, and $u_{k+1} = u_k + a_k u_{k-1}$, $v_{k+1} = v_k + a_{n-k} v_{k-1}$ for $k=1, \ldots, n-1.$
Prove that $u_n = v_n.$
Given an integer $ k > 1.$ We call a $ k \minus{}$digits decimal integer $ a_{1}a_{2}\cdots a_{k}$ is $ p \minus{}$monotonic, if for each of integers $ i$ satisfying $ 1\le i\le k \minus{} 1,$ when $ a_{i}$ is an odd number, $ a_{i} > a_{i \plus{} 1};$ when $ a_{i}$ is an even number, $ a_{i}<a_{i \plus{} 1}.$ Find the number of $ p \minus{}$monotonic $ k \minus{}$digits integers.
Some positive integers are initially written on a board, where each $2$ of them are different.
Each time we can do the following moves:
(1) If there are 2 numbers (written in the board) in the form $n, n+1$ we can erase them and write down $n-2$
(2) If there are 2 numbers (written in the board) in the form $n, n+4$ we can erase them and write down $n-1$
After some moves, there might appear negative numbers. Find the maximum value of the integer $c$ such that:
Independetly of the starting numbers, each number which appears in any move is greater or equal to $c$
Let $k$ be a positive integer. Prove that there exists an infinite monotone increasing sequence of integers $\{a_{n}\}_{n \ge 1}$ such that \[a_{n}\; \text{divides}\; a_{n+1}^{2}+k \;\; \text{and}\;\; a_{n+1}\; \text{divides}\; a_{n}^{2}+k\] for all $n \in \mathbb{N}$.
A sequence of integers $\{f(n)\}$ for $n=0,1,2,\ldots$ is defined as follows: $f(0)=0$ and for $n>0$,
$$\begin{matrix}f(n)=&f(n-1)+3,&\text{if }n=0\text{ or }1\pmod6,\\&f(n-1)+1,&\text{if }n=2\text{ or }5\pmod6,\\&f(n-1)+2,&\text{if }n=3\text{ or }4\pmod6.\end{matrix}$$Derive an explicit formula for $f(n)$ when $n\equiv0\pmod6$, showing all necessary details in your derivation.
Find the formula for the general term of the sequence an, for which $a_1 = 1$, $a_2 = 3$, $a_{n+1} = 3a_n-2a_{n-1}$ (you need to express an in terms of $n$).
Let $(a_n)_{n\ge1}$ be a sequence given by
\begin{align*}
a_1 &= 1, \\
a_{2^k+j} &= -a_j\text{ for any } k\ge0,1\le j\le 2^k.
\end{align*}
Show that the sequence is not periodic.
Define $a_0 = 2$ and $a_{n+1} = a^2_n + a_n -1$ for $n \ge 0$. Prove that $a_n$ is coprime to $2n + 1$ for all $n \in N$.
Let $a_n$ be a sequence de fined by some $a_0$ and the recursion $a_{n+1} = a_n + 2 \cdot 3^n$ for $n \ge 0$.
Determine all rational values of $a_0$ such that $a^j_k / a^k_j$ is an integer for all integers $j$ and $k$ with $0 < j < k$.
Determine all sequences $(x_1,x_2,\ldots,x_{2011})$ of positive integers, such that for every positive integer $n$ there exists an integer $a$ with \[\sum^{2011}_{j=1} j x^n_j = a^{n+1} + 1\]
[i]Proposed by Warut Suksompong, Thailand[/i]
Consider a sequence of polynomials such that $P_0(x)=2,P_1(x)=x$ and for all $n\ge1$ \[P_{n+1}(x)+P_{n-1}(x)=xP_n(x).\]
a) Determine the polynomial \[Q_n(x)=P^2_n(x)-xP_n(x)P_{n-1}(x)+P^2_{n-1}(x)\] for $n=1972.$
b) Express the polynomial \[\bigl(P_{n+1}(x)-P_{n-1}(x)\bigr)^2\] in terms of $P_n(x),Q_n(x).$
Let $f_0$ be the function from $\mathbb{Z}^2$ to $\{0,1\}$ such that $f_0(0,0)=1$ and $f_0(x,y)=0$ otherwise. For each positive integer $m$, let $f_m(x,y)$ be the remainder when \[ f_{m-1}(x,y) + \sum_{j=-1}^{1} \sum_{k=-1}^{1} f_{m-1}(x+j,y+k) \] is divided by $2$.
Finally, for each nonnegative integer $n$, let $a_n$ denote the number of pairs $(x,y)$ such that $f_n(x,y) = 1$.
Find a closed form for $a_n$.
[i]Proposed by Bobby Shen[/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.\]