Found problems: 5923
It is given sequence wih length of $2017$ which consists of first $2017$ positive integers in arbitrary order (every number occus exactly once). Let us consider a first term from sequence, let it be $k$. From given sequence we form a new sequence of length 2017, such that first $k$ elements of new sequence are same as first $k$ elements of original sequence, but in reverse order while other elements stay unchanged. Prove that if we continue transforming a sequence, eventually we will have sequence with first element $1$.
Given a non-decreasing unbounded sequence $a_n,$ construct a new sequence $b_n$ as follows
$$b_n = \frac{a_2 - a_1}{a_2} + \frac{a_3 - a_2}{a_3} + ... + \frac{a_n - a_{n-1}}{a_n}$$
Prove that $b_n$ is also unbounded.
Prove that the numbers $A,B$ and $C$ are equal, where:
- $A=$ number of ways that we can cover a $2 \times n$ rectangle with $2 \times 1$ retangles.
- $B=$ number of sequences of ones and twos that add up to $n$
- $C= \sum^m_{k=0} \binom{m + k}{2 \cdot k}$ if $n = 2 \cdot m,$ and
- $C= \sum^m_{k=0} \binom{m + k + 1}{2 \cdot k + 1}$ if $n = 2 \cdot m + 1.$
Given real numbers $x_i \ (i = 1, 2, \cdots, 4k + 2)$ such that
\[\sum_{i=1}^{4k +2} (-1)^{i+1} x_ix_{i+1} = 4m \qquad ( \ x_1=x_{4k+3} \ )\]
prove that it is possible to choose numbers $x_{k_{1}}, \cdots, x_{k_{6}}$ such that
\[\sum_{i=1}^{6} (-1)^{i} k_i k_{i+1} > m \qquad ( \ x_{k_{1}} = x_{k_{7}} \ )\]
What is the $100th$ number in the arithmetic sequence: $ 1,5,9,13,17,21,25,... $
$ \text{(A)}\ 397\qquad\text{(B)}\ 399\qquad\text{(C)}\ 401\qquad\text{(D)}\ 403\qquad\text{(E)}\ 405 $
Jerry starts at 0 on the real number line. He tosses a fair coin 8 times. When he gets heads, he moves 1 unit in the positive direction; when he gets tails, he moves 1 unit in the negative direction. The probability that he reaches 4 at some time during this process is $a/b$, where $a$ and $b$ are relatively prime positive integers. What is $a+b$? (For example, he succeeds if his sequence of tosses is $HTHHHHHH$.)
$\textbf{(A)}\ 69\qquad\textbf{(B)}\ 151\qquad\textbf{(C)}\ 257\qquad\textbf{(D)}\ 293\qquad\textbf{(E)}\ 313$
The Fibonacci sequence $F_n$ is defined by $F_0=0,F_1=1$ and the recurrence relation $F_n=F_{n-1}+F_{n-2}$ for all integers $n\geq2$. Let $p\geq3$ be a prime number.
[list=a]
[*] Prove that $F_{p-1}+F_{p+1}-1$ is divisible by $p$.
[*] Prove that $F_{p^{k+1}-1}+F_{p^{k+1}+1}-\left(F_{p^k-1}+F_{p^k+1}\right)$ is divisible by $p^{k+1}$ for any positive integer $k$.
[/list]
Let ${a_1,a_2,\dots,a_n}$ be positive real numbers, ${n>1}$. Denote by $g_n$ their geometric mean, and by $A_1,A_2,\dots,A_n$ the sequence of arithmetic means defined by \[ A_k=\frac{a_1+a_2+\cdots+a_k}{k},\qquad k=1,2,\dots,n. \] Let $G_n$ be the geometric mean of $A_1,A_2,\dots,A_n$. Prove the inequality \[
n \root n\of{\frac{G_n}{A_n}}+ \frac{g_n}{G_n}\le n+1 \] and establish the cases of equality.
[i]Proposed by Finbarr Holland, Ireland[/i]
Find the number of arithmetic sequences $a_1,a_2,a_3$ of three nonzero integers such that the sum of the terms in the sequence is equal to the product of the terms in the sequence.
[i]Proposed by Sammy Charney[/i]
A bitstring of length $\ell$ is a sequence of $\ell$ $0$'s or $1$'s in a row. How many bitstrings of length $2014$ have at least $2012$ consecutive $0$'s or $1$'s?
The interior angles of a convex polygon form an arithmetic progression with a common difference of $4^\circ$. Determine the number of sides of the polygon if its largest interior angle is $172^\circ.$
Define real number $y$ as the fractional part of real number $x$ such that $0\leq y<1$ and $x-y$ is integer. Denote this by $<x>$.
For real number $a$, define an infinite sequence $\{a_n\}\ (n=1,\ 2,\ 3,\ \cdots)$ inductively as follows.
(i) $a_1=<a>$
(ii) If $a\n\neq 0$, then $a_{n+1}=\left<\frac{1}{a_n}\right>$,
if $a_n=0$, then $a_{n+1}=0$.
(1) For $a=\sqrt{2}$, find $a_n$.
(2) For any natural number $n$, find real number $a\geq \frac 13$ such that $a_n=a$.
(3) Let $a$ be a rational number. When we express $a=\frac{p}{q}$ with integer $p$, natural number $q$, prove that $a_n=0$ for any natural number $n\geq q$.
[i]2011 Tokyo University entrance exam/Science, Problem 2[/i]
When the natural numbers are written one after another in an increasing way, you get an infinite succession of digits $123456789101112 ....$ Denote $A_k$ the number formed by the first $k$ digits of this sequence . Prove that for all positive integer $n$ there is a positive integer $m$ which simultaneously verifies the following three conditions:
(i) $n$ divides $A_m$,
(ii) $n$ divides $m$,
(iii) $n$ divides the sum of the digits of $A_m$.
A student wrote down the following sequence of numbers : the first number is 1, the second number is 2, and after that, each number is obtained by adding together all the previous numbers. Determine the 12th number in the sequence.
Let $\{a_{n}\}_{n \ge 1}$ be a sequence of positive integers such that \[0 < a_{n+1}-a_{n}\le 2001 \;\; \text{for all}\;\; n \in \mathbb{N}.\] Show that there are infinitely many pairs $(p, q)$ of positive integers such that $p>q$ and $a_{q}\; \vert \; a_{p}$.
Let $\Lambda= \{1, 2, \ldots, 2v-1,2v\}$ and $P=\{\alpha_1, \alpha_2, \ldots, \alpha_{2v-1}, \alpha_{2v}\}$ be a permutation of the elements of $\Lambda$.
(a) Prove that
$$\sum_{i=1}^v \alpha_{2i-1}\alpha_{2i} \leq \sum_{i=1}^v (2i-1)2i.$$
(b) Determine the largest positive integer $m$ such that we can partition the $m\times m$ square into $7$ rectangles for which every pair of them has no common interior points and their lengths and widths form the following sequence:
$$1,2,3,4,5,6,7,8,9,10,11,12,13,14.$$
Determine the maximal length $L$ of a sequence $a_1,\dots,a_L$ of positive integers satisfying both the following properties:
[list=disc]
[*]every term in the sequence is less than or equal to $2^{2023}$, and
[*]there does not exist a consecutive subsequence $a_i,a_{i+1},\dots,a_j$ (where $1\le i\le j\le L$) with a choice of signs $s_i,s_{i+1},\dots,s_j\in\{1,-1\}$ for which \[s_ia_i+s_{i+1}a_{i+1}+\dots+s_ja_j=0.\]
[/list]
[b]4.[/b] We see, in Figures 1 and 2, examples of lock screens from a cellphone that only works with a password that is not typed but drawn with straight line segments. Those segments form a polygonal line with vertices in a lattice. When drawing the pattern that corresponds to a password, the finger can't lose contact with the screen. Every polygonal line corresponds to a sequence of digits and this sequence is, in fact, the password. The tracing of the polygonal obeys the following rules:
[i]i.[/i] The tracing starts at some of the detached points which correspond to the digits from $1$ to $9$ (Figure 3).
[i]ii.[/i] Each segment of the pattern must have as one of its extremes (on which we end the tracing of the segment) a point that has not been used yet.
[i]iii.[/i] If a segment connects two points and contains a third one (its middle point), then the corresponding digit to this third point is included in the password. That does not happen if this point/digit has already been used.
[i]iv.[/i] Every password has at least four digits.
Thus, every polygonal line is associated to a sequence of four or more digits, which appear in the password in the same order that they are visited. In Figure 1, for instance, the password is 218369, if the first point visited was $2$. Notice how the segment connecting the points associated with $3$ and $9$ includes the points associated to digit $6$. If the first visited point were the $9$, then the password would be $963812$. If the first visited point were the $6$, then the password would be $693812$. In this case, the $6$ would be skipped, because it can't be repeated. On the other side, the polygonal line of Figure 2 is associated to a unique password.
Determine the smallest $n (n \geq 4)$ such that, given any subset of $n$ digits from $1$ to $9$, it's possible to elaborate a password that involves exactly those digits in some order.
Lisa writes a positive whole number in the decimal system on the blackboard and now makes in each turn the following:
The last digit is deleted from the number on the board and then the remaining shorter number (or 0 if the number was one digit) becomes four times the number deleted number added. The number on the board is now replaced by the result of this calculation.
Lisa repeats this until she gets a number for the first time was on the board.
(a) Show that the sequence of moves always ends.
(b) If Lisa begins with the number $53^{2022} - 1$, what is the last number on the board?
Example: If Lisa starts with the number $2022$, she gets $202 + 4\cdot 2 = 210$ in the first move and overall the result $$2022 \to 210 \to 21 \to 6 \to 24 \to 18 \to 33 \to 15 \to 21$$.
Since Lisa gets $21$ for the second time, the turn order ends.
[i](Stephan Pfannerer)[/i]
Let the sequence $\{x_n\}$ be defined by $x_1 \in \{5, 7\}$ and, for $k \ge 1, x_{k+1} \in \{5^{x_k} , 7^{x_k} \}$. For example, the possible values of $x_3$ are $5^{5^5}, 5^{5^7}, 5^{7^5}, 5^{7^7}, 7^{5^5}, 7^{5^7}, 7^{7^5}$, and $7^{7^7}$. Determine the sum of all possible values for the last two digits of $x_{2012}$.
How many sequences $ a_1,a_2,...,a{}_2{}_0{}_0{}_8$ are there such that each of the numbers $ 1,2,...,2008$ occurs once in the sequence, and $ i \in (a_1,a_2,...,a_i)$ for each $ i$ such that $ 2\le i \le2008$?
In $ \triangle ABC$, $ AB \equal{} BC$, and $ BD$ is an altitude. Point $ E$ is on the extension of $ \overline{AC}$ such that $ BE \equal{} 10$. The values of $ \tan CBE$, $ \tan DBE$, and $ \tan ABE$ form a geometric progression, and the values of $ \cot DBE$, $ \cot CBE$, $ \cot DBC$ form an arithmetic progression. What is the area of $ \triangle ABC$?
[asy]unitsize(3mm);
defaultpen(linewidth(.8pt)+fontsize(10pt));
pair D=(0,0), C=(3,0), A=(-3,0), B=(0, 8), Ep=(6,0);
draw(A--B--Ep--cycle);
draw(D--B--C);
label("$A$",A,S);
label("$D$",D,S);
label("$C$",C,S);
label("$E$",Ep,S);
label("$B$",B,N);[/asy]$ \textbf{(A)}\ 16 \qquad \textbf{(B)}\ \frac {50}{3} \qquad \textbf{(C)}\ 10\sqrt3 \qquad \textbf{(D)}\ 8\sqrt5 \qquad \textbf{(E)}\ 18$
A pawn is placed on a square of a $ n \times n$ board. There are two types of legal
moves: (a) the pawn can be moved to a neighbouring square, which shares a common side with the current square; or (b) the pawn can be moved to a neighbouring square, which shares a common vertex, but not a common side with the current square. Any two consecutive moves must be of different type. Find all integers $ n \ge 2$, for which it is possible to choose an initial square and a sequence of moves such that the pawn visits each square exactly once (it is not required that the pawn returns to the initial square).
Prove that the arithmetic progression $3,7,11,15,...$. contains infinitely many prime numbers.
Let $x_1, x_2, \ldots$ be a sequence of $0,1$, such that it satisfies the following three conditions:
1) $x_2=x_{100}=1$, $x_i=0$ for $1 \leq i \leq 100$ and $i \neq 2,100$;
2) $x_{2n-1}=x_{n-50}+1, x_{2n}=x_{n-50}$ for $51 \leq n \leq 100$;
3) $x_{2n}=x_{n-50}, x_{2n-1}=x_{n-50}+x_{n-100}$ for $n>100$.
Show that the sequence is periodic.