Found problems: 5923
Consider the sequence $x_n>0$ defined with the following recurrence relation:
\[x_1 = 0\]
and for $n>1$ \[(n+1)^2x_{n+1}^2 + (2^n+4)(n+1)x_{n+1}+ 2^{n+1}+2^{2n-2} = 9n^2x_n^2+36nx_n+32.\]
Show that if $n$ is a prime number larger or equal to $5$, then $x_n$ is an integer.
We examine the following two sequences: The Fibonacci sequence: $F_{0}= 0, F_{1}= 1, F_{n}= F_{n-1}+F_{n-2 }$ for $n \geq 2$; The Lucas sequence: $L_{0}= 2, L_{1}= 1, L_{n}= L_{n-1}+L_{n-2}$ for $n \geq 2$. It is known that for all $n \geq 0$
\[F_{n}=\frac{\alpha^{n}-\beta^{n}}{\sqrt{5}},L_{n}=\alpha^{n}+\beta^{n}, \]
where $\alpha=\frac{1+\sqrt{5}}{2},\beta=\frac{1-\sqrt{5}}{2}$. These formulae can be used without proof.
Prove that $1+L_{2^{j}}\equiv 0 \pmod{2^{j+1}}$ for $j \geq 0$.
How many sequences of nonnegative integers $a_1,a_2,\ldots, a_n$ ($n\ge1$) are there such that $a_1\cdot a_n > 0$, $a_1+a_2+\cdots + a_n = 10$, and $\prod_{i=1}^{n-1}(a_i+a_{i+1}) > 0$?
[i]Ray Li.[/i]
[hide="Clarifications"][list=1][*]If you find the wording of the problem confusing, you can use the following, equivalent wording: "How many finite sequences of nonnegative integers are there such that (i) the sum of the elements is 10; (ii) the first and last elements are both positive; and (iii) among every pair of adjacent integers in the sequence, at least one is positive."[/list][/hide]
Show that all terms of the sequence $1,11,111,1111,...$ in base $9$ are triangular numbers, i.e. of the form $\frac{m(m+1)}{2} $for an integer $m$
Let $a_1,a_2,\dots$ be a sequence of real numbers satisfying
$$\frac{a_{n+1}}{a_n}-\frac{a_{n+2}}{a_n}-\frac{a_{n+1}a_{n+2}}{a_n^2}=\frac{na_{n+2}a_{n+1}}{a_n}.$$
Given that $a_1=-1$ and $a_2=-\tfrac{1}{2}$, find the value of $\tfrac{a_9}{a_{20}}$.
Arithmetical progression $a_1, a_2, a_3, a_4,...$ contains $a_1^2 , a_2^2$ and $a_3^2$ at some positions. Prove that all terms of this progression are integers.
Let $F(n)$ be the set of polynomials $P(x) = a_0+a_1x+\cdots+a_nx^n$, with $a_0, a_1, . . . , a_n \in \mathbb R$ and $0 \leq a_0 = a_n \leq a_1 = a_{n-1 } \leq \cdots \leq a_{[n/2] }= a_{[(n+1)/2]}.$ Prove that if $f \in F(m)$ and $g \in F(n)$, then $fg \in F(m + n).$
Given a list of the positive integers $1,2,3,4,\dots,$ take the first three numbers $1,2,3$ and their sum $6$ and cross all four numbers off the list. Repeat with the three smallest remaining numbers $4,5,7$ and their sum $16.$ Continue in this way, crossing off the three smallest remaining numbers and their sum and consider the sequence of sums produced: $6,16,27, 36, \dots.$ Prove or disprove that there is some number in this sequence whose base 10 representation ends with $2015.$
Let $\{a_n\}$ be a sequence of positive real numbers such that $\lim_{n\to\infty}a_n=0$. Prove that $\sum^\infty_{n=1}\left|1-\frac{a_{n+1}}{a_n}\right|$ is divergent.
Let $a > 1$ be a positive integer and $d > 1$ be a positive integer coprime to $a$. Let $x_1=1$, and for $k\geq 1$, define
$$x_{k+1} = \begin{cases}
x_k + d &\text{if } a \text{ does not divide } x_k \\
x_k/a & \text{if } a \text{ divides } x_k
\end{cases}$$
Find, in terms of $a$ and $d$, the greatest positive integer $n$ for which there exists an index $k$ such that $x_k$ is divisible by $a^n$.
Three fair dice are tossed at random (i.e., all faces have the same probability of coming up). What is the probability that the three numbers turned up can be arranged to form an arithmetic progression with common difference one?
$\textbf{(A) }\frac{1}{6}\qquad\textbf{(B) }\frac{1}{9}\qquad\textbf{(C) }\frac{1}{27}\qquad\textbf{(D) }\frac{1}{54}\qquad \textbf{(E) }\frac{7}{36}$
The decimal digits of a natural number $A$ form an increasing sequence (from left to right). Find the sum of the digits of $9A$.
Let $n$ be a positive integer greater than or equal to $6$, and suppose that $a_1, a_2, ...,a_n$ are real numbers such that the sums $a_i + a_j$ for $1 \le i<j\le n$, taken in some order, form consecutive terms of an arithmetic progression $A$, $A + d$, $...$ ,$A + (k-1)d$, where $k = n(n-1)/2$. What are the possible values of $d$?
Integers a, b, c, d, and e satisfy the following three properties:
(i) $2 \le a < b <c <d <e <100$
(ii)$ \gcd (a,e) = 1 $
(iii) a, b, c, d, e form a geometric sequence.
What is the value of c?
Let $k$ be a positive integer and $a_1, a_2,... , a_k$ be nonnegative real numbers. Initially, there is a sequence of $n \geq k$ zeros written on a blackboard. At each step, Nicole chooses $k$ consecutive numbers written on the blackboard and increases the first number by $a_1$, the second one by $a_2$, and so on, until she increases the $k$-th one by $a_k$. After a positive number of steps, Nicole managed to make all the numbers on the blackboard equal. Prove that all the nonzero numbers among $a_1, a_2, . . . , a_k$ are equal.
Let $\{a_{n,1},\ldots, a_{n,n} \}_{n=1}^{\infty}$ integers such that $a_{n,i}\neq a_{n,j}$ for $1\le i<j\le n\, , n=2,3,\ldots$ and let $\left\langle y\right\rangle\in [0,1)$ denote the fractional part of the real number $y$. Show that there exists a real sequence $\{ x_n\}_{n=1}^{\infty}$ such that the numbers $\langle a_{n,1}x_n \rangle, \ldots, \langle a_{n,n}x_n \rangle$ are asymptotically uniformly distributed on the interval $[0,1]$.
(translated by L. Erdős)
A student wrote down the following sequence of numbers : the first number is 1, the second number is 2, and after that, each number is obtained by adding together all the previous numbers. Determine the 12th number in the sequence.
About $5$ years ago, Joydip was researching on the number $2017$. He understood that $2017$ is a prime number. Then he took two integers $a,b$ such that $0<a,b <2017$ and $a+b\neq 2017.$ He created two sequences $A_1,A_2,\dots ,A_{2016}$ and $B_1,B_2,\dots, B_{2016}$ where $A_k$ is the remainder upon dividing $ak$ by $2017$, and $B_k$ is the remainder upon dividing $bk$ by $2017.$ Among the numbers $A_1+B_1,A_2+B_2,\dots A_{2016}+B_{2016}$ count of those that are greater than $2017$ is $N$. Prove that $N=1008.$
Given a sequence of positive integers
$$a_1, a_2, a_3, a_4, a_5, \dots$$
such that $a_2 > a_1$ and $a_{n+2} = 3a_{n+1} - 2a_n$ for all $n \geq 1$.
Prove that $a_{2021} > 2^{2019}$.
Assume that $(a_n)_{n \ge 1}$ is an increasing sequence of positive real numbers such that $\lim \tfrac{a_n}{n}=0$. Must there exist infinitely many positive integers $n$ such that $a_{n-i}+a_{n+i}<2a_n$ for $i=1,2,\cdots,n-1$?
Let $A$ and $B$ points in the plane and $C$ a point in the perpendiclar bisector of $AB$. It is constructed a sequence of points $C_1,C_2,\dots, C_n,\dots$ in the following way: $C_1=C$ and for $n\geq1$, if $C_n$ does not belongs to $AB$, then $C_{n+1}$ is the circumcentre of the triangle $\triangle{ABC_n}$.
Find all the points $C$ such that the sequence $C_1,C_2,\dots$ is defined for all $n$ and turns eventually periodic.
Note: A sequence $C_1,C_2, \dots$ is called eventually periodic if there exist positive integers $k$ and $p$ such that $C_{n+p}=c_n$ for all $n\geq{k}$.
The roots of the equation
\[ x^3-3ax^2+bx+18c=0 \]
form a non-constant arithmetic progression and the roots of the equation
\[ x^3+bx^2+x-c^3=0 \]
form a non-constant geometric progression. Given that $a,b,c$ are real numbers, find all positive integral values $a$ and $b$.
Consider the sequence $\{a_n\}$ defined so that $a_n$ is the leftmost digit of $2^n$. The first few terms of this sequence are $1,2,4,8,1,3,6,\dots$. For how many $0\le n\le100000$ is $a_n=1$? If $C$ is the correct answer and $A$ is your answer, then your score will be rounded up from $\max\left(0,25-\tfrac{1}{6}\sqrt{|A-C|}\right)$.
The Fibonacci sequence is defined as $f_1=f_2=1$, $f_{n+2}=f_{n+1}+f_n$ ($n\in\mathbb{N}$). Suppose that $a$ and $b$ are positive integers such that $\frac ab$ lies between the two fractions $\frac{f_n}{f_{n-1}}$ and $\frac{f_{n+1}}{f_{n}}$. Show that $b\ge f_{n+1}$.
Prove that for every natural number $a_1>1$ there exists an increasing sequence of natural numbers $a_n$ such that $a^2_1+a^2_2+\cdots+a^2_k$ is divisible by $a_1+a_2+\cdots+a_k$ for all $k \geq 1$.
[i]A. Golovanov[/i]