Found problems: 5923
A finite sequence of numbers $(a_1,\cdots,a_n)$ is said to be alternating if $$a_1>a_2~,~a_2<a_3~,~a_3>a_4~,~a_4<a_5~,~\cdots$$ $$\text{or ~}~~a_1<a_2~,~a_2>a_3~,~a_3<a_4~,~a_4>a_5~,~\cdots$$ How many alternating sequences of length $5$ , with distinct numbers $a_1,\cdots,a_5$ can be formed such that $a_i\in\{1,2,\cdots,20\}$ for $i=1,\cdots,5$ ?
The $2011$th prime number is $17483$ and the next prime is $17489$.
Does there exist a sequence of $2011^{2011}$ consecutive positive integers that contain exactly $2011$ prime numbers?
A [i]slab[/i] is the set of points strictly between two parallel planes. Prove that a countable sequence of slabs, the sum of whose thicknesses converges, cannot fill space.
Let $a_0,a_1,a_2...$ be a sequence of natural numbers with the following property: $a_n^2$ divides $a_{n-1} a_{n+1}$ for $\forall$ $n\in \mathbb{N}$. Prove that, if for some natural $k\geq 2$ the numbers $a_1$ and $a_k$ are coprime, then $a_1$ divides $a_0$.
Let be two real numbers $ b>a>0, $ and a sequence $ \left( x_n \right)_{n\ge 1} $ with $ x_2>x_1>0 $ and such that
$$ ax_{n+2}+bx_n\ge (a+b)x_{n+1} , $$
for any natural numbers $ n. $
Prove that $ \lim_{n\to\infty } x_n=\infty . $
[i]Dan Popescu[/i]
The sequence $ (x_n)^{\infty}_{n\equal{}1}$ is defined by $ x_1 \equal{} 1$ and $ x_{n\plus{}1} \equal{}\frac{(2 \plus{} \cos 2\alpha)x_n \minus{} \cos^2\alpha}{(2 \minus{} 2 \cos 2\alpha)x_n \plus{} 2 \minus{} \cos 2\alpha}$, for all $ n \in\mathbb{N}$, where $ \alpha$ is a given real parameter. Find all values of $ \alpha$ for which the sequence $ (y_n)$ given by $ y_n \equal{} \sum_{k\equal{}1}^{n}\frac{1}{2x_k\plus{}1}$ has a finite limit when $ n \to \plus{}\infty$ and find that limit.
Let $A_{11}$ denote the answer to problem $11$. Determine the smallest prime $p$ such that the arithmetic sequence $p,p+A_{11},p+2A_{11},\cdots$ begins with the largest number of primes.
There is just one triple of possible $(A_{10},A_{11},A_{12})$ of answers to these three problems. Your team will receive credit only for answers matching these. (So, for example, submitting a wrong answer for problem $11$ will not alter the correctness of your answer to problem $12$.)
In their base $ 10$ representation, the integer $ a$ consists of a sequence of $ 1985$ eights and the integer $ b$ consists of a sequence of $ 1985$ fives. What is the sum of the digits of the base 10 representation of $ 9ab$?
$ \textbf{(A)}\ 15880 \qquad \textbf{(B)}\ 17856 \qquad \textbf{(C)}\ 17865 \qquad \textbf{(D)}\ 17874 \qquad \textbf{(E)}\ 19851$
The roots of a monic cubic polynomial $p$ are positive real numbers forming a geometric sequence. Suppose that the sum of the roots is equal to $10$. Under these conditions, the largest possible value of $|p(-1)|$ can be written as $\frac{m}{n}$, where $m$, $n$ are relatively prime integers. Find $m + n$.
Call a positive integer [i]monotonous[/i] if it is a one-digit number or its digits, when read from left to right, form either a strictly increasing or a strictly decreasing sequence. For example, 3, 23578, and 987620 are monotonous, but 88, 7434, and 23557 are not. How many monotonous positive integers are there?
$\textbf{(A)} \text{ 1024} \qquad \textbf{(B)} \text{ 1524} \qquad \textbf{(C)} \text{ 1533} \qquad \textbf{(D)} \text{ 1536} \qquad \textbf{(E)} \text{ 2048}$
Determine all positive integers $M$ such that the sequence $a_0, a_1, a_2, \cdots$ defined by \[ a_0 = M + \frac{1}{2} \qquad \textrm{and} \qquad a_{k+1} = a_k\lfloor a_k \rfloor \quad \textrm{for} \, k = 0, 1, 2, \cdots \] contains at least one integer term.
Let $B$ be a set of $k$ sequences each having $n$ terms equal to $1$ or $-1$. The product of two such sequences $(a_1, a_2, \ldots , a_n)$ and $(b_1, b_2, \ldots , b_n)$ is defined as $(a_1b_1, a_2b_2, \ldots , a_nb_n)$. Prove that there exists a sequence $(c_1, c_2, \ldots , c_n)$ such that the intersection of $B$ and the set containing all sequences from $B$ multiplied by $(c_1, c_2, \ldots , c_n)$ contains at most $\frac{k^2}{2^n}$ sequences.
Calculate the limit of the following sequences:
[b]a)[/b] n^{n!}/(n!)^n
[b]b)[/b] n^{ln n}/n!
[i]Adrian Troie[/i]
Turbo the snail sits on a point on a circle with circumference $1$. Given an infinite sequence of positive real numbers $c_1, c_2, c_3, \dots$, Turbo successively crawls distances $c_1, c_2, c_3, \dots$ around the circle, each time choosing to crawl either clockwise or counterclockwise.
Determine the largest constant $C > 0$ with the following property: for every sequence of positive real numbers $c_1, c_2, c_3, \dots$ with $c_i < C$ for all $i$, Turbo can (after studying the sequence) ensure that there is some point on the circle that it will never visit or crawl across.
Let $(x_n)_{n\geq 1}$ be an increasing and unbounded sequence of positive integers such that $x_1=1$ and $x_{n+1}\leq 2x_n$ for all $n\geq 1$. Prove that every positive integer can be written as a finite sum of distinct terms of the sequence.
[i]Note:[/i] Two terms $x_i$ and $x_j$ of the sequence are considered distinct if $i\neq j$.
Given an integer $c$, the sequence $a_0, a_1, a_2, ...$ is generated using the recurrence relation $a_0 = c$ and $a_i = a^i_{i-1} + 2021a_{i-1}$ for all $i \ge 1$. Given that $a_0 = c$, let $f(c)$ be the smallest positive integer $n$ such that $a_n - 1$ is a multiple of $47$. Compute $$\sum^{46}_{k=1} f(k).$$
Sequence $ \{ f_n(a) \}$ satisfies $ \displaystyle f_{n\plus{}1}(a) \equal{} 2 \minus{} \frac{a}{f_n(a)}$, $ f_1(a) \equal{} 2$, $ n\equal{}1,2, \cdots$. If there exists a natural number $ n$, such that $ f_{n\plus{}k}(a) \equal{} f_{k}(a), k\equal{}1,2, \cdots$, then we call the non-zero real $ a$ a $ \textbf{periodic point}$ of $ f_n(a)$.
Prove that the sufficient and necessary condition for $ a$ being a $ \textbf{periodic point}$ of $ f_n(a)$ is $ p_n(a\minus{}1)\equal{}0$, where $ \displaystyle p_n(x)\equal{}\sum_{k\equal{}0}^{\left[ \frac{n\minus{}1}{2} \right]} (\minus{}1)^k C_n^{2k\plus{}1}x^k$, here we define $ \displaystyle \frac{a}{0}\equal{} \infty$ and $ \displaystyle \frac{a}{\infty} \equal{} 0$.
An arithmetic sequence of five terms is considered $good$ if it contains 19 and 20. For example, $18.5,19.0,19.5,20.0,20.5$ is a $good$ sequence.
For every $good$ sequence, the sum of its terms is totalled. What is the total sum of all $good$ sequences?
Consider an infinite sequence of reals $x_1, x_2, x_3, ...$ such that $x_1 = 1$, $x_2 =\frac{2\sqrt3}{3}$ and with the recursive relationship $$n^2 (x_n - x_{n-1} - x_{n-2}) - n(3x_n + 2x_{n-1} + x_{n-2}) + (x_nx_{n-1}x_{n-2} + 2x_n) = 0.$$ Find $x_{2019}$.
Alexa wrote the first $16$ numbers of a sequence:
\[1, 2, 2, 3, 4, 4, 5, 6, 6, 7, 8, 8, 9, 10, 10, 11, …\]
Then she continued following the same pattern, until she had $2015$ numbers in total.
What was the last number she wrote?
For all positive integers $n$, the function $\gamma: \mathbb{Z}^+ \to \mathbb{Z}_{\geq 0}$ is defined as, $\gamma(1) = 0$ and for all $n > 1$, if the prime factorization of $n$ is $n = p_1^{\alpha_1} p_2^{\alpha_2} \dots p_k^{\alpha_k},$ then $\gamma(n) = \alpha_1 + \alpha_2 + \dots + \alpha_k$. We have an arithmetic sequence $X = \{x_i\}_{i=1}^{\infty}$. If for a positive integer $a > 1$, the sequence $\{ \gamma(a^{x_i} -1) \}$ is also an arithmetic sequence, show that the sequence $X$ has to be constant.
Let $(a,b)=(a_n,a_{n+1}),\forall n\in\mathbb{N}$ all be positive interger solutions that satisfies
$$1\leq a\leq b$$ and $$\dfrac{a^2+b^2+a+b+1}{ab}\in\mathbb{N}$$
And the value of $a_n$ is [b]only[/b] determined by the following recurrence relation:$ a_{n+2} = pa_{n+1} + qa_n + r$
Find $(p,q,r)$.
Find all pairs $(b,c)$ of positive integers, such that the sequence defined by $a_1=b$, $a_2=c$ and $a_{n+2}= \left| 3a_{n+1}-2a_n \right|$ for $n \geq 1$ has only finite number of composite terms.
[i]Proposed by Oleg Mushkarov and Nikolai Nikolov[/i]
The sequence $ (a_n)$ satisfies $ a_1 \equal{} 1$ and $ \displaystyle 5^{(a_{n\plus{}1}\minus{}a_n)} \minus{} 1 \equal{} \frac{1}{n\plus{}\frac{2}{3}}$ for $ n \geq 1$. Let $ k$ be the least integer greater than $ 1$ for which $ a_k$ is an integer. Find $ k$.
Let $B_n$ be the set of all sequences of length $n$, consisting of zeros and ones. For every two sequences $a,b \in B_n$ (not necessarily different) we define strings $\varepsilon_0\varepsilon_1\varepsilon_2 \dots \varepsilon_n$ and $\delta_0\delta_1\delta_2 \dots \delta_n$ such that $\varepsilon_0=\delta_0=0$ and $$
\varepsilon_{i+1}=(\delta_i-a_{i+1})(\delta_i-b_{i+1}), \quad \delta_{i+1}=\delta_i+(-1)^{\delta_i}\varepsilon_{i+1} \quad (0 \leq i \leq n-1).
$$. Let $w(a,b)=\varepsilon_0+\varepsilon_1+\varepsilon_2+\dots +\varepsilon_n$ . Find $f(n)=\sum\limits_{a,b \in {B_n}} {w(a,b)} $.
.