Found problems: 5923
There is infinite sequence of composite numbers $a_1,a_2,...,$ where $a_{n+1}=a_n-p_n+\frac{a_n}{p_n}$ ; $p_n$ is smallest prime divisor of $a_n$. It is known, that $37|a_n$ for every $n$.
Find possible values of $a_1$
Let $k$ and $n$ be positive integers. A sequence $\left( A_1, \dots , A_k \right)$ of $n\times n$ real matrices is [i]preferred[/i] by Ivan the Confessor if $A_i^2\neq 0$ for $1\le i\le k$, but $A_iA_j=0$ for $1\le i$, $j\le k$ with $i\neq j$. Show that $k\le n$ in all preferred sequences, and give an example of a preferred sequence with $k=n$ for each $n$.
(Proposed by Fedor Petrov, St. Petersburg State University)
The function $f(x)=x^5-20x^4+ax^3+bx^2+cx+24$ has the interesting property that its roots can be arranged to form an arithmetic sequence. Determine $f(8)$.
The first four terms of an arithmetic sequence are $ p,9,3p\minus{}q,$ and $ 3p\plus{}q$. What is the $ 2010^{\text{th}}$ term of the sequence?
$ \textbf{(A)}\ 8041\qquad \textbf{(B)}\ 8043\qquad \textbf{(C)}\ 8045\qquad \textbf{(D)}\ 8047\qquad \textbf{(E)}\ 8049$
For any positive integer $ x$ define $ g(x)$ as greatest odd divisor of $ x,$ and
\[ f(x) \equal{} \begin{cases} \frac {x}{2} \plus{} \frac {x}{g(x)} & \text{if \ \(x\) is even}, \\
2^{\frac {x \plus{} 1}{2}} & \text{if \ \(x\) is odd}. \end{cases}
\]
Construct the sequence $ x_1 \equal{} 1, x_{n \plus{} 1} \equal{} f(x_n).$ Show that the number 1992 appears in this sequence, determine the least $ n$ such that $ x_n \equal{} 1992,$ and determine whether $ n$ is unique.
For positive integer n, define $a_n$ as the number of the triangles with integer length of every side and the length of the longest side being $2n.$
(1) Find $a_n$ in terms of $n;$
(2)If the sequence $\{ b_n\}$ satisfying for any positive integer $n,$ $\sum_{k=1}^n(-1)^{n-k}\binom {n}{k} b_k=a_n.$ Find the number of positive integer $n$ satisfying that $b_n\leq 2019a_n.$
An infinite sequence of numbers $a, b, c, d,...$ is obtained by term-by-term addition of two geometric progressions. Can this sequence begin with the following numbers:.
a) $1,1,3,5$ ?
b) $1,2,3,5$ ?
c) $1,2,3, 4$ ?
An infinite sequence $a_1$, $a_2$, $a_3$, $\ldots$ of real numbers satisfies
\[
a_{2n-1} + a_{2n} > a_{2n+1} + a_{2n+2} \qquad \mbox{and} \qquad a_{2n} + a_{2n+1} < a_{2n+2} + a_{2n+3}
\]
for every positive integer $n$. Prove that there exists a real number $C$ such that $a_{n} a_{n+1} < C$ for every positive integer $n$.
[i]Merlijn Staps[/i]
Find an infinite non-constant arithmetic progression of natural numbers such that each term is neither a sum of two squares, nor a sum of two cubes (of natural numbers).
Let $u_1$, $u_2$, $u_3$, $\dots$ be a sequence of integers satisfying the recurrence relation $u_{n + 2} = u_{n + 1}^2 - u_n$. Suppose $u_1 = 39$ and $u_2 = 45$. Prove that 1986 divides infinitely many terms of the sequence.
Let $f(x)=x+3x^{\frac 23}, g(x)=x+x^{\frac 13}$. Call a sequence $\{a_i\}_{i\ge 0}$ satisfactory if
for all $i\ge 1, a_i\in \{f(a_{i-1}), g(a_{i-1})\}$. Find all pairs of real numbers $(x,y)$ such that there
exist satisfactory sequences $(a_i)_{i\ge 0}, (b_i)_{i\ge 0}$ and positive integers $m$ and $n$, such that $a_0 =x$, $b_0 = y$, and
$$|a_m-b_n|<1$$
Given a positive integer $n$, let $a_1,a_2,..,a_n$ be a sequence of nonnegative integers. A sequence of one or more consecutive terms of $a_1,a_2,..,a_n$ is called $dragon$ if their aritmetic mean is larger than 1. If a sequence is a $dragon$, then its first term is the $head$ and the last term is the $tail$. Suppose $a_1,a_2,..,a_n$ is the $head$ or/and $tail$ of some $dragon$ sequence; determine the minimum value of $a_1+a_2+\cdots +a_n$ in terms of $n$.
Let $S$ be the set of all ordered triples of integers $(a_1,a_2,a_3)$ with $1 \le a_1,a_2,a_3 \le 10$. Each ordered triple in $S$ generates a sequence according to the rule $a_n=a_{n-1}\cdot | a_{n-2}-a_{n-3} |$ for all $n\ge 4$. Find the number of such sequences for which $a_n=0$ for some $n$.
Given a natural number $a_0$, we construct the sequence $\{a_n\}$ as follows $a_{n+1} = a^2_n-5$ if $a_n$ is odd, and $\frac{a_n}{2}$ if $a_n$ is even. Prove that for any odd $a_0 > 5$ in the sequence $\{a_n\}$ arbitrarily large numbers will occur.
$b_0, b_1, b_2, \dots$ is a sequence of positive reals such that the sequence $b_0,c b_1, c^2b_2,c^3b_3,\dots$ is convex for all $c > 0$. (A sequence is convex if each term is at most the arithmetic mean of its two neighbors.) Show that $\ln b_0, \ln b_1, \ln b_2, \dots$ is convex.
Given an integer $a_1$($a_1 \neq -1$), find a real number sequence $\{ a_n \}$($a_i \neq 0, i=1,2,\cdots,5$) such that $x_1,x_2,\cdots,x_5$ and $y_1,y_2,\cdots,y_5$ satisfy $b_{i1}x_1+b_{i2}x_2+\cdots +b_{i5}x_5=2y_i$, $i=1,2,3,4,5$, then $x_1y_1+x_2y_2+\cdots+x_5y_5=0$, where $b_{ij}=\prod_{1 \leq k \leq i} (1+ja_k)$.
All cells of an $n\times n$ table are painted in several colors so that there is no monochromatic $2\times2$ square. A sequence of different cells $a_1,a_2,\ldots,a_k$ is called a [i]colorful[/i] if any two consecutive cells are adjacent and are painted in different colors. What is the largest $k{}$ for which there is a colorful sequence of length $k{}$ regardless of the coloring of the cells of the table?
[i]Proposed by N. Belukhov[/i]
A finite arithmetic progression of positive integers $a_1,a_2,\ldots,a_n$ satisfies the condition that for all $1\leq i<j\leq n$, the number of positive divisors of $\gcd\left(a_i,a_j\right)$ is equal to $j-i$. Find the maximum possible value of $n$.
$\text{(A) }2\qquad\text{(B) }3\qquad\text{(C) }4\qquad\text{(D) }5\qquad\text{(E) }6$
A sequence $ (S_n), n \geq 1$ of sets of natural numbers with $ S_1 = \{1\}, S_2 = \{2\}$ and
\[{ S_{n + 1} = \{k \in }\mathbb{N}|k - 1 \in S_n \text{ XOR } k \in S_{n - 1}\}.
\]
Determine $ S_{1024}.$
The sequence $\{x_{n}\}_{n \ge 1}$ is defined by \[x_{1}=x_{2}=1, \; x_{n+2}= 14x_{n+1}-x_{n}-4.\] Prove that $x_{n}$ is always a perfect square.
Let $a_0, a_1, \ldots, a_n, a_{n+1}$ be a sequence of real numbers satisfying the following conditions:
\[a_0 = a_{n+1 }= 0,\]\[ |a_{k-1} - 2a_k + a_{k+1}| \leq 1 \quad (k = 1, 2,\ldots , n).\]
Prove that $|a_k| \leq \frac{k(n+1-k)}{2} \quad (k = 0, 1,\ldots ,n + 1).$
Let $n$ be a positive integer. A sequence $(a, b, c)$ of $a, b, c \in \{1, 2, . . . , 2n\}$ is called [i]joke [/i] if its shortest term is odd and if only that smallest term, or no term, is repeated. For example, the sequences $(4, 5, 3)$ and $(3, 8, 3)$ are jokes, but $(3, 2, 7)$ and $(3, 8, 8)$ are not. Determine the number of joke sequences in terms of $n$.
$a_1 \le a_2 \le ... \le a_n$ is a sequence of reals $b_1, _b2, b_3,..., b_n$ is any rearrangement of the sequence $B_1 \le B_2 \le ...\le B_n$. Show that $\sum a_ib_i \le \sum a_i B_i$.
Let $n$ be a given positive integer and
$$A =\frac{1 \cdot 3 \cdot 5 \cdot ... \cdot (2n- 1)}{2 \cdot 4 \cdot 6 \cdot ... \cdot 2n}$$
Prove that at least one term of the sequence $A, 2A,4A,8A,...,2^kA, ... $ is an integer.
Find the number of squares in the sequence given by $ a_0\equal{}91$ and $ a_{n\plus{}1}\equal{}10a_n\plus{}(\minus{}1)^n$ for $ n \ge 0.$