Found problems: 5923
Let the sequence $\{a_n\}$ for $n \ge 0$ be defined as $a_0 = c$, and for $n \ge 0$,
$$a_n =\frac{2a_{n-1}}{4a^2_{n-1} -1}.$$
Compute the sum of all values of $c$ such that $a_{2020}$ exists but $a_{2021}$ does not exist.
Let $a_0,a_1,a_2,\ldots $ be a sequence of positive real numbers satisfying $i\cdot a_2\ge (i + 1)\cdot a_{i_1}a_{i+1}$ for $i=1, 2, \ldots $ Furthermore, let $x$ and $y$ be positive reals, and let $b_i=xa_i+ya_{i-1}$ for $i=1, 2, \ldots $
Prove that the inequality $i\cdot b_2\ge (i + 1)\cdot b_{i-1}b_{i+1}$ holds for all integers $i\ge 2$.
Let $a_1, a_2, a_3,\ldots$ and $b_1, b_2, b_3,\ldots$ be infinite increasing arithmetic progressions. Their terms are positive numbers. It is known that the ratio $a_k/b_k$ is an integer for all k. Is it true that this ratio does not depend on $k{}$?
[i]Boris Frenkin[/i]
A positive integer $n$ is said to be a [i]perfect power[/i] if $n=a^b$ for some integers $a,b$ with $b>1$.
$(\text{a})$ Find $2004$ perfect powers in arithmetic progression.
$(\text{b})$ Prove that perfect powers cannot form an infinite arithmetic progression.
Let $ a_1 \geq a_2 \geq \ldots \geq a_n$ be real numbers such that for all integers $ k > 0,$
\[ a^k_1 \plus{} a^k_2 \plus{} \ldots \plus{} a^k_n \geq 0.\]
Let $ p \equal{}\max\{|a_1|, \ldots, |a_n|\}.$ Prove that $ p \equal{} a_1$ and that
\[ (x \minus{} a_1) \cdot (x \minus{} a_2) \cdots (x \minus{} a_n) \leq x^n \minus{} a^n_1\] for all $ x > a_1.$
Ana and Banana are playing a game. First Ana picks a word, which is defined to be a nonempty sequence of capital English letters. (The word does not need to be a valid English word.) Then Banana picks a nonnegative integer $k$ and challenges Ana to supply a word with exactly $k$ subsequences which are equal to Ana's word. Ana wins if she is able to supply such a word, otherwise she loses.
For example, if Ana picks the word "TST", and Banana chooses $k=4$, then Ana can supply the word "TSTST" which has 4 subsequences which are equal to Ana's word.
Which words can Ana pick so that she wins no matter what value of $k$ Banana chooses?
(The subsequences of a string of length $n$ are the $2^n$ strings which are formed by deleting some of its characters, possibly all or none, while preserving the order of the remaining characters.)
[i]Proposed by Kevin Sun
$ c$ is a positive integer. Consider the following recursive sequence: $ a_1\equal{}c, a_{n\plus{}1}\equal{}ca_{n}\plus{}\sqrt{(c^2\minus{}1)(a_n^2\minus{}1)}$, for all $ n \in N$.
Prove that all the terms of the sequence are positive integers.
Let $a_{1}=1$, $a_{2}=2$, $a_{3}$, $a_{4}$, $\cdots$ be the sequence of positive integers of the form $2^{\alpha}3^{\beta}$, where $\alpha$ and $\beta$ are nonnegative integers. Prove that every positive integer is expressible in the form \[a_{i_{1}}+a_{i_{2}}+\cdots+a_{i_{n}},\] where no summand is a multiple of any other.
The sequence an is defined by $a_0 = 4, a_1 = 1$ and the recurrence formula $a_{n+1} = a_n + 6a_{n-1}$. The sequence $b_n$ is given by
\[b_n=\sum_{k=0}^n \binom nk a_k.\]
Find the coefficients $\alpha,\beta$ so that $b_n$ satisfies the recurrence formula $b_{n+1} = \alpha b_n + \beta b_{n-1}$. Find the explicit form of $b_n$.
Let $P_0=(a_0,b_0),P_1=(a_1,b_1),P_2=(a_2,b_2)$ be points on the plane such that $P_0P_1P_2\Delta$ contains the origin $O$. Show that the areas of triangles $P_0OP_1,P_0OP_2,P_1OP_2$ form a geometric sequence in that order if and only if there exists a real number $x$, such that
$$
a_0x^2+a_1x+a_2=b_0x^2+b_1x+b_2=0
$$
Determine the values that \(n\) can take so that the equation in \( x \) $$ x^4-(3n+2)x^2+n^2=0$$ has four different real roots \( x_1\), \(x_2\), \(x_3\) and \(x_4\) in arithmetic progression. That is, they satisfy that $$x_4-x_3=x_3-x_2=x_2-x_1$$
$p$ is a polynomial with integer coefficients and for every natural $n$ we have $p(n)>n$. $x_k $ is a sequence that: $x_1=1, x_{i+1}=p(x_i)$ for every $N$ one of $x_i$ is divisible by $N.$ Prove that $p(x)=x+1$
Let $f:\mathbb N\rightarrow\mathbb N$ be a non-decreasing function and let $n$ be an arbitrary natural number. Suppose that there are prime numbers $p_1,p_2,\dots,p_n$ and natural numbers $s_1,s_2,\dots,s_n$ such that for each $1\leq i\leq n$ the set $\{f(p_ir+s_i)|r=1,2,\dots\}$ is an infinite arithmetic progression. Prove that there is a natural number $a$ such that
\[f(a+1), f(a+2), \dots, f(a+n)\]
form an arithmetic progression.
Find all of the sequences $a_1, a_2, a_3, . . .$ of real numbers that satisfy the following property: given any sequence $b_1, b_2, b_3, . . .$ of positive integers such that for all $n \ge 1$ we have $b_n \ne b_{n+1}$ and $b_n | b_{n+1}$, then the sub-sequence $a_{b_1}, a_{b_2}, a_{b_3}, . . .$ is an arithmetic progression.
The sequence of positive integers $a_0, a_1, a_2, . . .$ is defined by $a_0 = 3$ and $$a_{n+1} - a_n = n(a_n - 1)$$ for all $n \ge 0$. Determine all integers $m \ge 2$ for which $gcd (m, a_n) = 1$ for all $n \ge 0$.
Let $w$ be a circle and $AB$ a line not intersecting $w$. Given a point $P_{0}$ on $w$, define the sequence $P_{0},P_{1},\ldots $ as follows: $P_{n\plus{}1}$ is the second intersection with $w$ of the line passing through $B$ and the second intersection of the line $AP_{n}$ with $w$. Prove that for a positive integer $k$, if $P_{0}\equal{}P_{k}$ for some choice of $P_{0}$, then $P_{0}\equal{}P_{k}$ for any choice of $P_{0}$.
[i]Gheorge Eckstein[/i]
For a positive integer $n$, let $p(n)$ denote the number of prime divisors of $n$, counting multiplicity (i.e. $p(12)=3$). A sequence $a_n$ is defined such that $a_0 = 2$ and for $n > 0$, $a_n = 8^{p(a_{n-1})} + 2$. Compute $$\sum_{n=0}^{\infty} \frac{a_n}{2^n}$$
Let $a_1, a_2, \cdots, a_n$ be a sequence of real numbers with $a_1+a_2+\cdots+a_n=0$. Define the score $S(\sigma)$ of a permutation $\sigma=(b_1, \cdots b_n)$ of $(a_1, \cdots a_n)$ to be the minima of the sum $$(x_1-b_1)^2+\cdots+(x_n-b_n)^2$$ over all real numbers $x_1\le \cdots \le x_n$.
Prove that $S(\sigma)$ attains the maxima over all permutations $\sigma$, if and only if for all $1\le k\le n$, $$b_1+b_2+\cdots+b_k\ge 0.$$
[i]Proposed by Anzo Teh Zhao Yang[/i]
Let $x_0, x_1, . . . , x_{2014}$ be a sequence of real numbers, which for all $i < j$ satisfy $x_i + x_j \le 2j$. Determine the largest possible value of the sum $x_0 + x_1 + · · · + x_{2014}$.
let ${a_{n}}$ be a sequence of integers,$a_{1}$ is odd,and for any positive integer $n$,we have
$n(a_{n+1}-a_{n}+3)=a_{n+1}+a_{n}+3$,in addition,we have $2010$ divides $a_{2009}$
find the smallest $n\ge\ 2$,so that $2010$ divides $a_{n}$
Let $S$ be the set of the reciprocals of the first $2016$ positive integers and $T$ the set of all subsets of $S$ that form arithmetic progressions. What is the largest possible number of terms in a member of $T$?
[i]2016 CCA Math Bonanza Lightning #3.4[/i]
We are given $100$ strictly increasing sequences of positive integers: $A_{i}= (a_{1}^{(i)}, a_{2}^{(i)},...), i = 1, 2,..., 100$. For $1 \leq r, s \leq 100$ we define the following quantities: $f_{r}(u)=$ the number of elements of $A_{r}$ not exceeding $n$; $f_{r,s}(u) =$ the number of elements of $A_{r}\cap A_{s}$ not exceeding $n$. Suppose that $f_{r}(n) \geq\frac{1}{2}n$ for all $r$ and $n$. Prove that there exists a pair of indices $(r, s)$ with $r \not = s$ such that $f_{r,s}(n) \geq\frac{8n}{33}$ for at least five distinct $n-s$ with $1 \leq n < 19920.$
A sequence of integers, $\{a_{n}\}_{n \ge 1}$ with $a_{1}>0$, is defined by \[a_{n+1}=\frac{a_{n}}{2}\;\;\; \text{if}\;\; n \equiv 0 \;\; \pmod{4},\] \[a_{n+1}=3 a_{n}+1 \;\;\; \text{if}\;\; n \equiv 1 \; \pmod{4},\] \[a_{n+1}=2 a_{n}-1 \;\;\; \text{if}\;\; n \equiv 2 \; \pmod{4},\] \[a_{n+1}=\frac{a_{n}+1}{4}\;\;\; \text{if}\;\; n \equiv 3 \; \pmod{4}.\] Prove that there is an integer $m$ such that $a_{m}=1$.
Let $n$ be a fixed odd positive integer. For each odd prime $p$, define
$$a_p=\frac{1}{p-1}\sum_{k=1}^{\frac{p-1}{2}}\bigg\{\frac{k^{2n}}{p}\bigg\}.$$
Prove that there is a real number $c$ such that $a_p = c$ for infinitely many primes $p$.
[i]Note: $\left\{x\right\} = x - \left\lfloor x\right\rfloor$ is the fractional part of $x$.[/i]
In a sequence of natural numbers $ a_1,a_2,...,a_n$ every number $ a_k$ represents sum of the multiples of the $ k$ from sequence. Find all possible values for $ n$.