Found problems: 5923
Take a sequence $(a_n)_{n=1}^\infty$ such that
$a_1=3$
$a_n=a_1a_2a_3...a_{n-1}-1$
[b]a)[/b] Prove that there exists infitely many primes that divides at least 1 term of the sequence.
[b]b)[/b] Prove that there exists infitely many primes that doesn't divide any term of the sequence.
Let $\langle a_n\rangle_{n\ge 0}$ be a sequence of integers satisfying $a_0=1, a_1=3$ and $a_{n+2}=1+\left\lfloor \frac{a_{n+1}^2}{a_n}\right\rfloor \ \ \forall n\ge0.$
Prove that
$a_n\cdot a_{n+2}-a_{n+1}^2=2^n$ for every natural number $n.$
Show that in a non-equilateral triangle, the following statements are equivalent:
$(a)$ The angles of the triangle are in arithmetic progression.
$(b)$ The common tangent to the Nine-point circle and the Incircle is parallel to the Euler Line.
Let $ \left( a_n \right)_{n\ge 1} $ be an arithmetic progression of positive real numbers, and $ m $ be a natural number. Calculate:
[b]a)[/b] $ \lim_{n\to\infty } \frac{1}{n^{2m+2}} \sum_{1\le i<j\le n} a_i^ma_j^m $
[b]b)[/b] $ \lim_{n\to\infty } \frac{1}{a_n^{2m+2}} \sum_{1\le i<j\le n} a_i^ma_j^m $
[i]Dumitru Acu[/i]
An geometric progression starting at $a_0 = 3$ has an even number of terms. Suppose the difference between the odd indexed terms and even indexed terms is $39321$ and that the sum of the fi rst and last term is $49155$. Find the common ratio of this geometric progression.
Define sequence $ (a_n)$ by $ \sum_{d|n} a_d \equal{} 2^n.$ Show that $ n|a_n.$
We consider positive integers $n$ having at least six positive divisors. Let the positive divisors of $n$ be arranged in a sequence $(d_i)_{1\le i\le k}$ with $$1=d_1<d_2<\dots <d_k=n\quad (k\ge 6).$$
Find all positive integers $n$ such that $$n=d_5^2+d_6^2.$$
Let $\{a_n\}_{n=1}^{\infty}$ and $\{b_n\}_{n=1}^{\infty}$ be sequences of integers such that $a_1 = 20$, $b_1 = 15$, and for $n \ge 1$, \[\left\{\begin{aligned} a_{n+1}&=a_n^2-b_n^2, \\ b_{n+1}&=2a_nb_n-b_n^2 \end{aligned}\right.\] Let $G = a_{10}^2-a_{10}b_{10}+b_{10}^2$. Determine the number of positive integer factors of $G$.
[i]Proposed by Michael Ren[/i]
Let $V_n=\sqrt{F_n^2+F_{n+2}^2}$, where $F_n$ is the Fibonacci sequence
($F_1=F_2=1,F_{n+2}=F_{n+1}+F_{n}$)
Show that $V_n,V_{n+1},V_{n+2}$ are the sides of a triangle with area $1/2$
Decide whether there is a member in the arithmetic sequence $\{a_n\}_{n=1}^\infty$ whose first member is $a_1=1998$ and the common difference $d=131$ which is a palindrome (palindrome is a number such that its decimal expansion is symmetric, e.g., $7$, $33$, $433334$, $2135312$ and so on).
Is there an increasing sequence of integers $ 0 = {{a} _{0}} <{{a} _{1}} <{{a} _{2}} <\ldots $ for which the following two conditions are satisfied simultaneously:
1) any natural number can be given as $ {{a} _{i}} + {{a} _{j}} $ for some (possibly equal) $ i \ge 0 $, $ j \ge 0$ ,
2) $ {{a} _ {n}}> \tfrac {{{n} ^ {2}}} {16} $ for all natural $ n $?
The first term of a sequence is 2005. Each succeeding term is the sum of the cubes of the digits of the previous terms. What is the 2005th term of the sequence?
$ \textbf{(A)}\ 29\qquad
\textbf{(B)}\ 55\qquad
\textbf{(C)}\ 85\qquad
\textbf{(D)}\ 133\qquad
\textbf{(E)}\ 250$
Determine the number of angles $\theta$ between $0$ and $2 \pi$, other than integer multiples of $\pi /2$, such that the quantities $\sin \theta, \cos \theta, $ and $\tan \theta$ form a geometric sequence in some order.
Let $f(x) = 1 + \frac{2}{x}$. Put $f_1(x) = f(x)$, $f_2(x) = f(f_1(x))$, $f_3(x) = f(f_2(x))$, $... $. Find the solutions to $x = f_n(x)$ for $n > 0$.
A $\pm 1$-[i]sequence[/i] is a sequence of $2022$ numbers $a_1, \ldots, a_{2022},$ each equal to either $+1$ or $-1$. Determine the largest $C$ so that, for any $\pm 1$-sequence, there exists an integer $k$ and indices $1 \le t_1 < \ldots < t_k \le 2022$ so that $t_{i+1} - t_i \le 2$ for all $i$, and $$\left| \sum_{i = 1}^{k} a_{t_i} \right| \ge C.$$
Let us consider one variable polynomials with the senior coefficient equal to one. We shall say that two polynomials $P(x)$ and $Q(x)$ commute, if $P(Q(x))=Q(P(x))$ (i.e. we obtain the same polynomial, having collected the similar terms).
a) For every a find all $Q$ such that the $Q$ degree is not greater than three, and $Q$ commutes with $(x^2 - a)$.
b) Let $P$ be a square polynomial, and $k$ is a natural number. Prove that there is not more than one commuting with $P$ $k$-degree polynomial.
c) Find the $4$-degree and $8$-degree polynomials commuting with the given square polynomial $P$.
d) $R$ and $Q$ commute with the same square polynomial $P$. Prove that $Q$ and $R$ commute.
e) Prove that there exists a sequence $P_2, P_3, ... , P_n, ...$ ($P_k$ is $k$-degree polynomial), such that $P_2(x) = x^2 - 2$, and all the polynomials in this infinite sequence pairwise commute.
Find the number of sequences $(a_n)_{n=1}^\infty$ of integers satisfying $a_n \ne -1$ and
\[a_{n+2} =\frac{a_n + 2006}{a_{n+1} + 1}\]
for each $n \in \mathbb{N}$.
Find all integer sequences of the form $ x_i, 1 \le i \le 1997$, that satisfy $ \sum_{k\equal{}1}^{1997} 2^{k\minus{}1} x_{k}^{1997}\equal{}1996\prod_{k\equal{}1}^{1997}x_k$.
Let $M$ be a finite set of lattice points and $n$ be a positive integer. A $\textit{mine-avoiding path}$ is a path of lattice points with length $n$, beginning at $(0,0)$ and ending at a point on the line $x+y=n,$ that does not contain any point in $M$. Prove that if there exists a mine-avoiding path, then there exist at least $2^{n-|M|}$ mine-avoiding paths. [hide=*]A lattice point is a point $(x,y)$ where $x$ and $y$ are integers. A path of lattice points with length $n$ is a sequence of lattice points $P_0,P_1,\ldots, P_n$ in which any two adjacent points in the sequence have distance 1 from each other.[/hide]
[i]Ankit Bisain and Holden Mui[/i]
Let $(a_n), (b_n)$, $n = 1,2,...$ be two sequences of integers defined by $a_1 = 1, b_1 = 0$ and for $n \geq 1$
$a_{n+1} = 7a_n + 12b_n + 6$
$b_{n+1} = 4a_n + 7b_n + 3$
Prove that $a_n^2$ is the difference of two consecutive cubes.
Circle $B$, which has radius 2008, is tangent to horizontal line $A$ at point $P$. Circle $C_1$ has radius 1 and is tangent both to circle $B$ and to line $A$ at a point to the right of point $P$. Circle $C_2$ has radius larger than 1 and is tangent to line $A$ and both circles B and $C_1$. For $n>1$, circle $C_n$ is tangent to line $A$ and both circles $B$ and $C_{n-1}$. Find the largest value of n such that this sequence of circles can be constructed through circle $C_n$ where the n circles are all tangent to line $A$ at points to the right of $P$.
[asy]
size(300);
draw((-10,0)--(10,0));
draw(arc((0,10),10,210,330));
label("$P$",(0,0),S);
pair C=(0,10),X=(12,3);
for(int kk=0;kk<6;++kk)
{
pair Y=(X.x-X.y,X.y);
for(int k=0;k<20;++k)
Y+=(abs(Y-X)-X.y-Y.y,abs(Y-C)-10-Y.y)/3;
draw(circle(Y,Y.y));
X=Y;
}[/asy]
The sequence $ \{a_{n}\}_{n \ge 1}$ is defined by \[ a_{1}=1, \; a_{2}=2, \; a_{3}=24, \; a_{n}=\frac{ 6a_{n-1}^{2}a_{n-3}-8a_{n-1}a_{n-2}^{2}}{a_{n-2}a_{n-3}}\ \ \ \ (n\ge4).\] Show that $ a_{n}$ is an integer for all $ n$, and show that $ n|a_{n}$ for every $ n\in\mathbb{N}$.
For the positive integer $n$, define $f(n)=\min\limits_{m\in\Bbb Z}\left|\sqrt2-\frac mn\right|$. Let $\{n_i\}$ be a strictly increasing sequence of positive integers. $C$ is a constant such that $f(n_i)<\dfrac C{n_i^2}$ for all $i\in\{1,2,\ldots\}$. Show that there exists a real number $q>1$ such that $n_i\geqslant q^{i-1}$ for all $i\in\{1,2,\ldots \}$.
Let $a_1, a_2... $ be an infinite sequence of real numbers such that $a_{n+1}=\sqrt{{a_n}^2+a_n-1}$. Prove that $a_1 \notin (-2,1)$
[i]Proposed by Oleg Mushkarov and Nikolai Nikolov
[/i]
The sequence of digits
\[
1 2 3 4 5 6 7 8 9 1 0 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 2 0 2 1 \dots
\]
is obtained by writing the positive integers in order. If the $10^n$-th digit in this sequence occurs in the part of the sequence in which the $m$-digit numbers are placed, define $f(n)$ to be $m$. For example, $f(2)=2$ because the 100th digit enters the sequence in the placement of the two-digit integer 55. Find, with proof, $f(1987)$.