Let $(r_n)_{n\ge 0}$ be a sequence of positive real numbers such that $\lim_{n\to \infty} r_n = 0$. Let $S$ be the set of numbers representable as a sum \[ r_{i_1} + r_{i_2} +\cdots + r_{i_{1994}} ,\] with $i_1 < i_2 < \cdots< i_{1994}.$ Show that every nonempty interval $(a, b)$ contains a nonempty subinterval $(c, d)$ that does not intersect $S$.

Let $m,n$ be positive integers with $m \geq n$, and let $S$ be the set of all $n$-term sequences of positive integers $(a_1, a_2, \ldots a_n)$ such that $a_1 + a_2 + \cdots + a_n = m$. Show that \[\sum_S 1^{a_1} 2^{a_2} \cdots n^{a_n} = {n \choose n} n^m - {n \choose n-1} (n-1)^m + \cdots + (-1)^{n-2} {n \choose 2} 2^m + (-1)^{n-1} {n \choose 1}.\]

Suppose $\{ x_n \}_{n\geq 1}$ is a sequence of positive real numbers such that $x_1 \geq x_2 \geq x_3 \ldots \geq x_n \ldots$, and for all $n$ \[ \frac{x_1}{1} + \frac{x_4}{2} + \frac{x_9}{3} + \ldots + \frac{x_{n^2}}{n} \leq 1 . \] Show that for all $k$ \[ \frac{x_1}{1} + \frac{x_2}{2} +\ldots + \frac{x_k}{k} \leq 3. \]

Let $p>2$ be a prime. Define a sequence $(Q_{n}(x))$ of polynomials such that $Q_{0}(x)=1, Q_{1}(x)=x$ and $Q_{n+1}(x) =xQ_{n}(x) + nQ_{n-1}(x)$ for $n\geq 1.$ Prove that $Q_{p}(x)-x^p $ is divisible by $p$ for all integers $x.$

Let $a$ and $b$ be positive integers not divisible by $5$. A sequence of integers is constructed as follows: the first term is $5$, and every consequent term is obtained by multiplying its precedent by $a$ and adding $b$. (For example, if $a = 2$ and $b = 4$, the first three terms are $5,14,32$.) What is the maximum possible number of primes that can occur before encoutering the first composite term?

Let $a_0,a_1,\ldots$ be a sequence of positive integers such that $a_0=1$, and for all positive integers $n$, $a_n$ is the smallest composite number relatively prime to all of $a_0,a_1,\ldots,a_{n-1}$. Compute $a_{10}$. [i]2020 CCA Math Bonanza Lightning Round #4.2[/i]

For a positive integer $n$ define a sequence of zeros and ones to be [i]balanced[/i] if it contains $n$ zeros and $n$ ones. Two balanced sequences $a$ and $b$ are [i]neighbors[/i] if you can move one of the $2n$ symbols of $a$ to another position to form $b$. For instance, when $n = 4$, the balanced sequences $01101001$ and $00110101$ are neighbors because the third (or fourth) zero in the first sequence can be moved to the first or second position to form the second sequence. Prove that there is a set $S$ of at most $\frac{1}{n+1} \binom{2n}{n}$ balanced sequences such that every balanced sequence is equal to or is a neighbor of at least one sequence in $S$.

Let $a_{1}=1$, $a_{n}=\frac{1}{n} \sum_{k=1}^{n-1}a_{k}a_{n-k}$ for $n\geq 2$. Show that i) $\limsup_{n\to \infty} |a_{n}|^{\frac{1}{n}}<2^{-\frac{1}{2}}$; ii) $\limsup_{n\to \infty} |a_{n}|^{\frac{1}{n}}\geq \frac{2}{3}$

Prove that there exists $m \in \mathbb{N}$ such that there exists an integral sequence $\lbrace a_n \rbrace$ which satisfies: [b]I.[/b] $a_0 = 1, a_1 = 337$; [b]II.[/b] $(a_{n + 1} a_{n - 1} - a_n^2) + \frac{3}{4}(a_{n + 1} + a_{n - 1} - 2a_n) = m, \forall$ $n \geq 1$; [b]III. [/b]$\frac{1}{6}(a_n + 1)(2a_n + 1)$ is a perfect square $\forall$ $n \geq 1$.

Given an infinite sequence of numbers $a_1, a_2,...$, in which there are no two equal members. Segment $a_i, a_{i+1}, ..., a_{i+m-1}$ of this sequence is called a monotone segment of length $m$, if $a_i < a_{i+1} <...<a_{i+m-1}$ or $a_i > a_{i+1} >... > a_{i+m-1}$. It turned out that for each natural $k$ the term $a_k$ is contained in some monotonic segment of length $k + 1$. Prove that there exists a natural $N$ such that the sequence $a_N , a_{N+1} ,...$ monotonic.

Denote by $l(n)$ the largest prime divisor of $n$. Let $a_{n+1} = a_n + l(a_n)$ be a recursively defined sequence of integers with $a_1 = 2$. Determine all natural numbers $m$ such that there exists some $i \in \mathbb{N}$ with $a_i = m^2$. [i]Proposed by Nikola Velov, North Macedonia[/i]

Source: 2018 Canadian Open Math Challenge Part C Problem 4 ----- Given a positive integer $N$, Matt writes $N$ in decimal on a blackboard, without writing any of the leading 0s. Every minute he takes two consicutive digits, erases them, and replaces them with the last digit of their product. Any leading zeroes created this way are also erased. He repeats this process for as long as he likes. We call the positive integer $M$ [i]obtainable[/i] from $N$ if starting from $N$, there is a finite sequence of moves that Matt can make to produce the number $M$. For example, 10 is obtainible from 251023 via \[2510\underline{23}\rightarrow\underline{25} 106\rightarrow 1\underline{06}\rightarrow 10\] $\text{(a)}$ Show that 2018 is obtainablefrom 2567777899. $\text{(b)}$ Find two positive integers $A$ and $B$ for which there is no positive integer $C$ [color=transparent](B.)[/color] such that both $A$ and $B$ are obtainablefrom $C$ $\text{(c)}$ Let $S$ be any finite set of positive integers, none of which contains the digit 5 [color=transparent](C.)[/color] in its decimal representation. Prove that there exists a positive integer $N$ [color=transparent](C.)[/color] for which all elements of $S$ are obtainable from $N$.

[b]p1.[/b] What is $7\%$ of one half of $11\%$ of $20000$ ? [b]p2.[/b] Three circles centered at $A, B$, and $C$ are tangent to each other. Given that $AB = 8$, $AC = 10$, and $BC = 12$, find the radius of circle $ A$. [b]p3. [/b]How many positive integer values of $x$ less than $2012$ are there such that there exists an integer $y$ for which $\frac{1}{x} +\frac{2}{2y+1} =\frac{1}{y}$ ? [b]p4. [/b]The positive difference between $ 8$ and twice $x$ is equal to $11$ more than $x$. What are all possible values of $x$? [b]p5.[/b] A region in the coordinate plane is bounded by the equations $x = 0$, $x = 6$, $y = 0$, and $y = 8$. A line through $(3, 4)$ with slope $4$ cuts the region in half. Another line going through the same point cuts the region into fourths, each with the same area. What is the slope of this line? [b]p6.[/b] A polygon is composed of only angles of degrees $138$ and $150$, with at least one angle of each degree. How many sides does the polygon have? [b]p7.[/b] $M, A, T, H$, and $L$ are all not necessarily distinct digits, with $M \ne 0$ and $L \ne 0$. Given that the sum $MATH +LMT$, where each letter represents a digit, equals $2012$, what is the average of all possible values of the three-digit integer $LMT$? [b]p8. [/b]A square with side length $\sqrt{10}$ and two squares with side length $\sqrt{7}$ share the same center. The smaller squares are rotated so that all of their vertices are touching the sides of the larger square at distinct points. What is the distance between two such points that are on the same side of the larger square? [b]p9.[/b] Consider the sequence $2012, 12012, 20120, 20121, ...$. This sequence is the increasing sequence of all integers that contain “$2012$”. What is the $30$th term in this sequence? [b]p10.[/b] What is the coefficient of the $x^5$ term in the simplified expansion of $(x +\sqrt{x} +\sqrt[3]{x})^{10}$ ? PS. You had better use hide for answers.

Let $k$ be a fixed positive integer. The sequence $\{a_{n}\}_{n\ge1}$ is defined by \[a_{1}=k+1, a_{n+1}=a_{n}^{2}-ka_{n}+k.\] Show that if $m \neq n$, then the numbers $a_{m}$ and $a_{n}$ are relatively prime.

A sequence $(a_{n})$ is defined by $a_{1}= 1$ and $a_{n}= a_{1}a_{2}...a_{n-1}+1$ for $n \geq 2.$ Find the smallest real number $M$ such that $\sum_{n=1}^{m}\frac{1}{a_{n}}<M\; \forall m\in\mathbb{N}$.