Found problems: 5923
Let $k$ be a positive integer. Show that if there exists a sequence $a_0,a_1,\ldots$ of integers satisfying the condition \[a_n=\frac{a_{n-1}+n^k}{n}\text{ for all } n\geq 1,\] then $k-2$ is divisible by $3$.
[i]Proposed by Okan Tekman, Turkey[/i]
Find the maximum number of increasing arithmetic progressions that can have a finite sequence of real numbers $a_1<a_2<\cdots<a_n$ of $n\ge 3$ real numbers.
Consider the sequence $a_1, a_2, a_3, ...$ defined by $a_1 = 9$ and
$a_{n + 1} = \frac{(n + 5)a_n + 22}{n + 3}$
for $n \ge 1$.
Find all natural numbers $n$ for which $a_n$ is a perfect square of an integer.
Let $n$ be an integer greater than 2. A positive integer is said to be [i]attainable [/i]if it is 1 or can be obtained from 1 by a sequence of operations with the following properties:
1.) The first operation is either addition or multiplication.
2.) Thereafter, additions and multiplications are used alternately.
3.) In each addition, one can choose independently whether to add 2 or $n$
4.) In each multiplication, one can choose independently whether to multiply by 2 or by $n$.
A positive integer which cannot be so obtained is said to be [i]unattainable[/i].
[b]a.)[/b] Prove that if $n\geq 9$, there are infinitely many unattainable positive integers.
[b]b.)[/b] Prove that if $n=3$, all positive integers except 7 are attainable.
The angles of a pentagon are in arithmetic progression. One of the angles in degrees, must be:
$ \textbf{(A)}\ 108 \qquad
\textbf{(B)}\ 90 \qquad
\textbf{(C)}\ 72 \qquad
\textbf{(D)}\ 54 \qquad
\textbf{(E)}\ 36$
The set $ \{a_0, a_1, \ldots, a_n\}$ of real numbers satisfies the following conditions:
[b](i)[/b] $ a_0 \equal{} a_n \equal{} 0,$
[b](ii)[/b] for $ 1 \leq k \leq n \minus{} 1,$ \[ a_k \equal{} c \plus{} \sum^{n\minus{}1}_{i\equal{}k} a_{i\minus{}k} \cdot \left(a_i \plus{} a_{i\plus{}1} \right)\]
Prove that $ c \leq \frac{1}{4n}.$
Given an integer $ n\ge 2$, find the maximal constant $ \lambda (n)$ having the following property: if a sequence of real numbers $ a_{0},a_{1},a_{2},\cdots,a_{n}$ satisfies $ 0 \equal{} a_{0}\le a_{1}\le a_{2}\le \cdots\le a_{n},$ and $ a_{i}\ge\frac {1}{2}(a_{i \plus{} 1} \plus{} a_{i \minus{} 1}),i \equal{} 1,2,\cdots,n \minus{} 1,$ then $ (\sum_{i \equal{} 1}^n{ia_{i}})^2\ge \lambda (n)\sum_{i \equal{} 1}^n{a_{i}^2}.$
Let $a,b\in \mathbb{R}$. Evaluate:
\[\lim_{n\to \infty}\left(\sqrt{a^2n^2+bn}-an\right)\]
Consider the sequence $(x_n)_{n\ge 1}$, defined by $x_n=\sqrt{n}-\lfloor \sqrt{n}\rfloor$. Denote by $A$ the set of the points $x\in \mathbb{R}$, for which there is a subsequence of $(x_n)_{n\ge 1}$ tending to $x$.
a) Prove that $\mathbb{Q}\cap [0,1]\subset A$.
b) Find $A$.
(a) Prove that the number of all digits in the sequence $1, 2, 3,... , 10^8$ is equal to the number of all zeros in the sequence $1, 2, 3, ... , 10^9$.
(b) Prove that the number of all digits in the sequence $1, 2, 3, ... , 10^k$ is equal to the number of all zeros in the sequence $1, 2, 3, ... , 10^{k+1}$.
For each non-negative integer $n$ find the sum of all $n$-digit numbers with the digits in a decreasing sequence.
[I]Proposed by P. Kozhevnikov[/I]
Esmeralda chooses two distinct positive integers \(a\) and \(b\), with \(b > a\), and writes the equation
\[
x^2 - ax + b = 0
\]
on the board. If the equation has distinct positive integer roots \(c\) and \(d\), with \(d > c\), she writes the equation
\[
x^2 - cx + d = 0
\]
on the board. She repeats the procedure as long as she obtains distinct positive integer roots. If she writes an equation for which this does not occur, she stops.
a) Show that Esmeralda can choose \(a\) and \(b\) such that she will write exactly 2024 equations on the board.
b) What is the maximum number of equations she can write knowing that one of the initially chosen numbers is 2024?
Let $n$ be a positive integer. Starting with the sequence $1,\frac{1}{2}, \frac{1}{3} , \cdots , \frac{1}{n}$, form a new sequence of $n -1$ entries $\frac{3}{4}, \frac{5}{12},\cdots ,\frac{2n -1}{2n(n -1)}$, by taking the averages of two consecutive entries in the first sequence. Repeat the averaging of neighbors on the second sequence to obtain a third sequence of $n -2$ entries and continue until the final sequence consists of a single number $x_n$. Show that $x_n < \frac{2}{n}$.
A sequence \( a_1, a_2, \ldots \) of real numbers satisfies the following condition: for every positive integer \( k \geq 2 \), there exists a positive integer \( i < k \) such that \( a_i + a_k = k \). It is known that for some \( j \), the fractional parts of the numbers \( a_j \) and \( a_{j+1} \) are equal. Prove that for some positive integers \( x \neq y \), the equality
\[
a_x - a_y = x - y
\]
holds.
[i]The fractional part of a real number \( a \) is defined as the number \( \{a\} \in [0, 1) \), which satisfies the condition \( a = n + \{a\} \), where \( n \) is an integer. For example, \( \{-3\} = 0 \), \( \{3.14\} = 0.14 \), and \( \{-3.14\} = 0.86 \).[/i]
[i]Proposed by Mykhailo Shtandenko[/i]
Let $ABC$ be a triangle whose inscribed circle is $\omega$. Let $r_1$ be the line parallel to $BC$ and tangent to $\omega$, with $r_1 \ne BC$ and let $r_2$ be the line parallel to $AB$ and tangent to $\omega$ with $r_2 \ne AB$. Suppose that the intersection point of $r_1$ and $r_2$ lies on the circumscribed circle of triangle $ABC$. Prove that the sidelengths of triangle $ABC$ form an arithmetic progression.
A sequence of $28$ letters consists of $14$ of each of the letters $A$ and $B$ arranged in random order. The expected number of times that $ABBA$ appears as four consecutive letters in that sequence is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$.
Given a sequence $\{ a_{n}\}$ such that $a_{n+1}=a_{n}+\frac{1}{2006}a_{n}^{2}$ , $n \in N$, $a_{0}=\frac{1}{2}$.
Prove that $1-\frac{1}{2008}< a_{2006}< 1$.
Two geometric sequences $ a_1,a_2,a_3,\ldots$ and $b_1,b_2,b_3\ldots $have the same common ratio, with $a_1=27$,$b_1=99$, and $a_{15}=b_{11}$. Find $a_9.$
Prove that the sequence $a_{n}=\lfloor n\sqrt 2 \rfloor+\lfloor n\sqrt 3 \rfloor$ contains infintely many even and infinitely many odd numbers.
A sequence of real numbers $a_1,a_2,\ldots$ satisfies the relation
$$a_n=-\max_{i+j=n}(a_i+a_j)\qquad\text{for all}\quad n>2017.$$
Prove that the sequence is bounded, i.e., there is a constant $M$ such that $|a_n|\leq M$ for all positive integers $n$.
Let a sequences: $ x_0\in [0;1],x_{n\plus{}1}\equal{}\frac56\minus{}\frac43 \Big|x_n\minus{}\frac12\Big|$. Find the "best" $ |a;b|$ so that for all $ x_0$ we have $ x_{2009}\in [a;b]$
Triangle $AB_0C_0$ has side lengths $AB_0 = 12$, $B_0C_0 = 17$, and $C_0A = 25$. For each positive integer $n$, points $B_n$ and $C_n$ are located on $\overline{AB_{n-1}}$ and $\overline{AC_{n-1}}$, respectively, creating three similar triangles $\triangle AB_nC_n \sim \triangle B_{n-1}C_nC_{n-1} \sim \triangle AB_{n-1}C_{n-1}$. The area of the union of all triangles $B_{n-1}C_nB_n$ for $n\geq1$ can be expressed as $\tfrac pq$, where $p$ and $q$ are relatively prime positive integers. Find $q$.
Let $a_0$ be a positive integer. Define the sequence $\{a_n\}_{n \geq 0}$ as follows: if \[ a_n = \sum_{i = 0}^jc_i10^i \] where $c_i \in \{0,1,2,\cdots,9\}$, then \[ a_{n + 1} = c_0^{2005} + c_1^{2005} + \cdots + c_j^{2005}. \] Is it possible to choose $a_0$ such that all terms in the sequence are distinct?
Let $F_0 = 0, F_1 = 1$ and $F_{n+1} = F_n + F_{n-1}$, for all positive integer $n$, be the Fibonacci sequence.
Prove that for any positive integer $m$ there exist infinitely many positive integers $n$ such that
$F_n + 2 \equiv F_{n+1} + 1 \equiv F_{n+2}$ mod $m$ .
For every real number $x_1$, construct the sequence $x_1,x_2,\ldots$ by setting: \[ x_{n+1}=x_n(x_n+{1\over n}). \] Prove that there exists exactly one value of $x_1$ which gives $0<x_n<x_{n+1}<1$ for all $n$.
Kara rolls a six-sided die, and if on that first roll she rolls an $n$, she rolls the die $n-1$ more times. She then computes that the product of all her rolls, including the first, is $8$. How many distinct sequences of rolls could Kara have rolled?
[i]Proposed by Andrew Wu[/i]