Found problems: 5923
A function $S(m, n)$ satisfies the initial conditions $S(1, n) = n$, $S(m, 1) = 1$, and the recurrence $S(m, n) = S(m - 1, n)S(m, n - 1)$ for $m\geq 2, n\geq 2$. Find the largest integer $k$ such that $2^k$ divides $S(7, 7)$.
Let $a_1,a_2,\ldots$ be an infinite sequence of real numbers, for which there exists a real number $c$ with $0\leq a_i\leq c$ for all $i$, such that \[\left\lvert a_i-a_j \right\rvert\geq \frac{1}{i+j} \quad \text{for all }i,\ j \text{ with } i \neq j. \] Prove that $c\geq1$.
Let $p$ be a prime number. Troy and Abed are playing a game. Troy writes a positive integer $X$ on the board, and gives a sequence $(a_n)_{n\in\mathbb{N}}$ of positive integers to Abed. Abed now makes a sequence of moves. The $n$-th move is the following:
$$\text{ Replace } Y \text{ currently written on the board with either } Y + a_n \text{ or } Y \cdot a_n.$$
Abed wins if at some point the number on the board is a multiple of $p$. Determine whether Abed can win, regardless of Troy’s choices, if
$a) p = 10^9 + 7$;
$b) p = 10^9 + 9$.
[i]Remark[/i]: Both $10^9 + 7$ and $10^9 + 9$ are prime.
[i]Proposed by Ivan Novak[/i]
$n\in{Z^{+}}$ and $A={1,\ldots ,n}$. $f: N\rightarrow N$ and $\sigma: N\rightarrow N$ are two permutations, if there is one $k\in A$ such that $(f\circ\sigma)(1),\ldots ,(f\circ\sigma)(k)$ is increasing and $(f\circ\sigma)(k),\ldots ,(f\circ\sigma)(n)$ is decreasing sequences we say that $f$ is good for $\sigma$. $S_\sigma$ shows the set of good functions for $\sigma$.
a) Prove that, $S_\sigma$ has got $2^{n-1}$ elements for every $\sigma$ permutation.
b)$n\geq 4$, prove that there are permutations $\sigma$ and $\tau$ such that, $S_{\sigma}\cap S_{\tau}=\phi$
.
Let $(a_n)$ be sequnce of positive integers such that first $k$ members $a_1,a_2,...,a_k$ are distinct positive integers, and for each $n>k$, number $a_n$ is the smallest positive integer that can't be represented as a sum of several (possibly one) of the numbers $a_1,a_2,...,a_{n-1}$. Prove that $a_n=2a_{n-1}$ for all sufficently large $n$.
Does there exist a sequence $a_1,a_2,a_3,\ldots $ of positive integers such that the sum of every $n$ consecutive elements is divisible by $n^2$ for every positive integer $n$?
Let $(a_n)_n$ be a sequence of positive irational numbers.
a) Prove that for every $n\in\mathbb N^*$, the binomial development $(1+a_n)^n$ admits a unique maximum term and determine its rank $r_n\in\{1,2,\ldots,n+1\}$.
b) We consider the sequences $x_n=a_n\sqrt n, n\in\mathbb N^*$ and $y_n=(1+a_n)^{r_n}, n\in\mathbb N^*$. Prove that $(x_n)_n$ is convergent if and only if the sequence $(y_n)_n$ is convergent.
[i]Eugen Paltanea[/i]
The $n^{th}$ term of a sequence is $t_n$. For $n \ge 1$, $t_n$ is given by the relation:
$$t_n= n^3+\frac12 n^2+ \frac13 n + \frac14$$
The $n^{th}$ term of a second sequence $T_n$, where $T_n$ represents the smallest integer greater than $t_n$. Calculate: $$(T_1+T_2+...+T_{1014}) -(t_1+t_2+...+t_{1014}) $$
What is the smallest positive integer that cannot be written as the sum of two nonnegative palindromic integers? (An integer is [i]palindromic[/i] if the sequence of decimal digits are the same when read backwards.)
For a sequence $a_1,a_2,...,a_m$ of real numbers, define the following sets
\[A=\{a_i | 1\leq i\leq m\}\ \text{and} \ B=\{a_i+2a_j | 1\leq i,j\leq m, i\neq j\}\]
Let $n$ be a given integer, and $n>2$. For any strictly increasing arithmetic sequence of positive integers, determine, with proof, the minimum number of elements of set $A\triangle B$, where $A\triangle B$ $= \left(A\cup B\right) \setminus \left(A\cap B\right).$
Let $a_1,a_2,\ldots,a_n$ and $b_1,b_2,\ldots,b_n$ be two finite sequences consisting of $2n$ real different numbers. Rearranging each of the sequences in increasing order we obtain $a_1',a_2',\ldots,a_n'$ and $b_1',b_2',\ldots,b_n'$. Prove that
\[\max_{1\le i\le n}|a_i-b_i|\ge\max_{1\le i\le n}|a_i'-b_i'|.\]
If a positive sequence $\{a_n\}_{n\geq 1}$ satisfies $\int_0^{a_n} x^{n}\ dx=2$, then find $\lim_{n\to\infty} a_n.$
Let $a_n$ and $b_n$ to be two sequences defined as below:
$i)$ $a_1 = 1$
$ii)$ $a_n + b_n = 6n - 1$
$iii)$ $a_{n+1}$ is the least positive integer different of $a_1, a_2, \ldots, a_n, b_1, b_2, \ldots, b_n$.
Determine $a_{2009}$.
The sequence $ \{a_n\}$ satisfies $ a_0 \equal{} 0, a_{n \plus{} 1} \equal{} ka_n \plus{} \sqrt {(k^2 \minus{} 1)a_n^2 \plus{} 1}, n \equal{} 0, 1, 2, \ldots$, where $ k$ is a fixed positive integer. Prove that all the terms of the sequence are integral and that $ 2k$ divides $ a_{2n}, n \equal{} 0, 1, 2, \ldots$.
a) Prove that in an infinite sequence ${a_k}$ of integers, pairwise distinct and each member greater than $1$, one can find $100$ members for which $a_k > k$.
b) Prove that in an infinite sequence ${a_k}$ of integers, pairwise distinct and each member greater than $1$ there are infinitely many such numbers $a_k$ such that $a_k > k$.
(A Andjans, Riga)
PS. (a) for juniors (b) for seniors
A sequence of real numbers $u_1, u_2, u_3, \dots$ is determined by $u_1$ and the following recurrence relation for $n \geq 1$:
\[4u_{n+1} = \sqrt[3]{ 64u_n + 15.}\]
Describe, with proof, the behavior of $u_n$ as $n \to \infty.$
[b]7.[/b] Let $(a_n)_{n=0}^{\infty}$ be a sequence of real numbers such that, with some positive number $C$,
$\sum_{k=1}^{n}k\mid a_k \mid<n C$ ($n=1,2, \dots $)
Putting $s_n= a_0 +a_1+\dots+a_n$, suppose that
$\lim_{n \to \infty }(\frac{s_{0}+s_{1}+\dots+s_n}{n+1})= s$
exists. Prove that
$\lim_{n \to \infty }(\frac{s_{0}^2+s_{1}^2+\dots+s_n^2}{n+1})= s^2$
[b](S. 7)[/b]
Given an integer $a_0$, we define a sequence of real numbers $a_0, a_1, . . .$ using the relation $$a^2_i = 1 + ia^2_{i-1},$$
for $i \ge 1$. An index $j$ is called [i]good [/i] if $a_j$ can be an integer for some $a_0$. Determine the sum of the indices $j$ which lie in the interval $[0, 99]$ and which are not good.
Let $a_0, a_1, . . . ,a_n$ be such that $a_n \ne 0$ and $$(1 + x + x^3)^{342} (1 + 2x + x^2 + 2x^3 + 2x^4 + x^6)^{341} =\sum^{n}_{i=0}a_ix^i.$$ Compute the number of odd terms in the sequence $a_0, a_1, . . . ,a_n$.
Concider two sequences $x_n=an+b$, $y_n=cn+d$ where $a,b,c,d$ are natural numbers and $gcd(a,b)=gcd(c,d)=1$, prove that there exist infinite $n$ such that $x_n$, $y_n$ are both square-free.
[i]Proposed by Siavash Rahimi Shateranloo, Matin Yadollahi[/i] [b]Rated 3[/b]
Let $(a_n)_{n\geq 1}$ be a positive real sequence given by $a_n=\sum \limits_{k=1}^n \frac{1}{k}$. Compute $$\lim \limits_{n \to \infty}e^{-2a_n} \sum \limits_{k=1}^n \left \lfloor \left(\sqrt[2k]{k!}+\sqrt[2(k+1)]{(k+1)!}\right)^2 \right \rfloor$$where we denote by $\lfloor x\rfloor$ the integer part of $x$.
$a_1,a_2,\ldots,a_n$ is a sequence of positive integers that has at least $\frac {2n}{3}+1$ distinct numbers and each positive integer has occurred at most three times in it. Prove that there exists a permutation $b_1,b_2,\ldots,b_n$ of $a_i $'s such that all the $n$ sums $b_i+b_{i+1}$ are distinct ($1\le i\le n $ , $b_{n+1}\equiv b_1 $)
[i]Proposed by Mohsen Jamali[/i]
From an initial triangle $\Delta A_0B_0C_0$, a sequence of triangles $\Delta A_1B_1C_1$, $A_2B_2C_2$, ... is formed such that, at each stage, $A_{k + 1}$, $B_{k + 1}$ and $C_{k + 1}$ are the points where the incircle of $\Delta A_kB_kC_k$ touches the sides $B_kC_k$, $C_kA_k$ and $A_kB_k$ respectively.
(a) Express $\angle A_{k + 1}B_{k + 1}C_{k + 1}$ in terms of $\angle A_kB_kC_k$.
(b) Deduce that, as $k$ increases, $\angle A_kB_kC_k$ tends to $60^{\circ}$.
Let $p$ be an odd prime number. Let $S=a_1,a_2,\dots$ be the sequence defined as follows: $a_1=1,a_2=2,\dots,a_{p-1}=p-1$, and for $n\ge p$, $a_n$ is the smallest integer greater than $a_{n-1}$ such that in $a_1,a_2,\dots,a_n$ there are no arithmetic progressions of length $p$. We say that a positive integer is a [i]ghost[/i] if it doesn’t appear in $S$.
What is the smallest ghost that is not a multiple of $p$?
[i]Proposed by Guerrero[/i]
Suppose that $ \left(u_n\right)$ is a sequence of real numbers satisfying $ u_{n \plus{} 2} \equal{} 2u_{n \plus{} 1} \plus{} u_{n}$, and that $ u_3 \equal{} 9$ and $ u_6 \equal{} 128$. What is $ u_5$?
$ \textbf{(A)}\ 40 \qquad \textbf{(B)}\ 53 \qquad \textbf{(C)}\ 68 \qquad \textbf{(D)}\ 88 \qquad \textbf{(E)}\ 104$