Found problems: 5923
Denote $g(k)$ as the greatest odd divisor of $k$. Put $f(k) = \dfrac{k}{2} + \dfrac{k}{g(k)}$ for $k$ even, and $2^{(k+1)/2}$ for $k$ odd. Define the sequence $x_1, x_2, x_3, ...$ by $x_1 = 1$, $x_{n+1} = f(x_n)$. Find $n$ such that $x_n = 800$.
Consider 26 letters $A,..., Z$. A string is a finite sequence consisting of those letters. We say that a string $s$ is nice if it contains each of the 26 letters at least once, and each permutation of letters $A,..., Z$ occurs in $s$ as a subsequences the same number of times. Prove that:
(a) There exists a nice string.
(b) Any nice string contains at least $2022$ letters.
Define the sequence $a_0,a_1,a_2,\hdots$ by $a_n=2^n+2^{\lfloor n/2\rfloor}$. Prove that there are infinitely many terms of the sequence which can be expressed as a sum of (two or more) distinct terms of the sequence, as well as infinitely many of those which cannot be expressed in such a way.
Find all sequences $(a_n)$ of positive integers satisfying the equality $a_n=a_{a_{n-1}}+a_{a_{n+1}}$
a) for all $n\ge 2$
b) for all $n \ge 3$
(I. Gorodnin)
Suppose that $m$ and $k$ are positive integers. Determine the number of sequences $x_1, x_2, x_3, \dots , x_{m-1}, x_m$ with
[list]
[*]$x_i$ an integer for $i = 1, 2, 3, \dots , m$,
[*]$1\le x_i \le k$ for $i = 1, 2, 3, \dots , m$,
[*]$x_1\neq x_m$, and
[*]no two consecutive terms equal.[/list]
The sequence $a_1,a_2…$ , is defined by the equations $a_1=1$ and $a_n=n.a_{[n/2]}$ for $n>1$. Prove that $a_n>n^2$ for $n>11$.
The sequence $1, 2, \dots, 2023, 2024$ is written on a whiteboard. Every second, Megavan chooses two integers $a$ and $b$, and four consecutive numbers on the whiteboard. Then counting from the left, he adds $a$ to the 1st and 3rd of those numbers, and adds $b$ to the 2nd and 4th of those numbers. Can he achieve the sequence $2024, 2023, \dots, 2, 1$ in a finite number of moves?
[i](Proposed by Avan Lim Zenn Ee)[/i]
Suppose that a sequence $t_{0}, t_{1}, t_{2}, ...$ is defined by a formula $t_{n} = An^{2} +Bn +c$ for all integers $n \geq 0$. Here $A, B$ and $C$ are real constants with $A \neq 0$. Determine values of $A, B$ and $C$ which give the greatest possible number of successive terms of the Fibonacci sequence.[i] The Fibonacci sequence is defined by[/i] $F_{0} = 0, F_{1} = 1$ [i]and[/i] $F_{m} = F_{m-1} + F_{m-2}$ [i]for[/i] $m \geq 2$.
Show that if the integers $a_1$; $\dots$ $a_m$ are nonzero and for each $k =0; 1; \dots ;n$ ($n < m - 1$),
$a_1 + a_22^k + a_33^k + \dots + a_mm^k = 0$; then the sequence $a_1, \dots, a_m$ contains at least $n+1$ pairs of consecutive terms having opposite signs.
[i]O. Musin[/i]
Let $f_0:[0,1]\to\mathbb R$ be a continuous function. Define the sequence of functions $f_n:[0,1]\to\mathbb R$ by
$$f_n(x)=\int^x_0f_{n-1}(t)dt$$
for all integers $n\ge1$.
a) Prove that the series $\sum_{n=1}^\infty f_n(x)$ is convergent for every $x\in[0,1]$.
b) Find an explicit formula for the sum of the series $\sum_{n=1}^\infty f_n(x),x\in[0,1]$.
Given a finite sequence $x_{1,1}, x_{2,1}, \dots , x_{n,1}$ of integers $(n\ge 2)$, not all equal, define the sequences $x_{1,k}, \dots , x_{n,k}$ by
\[ x_{i,k+1}=\frac{1}{2}(x_{i,k}+x_{i+1,k})\quad\text{where }x_{n+1,k}=x_{1,k}.\]
Show that if $n$ is odd, then not all $x_{j,k}$ are integers. Is this also true for even $n$?
A sequence of positive integers is constructed as follows: the first term is $ 1$, the following two terms are $ 2$, $ 4$, the following three terms are $ 5$, $ 7$, $ 9$, the following four terms are $ 10$, $ 12$, $ 14$, $ 16$, etc. Find the $ n$-th term of the sequence.
Let $\mathbb N$ denote the set of positive integers. Find all functions $f: \mathbb{N} \to \mathbb{N}$ such that:
(i) The greatest common divisor of the sequence $f(1), f(2), \dots$ is $1$.
(ii) For all sufficiently large integers $n$, we have $f(n) \neq 1$ and \[ f(a)^n \mid f(a+b)^{a^{n-1}} - f(b)^{a^{n-1}} \] for all positive integers $a$ and $b$.
[i]Proposed by Yang Liu[/i]
Consider the sequence $ \left( I_n \right)_{n\ge 1} , $ where $ I_n=\int_0^{\pi/4} e^{\sin x\cos x} (\cos x-\sin x)^{2n} (\cos x+\sin x )dx, $ for any natural number $ n. $
[b]a)[/b] Find a relation between any two consecutive terms of $ I_n. $
[b]b)[/b] Calculate $ \lim_{n\to\infty } nI_n. $
[i]c)[/i] Show that $ \sum_{i=1}^{\infty }\frac{1}{(2i-1)!!} =\int_0^{\pi/4} e^{\sin x\cos x} (\cos x+\sin x )dx. $
[i]Cătălin Țigăeru[/i]
Consider a sequence of positive integers $a_1, a_2, a_3, . . .$ such that for $k \geq 2$ we have $a_{k+1} =\frac{a_k + a_{k-1}}{2015^i},$ where $2015^i$ is the maximal power of $2015$ that divides $a_k + a_{k-1}.$ Prove that if this sequence is periodic then its period is divisible by $3.$
Consider a sequence of positive integers with total sum $20$ such that no number and no sum of a set of consecutive numbers is equal to $3$. Is it possible for such a sequence to contain more than $10$ numbers?
(Alexandr Shapovalov)
An infinite sequence of integers $a_1,a_2,a_3, ...$ is given with $a_1 = 0$ and further holds for every natural number $n$ that $a_{n+1} = a_n - n$ if $a_n \ge n$ and $a_{n+1} = a_n + n$ if $a_n < n$ .
(a) Prove that there are infinitely many numbers in the sequence equal to $0$.
(b) Express in terms of $k$ the ordinal number of the $k^e$ number from the sequence, which is equal to $0$.
A line initially $ 1$ inch long grows according to the following law, where the first term is the initial length.
\[ 1 \plus{} \frac {1}{4}\sqrt {2} \plus{} \frac {1}{4} \plus{} \frac {1}{16}\sqrt {2} \plus{} \frac {1}{16} \plus{} \frac {1}{64}\sqrt {2} \plus{} \frac {1}{64} \plus{} \cdots.
\]If the growth process continues forever, the limit of the length of the line is:
$ \textbf{(A)}\ \infty \qquad\textbf{(B)}\ \frac {4}{3} \qquad\textbf{(C)}\ \frac {8}{3} \qquad\textbf{(D)}\ \frac {1}{3}(4 \plus{} \sqrt {2}) \qquad\textbf{(E)}\ \frac {2}{3}(4 \plus{} \sqrt {2})$
Let $< \Gamma _j >$ be a sequnce of concentric circles such that the sequence $< R_j >$ , where $R_j$ denotes the radius of $\Gamma_j$, is increasing and $R_j \longrightarrow \infty$ as $j \longrightarrow \infty$. Let $A_1 B_1 C_1$ be a triangle inscribed in $\Gamma _1$. extend the rays $\vec{A_i B_1} , \vec{B_1 C_1 }, \vec{C_1 A_1}$ to meet $\Gamma_2$ in $B_2, C_2$and $A_2$ respectively and form the triangle $A_2 B_2 C_2$. Continue this process. Show that the sequence of triangles $< A_n B_n C_n >$ tends to an equilateral triangle as $n \longrightarrow \infty$
Given a geometric sequence with the first term $ \neq 0$ and $ r \neq 0$ and an arithmetic sequence with the first term $ \equal{}0$. A third sequence $ 1,1,2\ldots$ is formed by adding corresponding terms of the two given sequences. The sum of the first ten terms of the third sequence is:
$ \textbf{(A)}\ 978 \qquad
\textbf{(B)}\ 557 \qquad
\textbf{(C)}\ 467 \qquad
\textbf{(D)}\ 1068 \\
\textbf{(E)}\ \text{not possible to determine from the information given}$
Given a sequence $s$ consisting of digits $0$ and $1$. For any positive integer $k$, define $v_k$ the maximum number of ways in any sequence of length $k$ that several consecutive digits can be identified, forming the sequence $s$. (For example, if $s=0110$, then $v_7=v_8=2$, because in sequences $0110110$ and $01101100$ one can find consecutive digits $0110$ in two places, and three pairs of $0110$ cannot meet in a sequence of length $7$ or $8$.) It is known that $v_n<v_{n+1}<v_{n+2}$ for some positive integer $n$. Prove that in the sequence $s$, all the numbers are the same.
[i]A. Golovanov[/i]
Let $a_1 < a_2 < ... < a_n$ be a sequence of natural numbers such that for $i < j$ the decimal representation of $a_i$ does not occur as the leftmost digits of the decimal representation of $a_j$ . (For example, $137$ and $13729$ cannot both occur in the sequence.) Prove that $\sum_{i=1}^n \frac{1}{a_i} \le 1+\frac12 +\frac13 +...+\frac19$
.
[b]p1.[/b] If $P$ is a (convex) polygon, a triangulation of $P$ is a set of line segments joining pairs of corners of $P$ in such a way that $P$ is divided into non-overlapping triangles, each of which has its corners at corners of $P$. For example, the following are different triangulations of a square.
(a) Prove that if $P$ is an $n$-gon with $n > 3$, then every triangulation of $P$ produces at least two triangles $T_1$, $T_2$ such that two of the sides of $T_i$, $i = 1$ or $2$ are also sides of $P$.
(b) Find the number of different possible triangulations of a regular hexagon.
[img]https://cdn.artofproblemsolving.com/attachments/9/d/0f760b0869fafc882f293846c05d182109fb78.png[/img]
[b]p2.[/b] There are $n$ students, $n \ge 2$, and $n + 1$ cubical cakes of volume $1$. They have the use of a knife. In order to divide the cakes equitably they make cuts with the knife. Each cut divides a cake (or a piece of a cake) into two pieces.
(a) Show that it is possible to provide each student with a volume $(n + 1)/n$ of a cake while making no more than $n - 1$ cuts.
(b) Show that for each integer $k$ with $2 \le k \le n$ it is possible to make $n - 1$ cuts in such a way that exactly $k$ of the $n$ students receive an entire (uncut) cake in their portion.
[b]p3. [/b]The vertical lines at $x = 0$, $x = \frac12$ , $x = 1$, $x = \frac32$ ,$...$ and the horizontal lines at $y = 0$, $y = \frac12$ , $y = 1$, $y = \frac32$ ,$ ...$ subdivide the first quadrant of the plane into $\frac12 \times \frac12$ square regions. Color these regions in a checkerboard fashion starting with a black region near the origin and alternating black and white both horizontally and vertically.
(a) Let $T$ be a rectangle in the first quadrant with sides parallel to the axes. If the width of $T$ is an integer, prove that $T$ has equal areas of black and white. Note that a similar argument works to show that if the height of $T$ is an integer, then $T$ has equal areas of black and white.
(b) Let $R$ be a rectangle with vertices at $(0, 0)$, $(a, 0)$, $(a, b)$, and $(0, b)$ with $a$ and $b$ positive. If $R$ has equal areas of black and white, prove that either $a$ is an integer or that $b$ is an integer.
(c) Suppose a rectangle $R$ is tiled by a finite number of rectangular tiles. That is, the rectangular tiles completely cover $R$ but intersect only along their edges. If each of the tiles has at least one integer side, prove that $R$ has at least one integer side.
[b]p4.[/b] Call a number [i]simple [/i] if it can be expressed as a product of single-digit numbers (in base ten).
(a) Find two simple numbers whose sum is $2014$ or prove that no such numbers exist.
(b) Find a simple number whose last two digits are $37$ or prove that no such number exists.
[b]p5.[/b] Consider triangles for which the angles $\alpha$, $\beta$, and $\gamma$ form an arithmetic progression. Let $a, b, c$ denote the lengths of the sides opposite $\alpha$, $\beta$, $\gamma$ , respectively. Show that for all such triangles, $$\frac{a}{c}\sin 2\gamma +\frac{c}{a} \sin 2\alpha$$ has the same value, and determine an algebraic expression for this value.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $\{a_n\}$ be a sequence defined by $a_1=0$ and $$a_n=\frac{1}{n}+\frac{1}{\lceil \frac{n}{2} \rceil}\sum_{k=1}^{\lceil \frac{n}{2} \rceil}a_k$$ for any positive integer $n$. Find the maximal term of this sequence.
For every non-negative integer $n$ , let $s_n$ be the sum of digits in the decimal expansion of $2^n$. Is the sequence $(s_n)_{n \in \mathbb{N}}$ eventually increasing ?