Found problems: 5923
Let the sequence $ \{a_n\}_{n\geq 1}$ be defined by $ a_1 \equal{} 20$, $ a_2 \equal{} 30$ and $ a_{n \plus{} 2} \equal{} 3a_{n \plus{} 1} \minus{} a_n$ for all $ n\geq 1$. Find all positive integers $ n$ such that $ 1 \plus{} 5a_n a_{n \plus{} 1}$ is a perfect square.
Let $a_1 \leq a_2 \leq \cdots$ be a non-decreasing sequence of positive integers. A positive integer $n$ is called [i]good[/i] if there is an index $i$ such that $n=\dfrac{i}{a_i}$.
Prove that if $2013$ is [i]good[/i], then so is $20$.
A frog begins at $P_0 = (0,0)$ and makes a sequence of jumps according to the following rule: from $P_n=(x_n,y_n)$, the frog jumps to $P_{n+1}$, which may be any of the points $(x_n+7, y_n+2)$, $(x_n+2,y_n+7)$, $(x_n-5, y_n-10)$, or $(x_n-10,y_n-5)$. There are $M$ points $(x,y)$ with $|x|+|y| \le 100$ that can be reached by a sequence of such jumps. Find the remainder when $M$ is divided by $1000$.
Is there an infinite sequence of positive integers $\{a_n\}_{n = 1}^{\infty}$ which contains each positive integer exactly once and is such that the number $a_n + a_{n + 1} $ is a perfect square for each $n$?
The sequence of integers $a_1,a_2,a_3 ,.. $such that $a_1 = 1$, $a_2 = 2$ and for every natural $n \ge 1$
$$a_{n+2}=\begin{cases} 2001a_{n+1} - 1999a_n , \text{\,\,if\,\,the\,\,product\,\,} a_{n+1}a_n \text{is\,\,an\,\,even\,\,number} /\\
a_{n+1}-a_n , \text{\,\,if\,\,the\,\,product\,\,} a_{n+1}a_n \text{is\,\,an\,\,odd\,\,number} \end{cases}$$
Is there such a natural $m$ that $a_m= 2000$?
The sequence $\{a_n\}$ satisfies $a_1 = \frac{1}{2}$, $a_2 = \frac{3}{8}$, and $a_{n + 1}^2 + 3 a_n a_{n + 2} = 2 a_{n + 1} (a_n + a_{n + 2}) (n \in \mathbb{N^*})$.
$(1)$ Determine the general formula of the sequence $\{a_n\}$;
$(2)$ Prove that for any positive integer $n$, there is $0 < a_n < \frac{1}{\sqrt{2n + 1}}$.
Seven two-digit integers form a strictly increasing arithmetic sequence. If the first and last terms of this sequence have the same set of digits, what is the sum of all possible medians of the sequence?
In an urn there are n balls numbered $1, 2, \cdots, n$. They are drawn at random one by one without replacement and the numbers are recorded. What is the probability that the resulting random permutation has only one local maximum?
A term in a sequence is a local maximum if it is greater than all its neighbors.
Let $(u_n)$ be a sequence of real numbers which satisfies
$$u_{n+2}=|u_{n+1}|-u_n\qquad\text{for all }n\in\mathbb N.$$Prove that there exists a positive integer $p$ such that $u_n=u_{n+p}$ holds for all $n\in\mathbb N$.
Let $a_1,a_2,\ldots$ be a sequence of integers with infinitely many positive and negative terms. Suppose that for every positive integer $n$ the numbers $a_1,a_2,\ldots,a_n$ leave $n$ different remainders upon division by $n$.
Prove that every integer occurs exactly once in the sequence $a_1,a_2,\ldots$.
a) Prove that for each positive integer $n$ there is a unique positive integer $a_n$ such that $$(1 + \sqrt5)^n =\sqrt{a_n} + \sqrt{a_n+4^n} . $$
b) Prove that $a_{2010}$ is divisible by $5\cdot 4^{2009}$ and find the quotient
Define the Fibanocci sequence recursively by $F_1=1$, $F_2=1$ and $F_{i+2} = F_i + F_{i+1}$ for all $i$. Prove that for all integers $b,c>1$, there exists an integer $n$ such that the sum of the digits of $F_n$ when written in base $b$ is greater than $c$.
[i]Proposed by Ryan Alweiss[/i]
Let $c$ be a positive integer. The sequence $\{f_n\}$ is defined as follows:
\[f_1 = 1, f_2 = c, f_{n+1} = 2f_n - f_{n-1} + 2 \quad (n \geq 2).\]
Show that for each $k \in \mathbb N$ there exists $r \in \mathbb N$ such that $f_kf_{k+1}= f_r.$
[b]a)[/b] Let be a continuous function $ f:\mathbb{R}_{\ge 0}\longrightarrow\mathbb{R}_{>0} . $ Show that there exists a natural number $ n_0 $ and a sequence of positive real numbers $ \left( x_n \right)_{n>n_0} $ that satisfy the following relation.
$$ n\int_0^{x_n} f(t)dt=1,\quad n_0<\forall n\in\mathbb{N} $$
[b]b)[/b] Prove that the sequence $ \left( nx_n \right)_{n> n_0} $ is convergent and find its limit.
Let $\, a$, and $b \,$ be odd positive integers. Define the sequence $\{f_n\}_{n\ge 1}$ by putting $\, f_1 = a,$ $f_2 = b, \,$ and by letting $\, f_n \,$ for $\, n \geq 3 \,$ be the greatest odd divisor of $\, f_{n-1} + f_{n-2}$. Show that $\, f_n \,$ is constant for sufficiently large $\, n \,$ and determine the eventual value as a function of $\, a \,$ and $\, b$.
Jacob uses the following procedure to write down a sequence of numbers. First he chooses the first term to be $ 6$. To generate each succeeding term, he flips a fair coin. If it comes up heads, he doubles the previous term and subtracts $ 1$. If it comes up tails, he takes half of the previous term and subtracts $ 1$. What is the probability that the fourth term in Jacob's sequence is an integer?
$ \textbf{(A)}\ \frac{1}{6} \qquad
\textbf{(B)}\ \frac{1}{3} \qquad
\textbf{(C)}\ \frac{1}{2} \qquad
\textbf{(D)}\ \frac{5}{8} \qquad
\textbf{(E)}\ \frac{3}{4}$
For any function $f:[0,1]\to [0,1]$, let $P_n (f)$ denote the number of fixed points of the function $\underbrace{f(f(\dotsc f}_{n} (x)\dotsc )$, i.e., the number of points $x\in [0,1]$ satisfying $\underbrace{f(f(\dotsc f}_{n} (x)\dotsc )=x$. Construct a piecewise linear, continuous, surjective function $f:[0,1] \to [0,1]$ such that for a suitable $2<A<3$, the sequence $\frac{P_n(f)}{A^n}$ converges.
[i]Based on the 8th problem of the Miklós Schweitzer competition, 2018[/i]
Let $a_1$, $a_2, \dots, a_{2015}$ be a sequence of positive integers in $[1,100]$.
Call a nonempty contiguous subsequence of this sequence [i]good[/i] if the product of the integers in it leaves a remainder of $1$ when divided by $101$.
In other words, it is a pair of integers $(x, y)$ such that $1 \le x \le y \le 2015$ and \[a_xa_{x+1}\dots a_{y-1}a_y \equiv 1 \pmod{101}. \]Find the minimum possible number of good subsequences across all possible $(a_i)$.
[i]Proposed by Yang Liu[/i]
Determine all sequences of equal ratios of the form
\[
\frac{a_1}{a_2} = \frac{a_3}{a_4} = \frac{a_5}{a_6} = \frac{a_7}{a_8}
\]
which simultaneously satisfy the following conditions:
$\bullet$ The set $\{ a_1, a_2, \ldots , a_8 \}$ represents all positive divisors of $24$.
$\bullet$ The common value of the ratios is a natural number.
A sequence $\{a_n\} $ satisfies $a_1$ is a positive integer and $a_{n+1}$ is the largest odd integer that divides $2^n-1+a_n$ for all $n\geqslant 1$. Given a positive integer $r$ which is greater than $1$. Is it possible that there exists infinitely many pairs of ordered positive integers $(m,n)$ for which $m>n$ and $a_m = ra_n$?
In other words, if you successfully find [b]an[/b] $a_1$ that yields infinitely many pairs of $(m,n)$ which work fine, you win and the answer is YES. Otherwise you have to proof NO for every possible $a_1$.
@below, XMO stands for Xueersi Mathematical Olympiad, where Xueersi (学而思) is a famous tutoring camp in China.
The sum to infinity of the terms of an infinite geometric progression is $ 6$. The sum of the first two terms is $ 4\frac {1}{2}$. The first term of the progression is:
$ \textbf{(A)}\ 3 \text{ or } 1\frac {1}{2} \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2\frac {1}{2} \qquad\textbf{(D)}\ 6 \qquad\textbf{(E)}\ 9 \text{ or } 3$
Determine all real values of the parameter $a$ for which the equation
\[16x^4 -ax^3 + (2a + 17)x^2 -ax + 16 = 0\]
has exactly four distinct real roots that form a geometric progression.
$f: (0,1) \rightarrow [0, \infty)$ is zero except at a countable set of points $a_{1}, a_2, a_3, ... $ . Let $b_n = f(a_n)$. Show that if $\sum b_{n}$ converges, then $f$ is differentiable at at least one point. Show that for any sequence $b_{n}$ of non-negative reals with $\sum b_{n} =\infty$ , we can find a sequence $a_{n}$ such that the function $f$ defined as above is nowhere differentiable.
Let $ \{ f_n \}$ be a sequence of Lebesgue-integrable functions on $ [0,1]$ such that for any Lebesgue-measurable subset $ E$ of $ [0,1]$ the sequence $ \int_E f_n$ is convergent. Assume also that $ \lim_n f_n\equal{}f$ exists almost everywhere. Prove that $ f$ is integrable and $ \int_E f\equal{}\lim_n \int_E f_n$. Is the assertion also true if $ E$ runs only over intervals but we also assume $ f_n \geq 0 ?$ What happens if $ [0,1]$ is replaced by $ [0,\plus{}\infty) ?$
[i]J. Szucs[/i]
For a set \(S\) of positive integers and a positive integer \(n\), consider the game of [i]\((n,S)\)-nim[/i], which is as follows. A pile starts with \(n\) watermelons. Two players, Deric and Erek, alternate turns eating watermelons from the pile, with Deric going first. On any turn, the number of watermelons eaten must be an element of \(S\). The last player to move wins. Let \(f(S)\) denote the set of positive integers \(n\) for which Deric has a winning strategy in \((n,S)\)-nim.
Let \(T\) be a set of positive integers. Must the sequence \[T, \; f(T), \; f(f(T)), \;\ldots\] be eventually constant?
[i]Proposed by Brandon Wang and Edward Wan[/i]