Found problems: 5923
Let $k\geq 0$ an integer. The sequence $a_0,\ a_1,\ a_2, \ a_3, \ldots$ is defined as follows:
[LIST]
[*] $a_0=k$ [/*]
[*] For $n\geq 1$, we have that $a_n$ is the smallest integer greater than $a_{n-1}$ so that $a_n+a_{n-1}$ is a perfect square. [/*]
[/LIST]
Prove that there are exactly $\left \lfloor{\sqrt{2k}} \right \rfloor$ positive integers that cannot be written as the difference of two elements of such a sequence.
[i]Note.[/i] If $x$ is a real number, $\left \lfloor{x} \right \rfloor$ denotes the greatest integer smaller or equal than $x$.
Let $a_{1}, \ldots, a_{n}$ be an infinite sequence of strictly positive integers, so that $a_{k} < a_{k+1}$ for any $k.$ Prove that there exists an infinity of terms $ a_{m},$ which can be written like $a_m = x \cdot a_p + y \cdot a_q$ with $x,y$ strictly positive integers and $p \neq q.$
The sequence $(a_n)$ is defined with the recursion $a_{n + 1} = 5a^6_n + 3a^3_{n-1} + a^2_{n-2}$ for $n\ge 2$ and the set of initial values $\{a_0, a_1, a_2\} = \{2013, 2014, 2015\}$. (That is, the initial values are these three numbers in any order.)
Show that the sequence contains no sixth power of a natural number.
Let $n$ be a positive integer $\geq 2$ . Consider a $n$ by $n$ grid with all entries $1$. Define an operation on a square to be changing the signs of all squares adjacent to it but not the sign of its own. Find all $n$ such that it is possible after a finite sequence of operations to reach a $n$ by $n$ grid with all entries $-1$
The infinite sequence $a_0, a_1, a_2, a_3,... $ is defined by $a_0 = 2$ and
$$a_n =\frac{2a_{n-1} + 1}{a_{n-1} + 2}$$ , $n = 1, 2, 3, ...$ Prove that $1 < a_n < 1 + \frac{1}{3^n}$ for all $n = 1, 2, 3, . .$
Let $n \geq 2$ be a given integer
$a)$ Prove that one can arrange all the subsets of the set $\{1,2... ,n\}$ as a sequence of subsets $A_{1}, A_{2},\cdots , A_{2^{n}}$, such that $|A_{i+1}| = |A_{i}| + 1$ or $|A_{i}| - 1$ where $i = 1,2,3,\cdots , 2^{n}$ and $A_{2^{n} + 1} = A_{1}$
$b)$ Determine all possible values of the sum $\sum \limits_{i = 1}^{2^n} (-1)^{i}S(A_{i})$ where $S(A_{i})$ denotes the sum of all elements in $A_{i}$ and $S(\emptyset) = 0$, for any subset sequence $A_{1},A_{2},\cdots ,A_{2^n}$ satisfying the condition in $a)$
Let $p$ be a prime and $k$ be a positive integer. Set $S$ contains all positive integers $a$ satisfying $1\le a \le p-1$, and there exists positive integer $x$ such that $x^k\equiv a \pmod p$.
Suppose that $3\le |S| \le p-2$. Prove that the elements of $S$, when arranged in increasing order, does not form an arithmetic progression.
Let $a_1, a_2, a_3, ...$ be a monotonically decreasing sequence of positive real numbers converging to zero. Suppose that $\Sigma_{i=1}^{\infty}\frac{a_i}{i}$ diverges. Show that $\Sigma_{i=1}^{\infty}a_i^{2^{2017}}$ also diverges. You may assume in your proof that $\Sigma_{i=1}^{\infty}\frac{1}{i^p}$ converges for all real numbers $p > 1$. (A sum $\Sigma_{i=1}^{\infty}b_i$ of positive real numbers $b_i$ diverges if for each real number $N$ there is a positive integer $k$ such that $b_1+b_2+...+b_k > N$.)
Show that the reciprocal of any number of the form $2(m^2+m+1)$, where $m$ is a positive integer, can be represented as a sum of consecutive terms in the sequence $(a_j)_{j=1}^{\infty}$
\[ a_j = \frac{1}{j(j + 1)(j + 2)}\]
In the notebooks of Peter and Nick, two numbers are written. Initially, these two numbers are 1 and 2 for Peter and 3 and 4 for Nick. Once a minute, Peter writes a quadratic trinomial $f(x)$, the roots of which are the two numbers in his notebook, while Nick writes a quadratic trinomial $g(x)$ the roots of which are the numbers in [i]his[/i] notebook. If the equation $f(x)=g(x)$ has two distinct roots, one of the two boys replaces the numbers in his notebook by those two roots. Otherwise, nothing happens. If Peter once made one of his numbers 5, what did the other one of his numbers become?
An integer sequence satisfies $a_{n+1}={a_n}^3 +1999$. Show that it contains at most one square.
Given:
\[ S = 1 + \frac{1}{1 + \frac{1}{3}} + \frac{1}{1 + \frac{1}{3} + \frac{1} {6}} + \cdots + \frac{1}{1 + \frac{1}{3} + \frac{1}{6} + \cdots + \frac{1} {1993006}} \]
where the denominators contain partial sums of the sequence of reciprocals of triangular numbers (i.e. $k=\frac{n(n+1)}{2}$ for $n = 1$, $2$, $\ldots$,$1996$). Prove that $S>1001$.
Define binary operations $\diamondsuit$ and $\heartsuit$ by $$a \, \diamondsuit \, b = a^{\log_{7}(b)} \qquad \text{and} \qquad a \, \heartsuit \, b = a^{\frac{1}{\log_{7}(b)}}$$
for all real numbers $a$ and $b$ for which these expressions are defined. The sequence $(a_n)$ is defined recursively by $a_3 = 3\, \heartsuit\, 2$ and $$a_n = (n\, \heartsuit\, (n-1)) \,\diamondsuit\, a_{n-1}$$
for all integers $n \geq 4$. To the nearest integer, what is $\log_{7}(a_{2019})$?
$\textbf{(A) } 8 \qquad \textbf{(B) } 9 \qquad \textbf{(C) } 10 \qquad \textbf{(D) } 11 \qquad \textbf{(E) } 12$
The sequence of natural numbers is defined as follows: for any $ k\geq 1 $,$ a_{k+2}= a_{k+1}\cdot a_k+1 $. Prove that for $ k\geq 9 $ the number $ a_k-22 $ is composite.
Let $n$ be a positive integer, and consider a sequence $a_1 , a_2 , \dotsc , a_n $ of positive integers. Extend it periodically to an infinite sequence $a_1 , a_2 , \dotsc $ by defining $a_{n+i} = a_i $ for all $i \ge 1$. If \[a_1 \le a_2 \le \dots \le a_n \le a_1 +n \] and \[a_{a_i } \le n+i-1 \quad\text{for}\quad i=1,2,\dotsc, n, \] prove that \[a_1 + \dots +a_n \le n^2. \]
Find the greatest positive integer $m$ with the following property:
For every permutation $a_1, a_2, \cdots, a_n,\cdots$ of the set of positive integers, there exists positive integers $i_1<i_2<\cdots <i_m$ such that $a_{i_1}, a_{i_2}, \cdots, a_{i_m}$ is an arithmetic progression with an odd common difference.
An $n\times n$ matrix $A$ with integer entries is called [i]representative[/i] if, for any integer vector $\mathbf{v}$, there is a finite sequence $0=\mathbf{v}_0,\mathbf{v}_1,\dots,\mathbf{v}_{\ell}=\mathbf{v}$ of integer vectors such that for each $0\leq i <\ell$, either $\mathbf{v}_{i+1}=A\mathbf{v}_{i}$ or $\mathbf{v}_{i+1}-\mathbf{v}_i$ is an element of the standard basis (i.e. one of its entries is $1$, the rest are all equal to $0$). Show that $A$ is not representative if and only if $A^T$ has a real eigenvector with all non-negative entries and non-negative eigenvalue.
Each of the integers from 1 to 4027 has been colored either green or red. Changing the color of a number is making it red if it was green and making it green if it was red. Two positive integers $m$ and $n$ are said to be [i]cuates[/i] if either $\frac{m}{n}$ or $\frac{n}{m}$ is a prime number. A [i]step[/i] consists in choosing two numbers that are cuates and changing the color of each of them. Show it is possible to apply a sequence of steps such that every integer from 1 to 2014 is green.
The sequences $(a_n)$ and (c_n) are given by $a_0 =\frac12$, $c_0=4$ , and for $n \ge 0$ , $a_{n+1}=\frac{2a_n}{1+a_n^2}$, $c_{n+1}=c_n^2-2c_n+2$
Prove that for all $n\ge 1$, $a_n=\frac{2c_0c_1...c_{n-1}}{c_n}$
The sequence $(a_n)$ is given by $a_1 = x \in \mathbb{R}$ and $3a_{n+1} = a_n+1$ for $n \geq 1$. Set
$A = \sum_{n=1}^\infty \Big[ a_n - \frac{1}{6}\Big]$, $B = \sum_{n=1}^\infty \Big[ a_n + \frac{1}{6}\Big]$.
Compute the sum $A+B$ in terms of $x$.
Define a sequence $a_1=0,\ \frac{1}{1-a_{n+1}}-\frac{1}{1-a_n}=2n+1\ (n=1,\ 2,\ 3,\ \cdots)$.
(1) Find $a_n$.
(2) Let ${b_k=\sqrt{\frac{k+1}{k}}\ (1-\sqrt{a_{k+1}}})$ for $k=1,\ 2,\ 3,\ \cdots$.
Prove that $\sum_{k=1}^n b_k<\sqrt{2}-1$ for each $n$.
Last Edited
Find the greatest natural number $n$ such there exist natural numbers $x_{1}, x_{2}, \ldots, x_{n}$ and natural $a_{1}< a_{2}< \ldots < a_{n-1}$ satisfying the following equations for $i =1,2,\ldots,n-1$: \[x_{1}x_{2}\ldots x_{n}= 1980 \quad \text{and}\quad x_{i}+\frac{1980}{x_{i}}= a_{i}.\]
Let $a_1,a_2,\ldots$ be an infinite sequence of integers such that $a_i$ divides $a_{i+1}$ for all $i\geq 1$, and let $b_i$ be the remainder when $a_i$ is divided by $210$. What is the maximal number of distinct terms in the sequence $b_1,b_2,\ldots$?
Let $ a_1,a_2,a_3,\dots$ be infinite sequence of positive integers satisfying the following conditon: for each prime number $ p$, there are only finite number of positive integers $ i$ such that $ p|a_i$. Prove that that sequence contains a sub-sequence $ a_{i_1},a_{i_2},a_{i_3},\dots$, with $ 1 \le i_1<i_2<i_3<\dots$, such that for each $ m \ne n$, $ \gcd(a_{i_m},a_{i_n})\equal{}1$.
$\boxed{A3}$The sequence $a_1,a_2,a_3,...$ is defined by $a_1=a_2=1,a_{2n+1}=2a_{2n}-a_n$ and $a_{2n+2}=2a_{2n+1}$ for $n\in{N}.$Prove that if $n>3$ and $n-3$ is divisible by $8$ then $a_n$ is divisible by $5$