Found problems: 5923
Let a sequence $(a_n)$ satisfy: $a_1=5,a_2=13$ and $a_{n+1}=5a_n-6a_{n-1},\forall n\ge2$
a) Prove that $(a_n, a_{n+1})=1,\forall n\ge1$
b) Prove that: $2^{k+1}|p-1\forall k\in\mathbb{N}$, if p is a prime factor of $a_{2^k}$
Let $n$ be a positive integer. There is a pawn in one of the cells of an $n\times n$ table. The pawn moves from an arbitrary cell of the $k$th column, $k \in \{1,2, \cdots, n \}$, to an arbitrary cell in the $k$th row. Prove that there exists a sequence of $n^{2}$ moves such that the pawn goes through every cell of the table and finishes in the starting cell.
Vitya wrote down $n{}$ different natural numbers in his notebook. For each pair of numbers from the notebook, he wrote out their smallest common multiple on the board. Could it happen for some $n>100$ that $n(n-1)/2$ numbers on the board are (in some order) consecutive terms of a non-constant arithmetic progression?
[i]Proposed by S. Berlov[/i]
A sequence of integers $ a_{1},a_{2},a_{3},\ldots$ is defined as follows: $ a_{1} \equal{} 1$ and for $ n\geq 1$, $ a_{n \plus{} 1}$ is the smallest integer greater than $ a_{n}$ such that $ a_{i} \plus{} a_{j}\neq 3a_{k}$ for any $ i,j$ and $ k$ in $ \{1,2,3,\ldots ,n \plus{} 1\}$, not necessarily distinct. Determine $ a_{1998}$.
The first three terms of an arithmetic progression are $ x \minus{} 1, x \plus{} 1, 2x \plus{} 3,$ in the order shown. The value of $ x$ is:
$ \textbf{(A)}\ \minus{} 2 \qquad \textbf{(B)}\ 0 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ \text{undetermined}$
Let $A(n)$ denote the number of sequences $a_1\ge a_2\ge\cdots{}\ge a_k$ of positive integers for which $a_1+\cdots{}+a_k = n$ and each $a_i +1$ is a power of two $(i = 1,2,\cdots{},k)$. Let $B(n)$ denote the number of sequences $b_1\ge b_2\ge \cdots{}\ge b_m$ of positive integers for which $b_1+\cdots{}+b_m =n$ and each inequality $b_j\ge 2b_{j+1}$ holds $(j=1,2,\cdots{}, m-1)$. Prove that $A(n) = B(n)$ for every positive integer $n$.
[i]Senior Problems Committee of the Australian Mathematical Olympiad Committee[/i]
Each of the $12$ edges of a cube is labeled $0$ or $1$. Two labelings are considered different even if one can be obtained from the other by a sequence of one or more rotations and/or reflections. For how many such labelings is the sum of the labels on the edges of each of the $6$ faces of the cube equal to $2?$
$\textbf{(A) }8\qquad\textbf{(B) }10\qquad\textbf{(C) }12\qquad\textbf{(D) }16\qquad\textbf{(E) }20$
A sequence $x_1, x_2, \ldots$ is defined by $x_1 = 1$ and $x_{2k}=-x_k, x_{2k-1} = (-1)^{k+1}x_k$ for all $k \geq 1.$ Prove that $\forall n \geq 1$ $x_1 + x_2 + \ldots + x_n \geq 0.$
[i]Proposed by Gerhard Wöginger, Austria[/i]
Given a finite sequence of real numbers $a_1,a_2,\dots ,a_n$ ($\ast$), we call a segment $a_k,\dots ,a_{k+l-1}$ of the sequence ($\ast$) a “[i]long[/i]”(Chinese dragon) and $a_k$ “[i]head[/i]” of the “[i]long[/i]” if the arithmetic mean of $a_k,\dots ,a_{k+l-1}$ is greater than $1988$. (especially if a single item $a_m>1988$, we still regard $a_m$ as a “[i]long[/i]”). Suppose that there is at least one “[i]long[/i]” among the sequence ($\ast$), show that the arithmetic mean of all those items of sequence ($\ast$) that could be “[i]head[/i]” of a certain “[i]long[/i]” individually is greater than $1988$.
Given a polynomial $P(x)$ with
a) natural coefficients;
b) integer coefficients;
Let us denote with $a_n$ the sum of the digits of $P(n)$ value. Prove that there is a number encountered in the sequence $a_1, a_2, ... , a_n, ...$ infinite times.
$ a_1, a_2, \cdots, a_n$ is a sequence of real numbers, and $ b_1, b_2, \cdots, b_n$ are real numbers that satisfy the condition $ 1 \ge b_1 \ge b_2 \ge \cdots \ge b_n \ge 0$. Prove that there exists a natural number $ k \le n$ that satisifes $ |a_1b_1 \plus{} a_2b_2 \plus{} \cdots \plus{} a_nb_n| \le |a_1 \plus{} a_2 \plus{} \cdots \plus{} a_k|$
Let $n$ be a positive integer and let $(1+iT)^n=f(T)+ig(T)$ where $i$ is the square root of $-1$, and $f$ and $g$ are polynomials with real coefficients. Show that for any real number $k$ the equation $f(T)+kg(T)=0$ has only real roots.
Does there exist an angle $ \alpha\in(0,\pi/2)$ such that $ \sin\alpha$, $ \cos\alpha$, $ \tan\alpha$ and $ \cot\alpha$, taken in some order, are consecutive terms of an arithmetic progression?
Let $a_0,a_1,a_2,\dots $ be a sequence of real numbers such that $a_0=0, a_1=1,$ and for every $n\geq 2$ there exists $1 \leq k \leq n$ satisfying \[ a_n=\frac{a_{n-1}+\dots + a_{n-k}}{k}. \]Find the maximum possible value of $a_{2018}-a_{2017}$.
[b]8.[/b] Let $(a_n)_{n=1}^{\infty}$ be a sequence of positive numbers and suppose that $\sum_{n=1}^{\infty} a_n^2$ is divergent. Let further $0<\epsilon<\frac{1}{2}$. Show that there exists a sequence $(b_n)_{n=1}^{\infty}$ of positive numbers such that $\sum_{n=1}^{\infty}b_n^2$ is convergent and
$\sum_{n=1}^{N}a_n b_n >(\sum_{n=1}^{N}a_n^2)^{\frac{1}{2}-\epsilon}$
for every positive integer $N$. [b](S. 8)[/b]
A positive integer $m$ is called self-descriptive in base $b$, where $b\ge2$ is an integer, if
i) The representation of $m$ in base $b$ is of the form $(a_0a_1\ldots a_{b-1})_b$ (that is $m=a_0b^{b-1}+a_1b^{b-2}+\ldots+a_{b-2}b+a_{b-1}$, where $0\le a_i\le b-1$ are integers).
ii) $a_i$ is equal to the number of occurences of the number $i$ in the sequence $(a_0a_1\ldots a_{b-1})$.
For example, $(1210)_4$ is self-descriptive in base $4$, because it has four digits and contains one $0$, two $1$s, one $2$ and no $3$s.
Let $a_1 = 1 +\sqrt2$ and for each $n \ge 1$ de ne $a_{n+1} = 2 -\frac{1}{a_n}$. Find the greatest integer less than or equal to the product $a_1a_2a_3 ... a_{200}$.
For $n \in \mathbb{N}$, let $a_n = \int _0 ^{1/\sqrt{n}} | 1 + e^{it} + e^{2it} + \dots + e^{nit} | \ dt$. Determine whether the sequence $(a_n) = a_1, a_2, \dots$ is bounded.
Let $\{u_n\}_{n \ge 1}$ be a sequence of real numbers defined as $u_1 = 1$ and
\[ u_{n+1} = u_n + \frac{1}{u_n} \text{ for all $n \ge 1$.}\]
Prove that $u_n \le \frac{3\sqrt{n}}{2}$ for all $n$.
Show that there is no infinite sequence an of natural numbers such that \[a_{a_n}=a_{n+1}a_{n-1}-a_{n}^2\] for all $n\geq 2$
A [i]string of length $n$[/i] is a sequence of $n$ characters from a specified set. For example, $BCAAB$ is a string of length 5 with characters from the set $\{A,B,C\}$. A [i]substring[/i] of a given string is a string of characters that occur consecutively and in order in the given string. For example, the string $CA$ is a substring of $BCAAB$ but $BA$ is not a substring of $BCAAB$.
[list=a][*]List all strings of length 4 with characters from the set $\{A,B,C\}$ in which both the strings $AB$ and $BA$ occur as substrings. (For example, the string $ABAC$ should appear in your list.)
[*]Determine the number of strings of length 7 with characters from the set $\{A,B,C\}$ in which $CC$ occures as a substring.
[*]Let $f(n)$ be the number of strings of length $n$ with characters from the set $\{A,B,C\}$ such that [list][*]$CC$ occurs as a substring, and[*]if either $AB$ or $BA$ occurs as a substring then there is an occurrence of the substring $CC$ to its left.[/list]
(for example, when $n\;=\;6$, the strings $CCAABC$ and $ACCBBB$ and $CCABCC$ satisfy the requirements, but the strings $BACCAB$ and $ACBBAB$ and $ACBCAC$ do not). Prove that $f(2097)$ is a multiple of $97$.[/list]
Let $a_1,a_2 \cdots a_{2n}$ be an arithmetic progression of positive real numbers with common difference $d$. Let
$(i)$ $\sum_{i=1}^{n}a_{2i-1}^2 =x$
$(ii)$ $\sum _{i=1}^{n}a_{2i}^2=y$
$(iii)$ $a_n+a_{n+1}=z$
Express $d$ in terms of $x,y,z,n$
A binary sequence is constructed as follows. If the sum of the digits of the positive integer $k$ is even, the $k$-th term of the sequence is $0$. Otherwise, it is $1$. Prove that this sequence is not periodic.
Characterize the set of positive integers $n$ such that, for all integers $a$, the sequence $a$, $a^2$, $a^3$, $\cdots$ is periodic modulo $n$.
Gizmo is thinking of a geometric sequence in which the third term is $1215$ and the fifth is $540$. Which of the following could be the eighth term of Gizmo's sequence?
$\text{(A) }-160\qquad\text{(B) }-135.5\qquad\text{(C) }216\qquad\text{(D) }240\qquad\text{(E) }472.5$