Found problems: 5923
A number $n$ is [i]interesting[/i] if 2018 divides $d(n)$ (the number of positive divisors of $n$). Determine all positive integers $k$ such that there exists an infinite arithmetic progression with common difference $k$ whose terms are all interesting.
Define the function $f:(0,1)\to (0,1)$ by \[\displaystyle f(x) = \left\{ \begin{array}{lr} x+\frac 12 & \text{if}\ \ x < \frac 12\\ x^2 & \text{if}\ \ x \ge \frac 12 \end{array} \right.\] Let $a$ and $b$ be two real numbers such that $0 < a < b < 1$. We define the sequences $a_n$ and $b_n$ by $a_0 = a, b_0 = b$, and $a_n = f( a_{n -1})$, $b_n = f (b_{n -1} )$ for $n > 0$. Show that there exists a positive integer $n$ such that \[(a_n - a_{n-1})(b_n-b_{n-1})<0.\]
[i]Proposed by Denmark[/i]
Let $n$ be a positive integer, and let $f(n)$ denote the last nonzero digit in the decimal expansion of $n!$.
$(\text a)$ Show that if $a_1,a_2,\ldots,a_k$ are distinct nonnegative integers, then $f(5^{a_1}+5^{a_2}+\ldots+5^{a_k})$ depends only on the sum $a_1+a_2+\ldots+a_k$.
$(\text b)$ Assuming part $(\text a)$, we can define
$$g(s)=f(5^{a_1}+5^{a_2}+\ldots+5^{a_k}),$$where $s=a_1+a_2+\ldots+a_k$. Find the least positive integer $p$ for which
$$g(s)=g(s+p),\enspace\text{for all }s\ge1,$$or show that no such $p$ exists.
Given a circle with its perimeter equal to $n$( $n \in N^*$), the least positive integer $P_n$ which satisfies the following condition is called the “[i]number of the partitioned circle[/i]”: there are $P_n$ points ($A_1,A_2, \ldots ,A_{P_n}$) on the circle; For any integer $m$ ($1\le m\le n-1$), there always exist two points $A_i,A_j$ ($1\le i,j\le P_n$), such that the length of arc $A_iA_j$ is equal to $m$. Furthermore, all arcs between every two adjacent points $A_i,A_{i+1}$ ($1\le i\le P_n$, $A_{p_n+1}=A_1$) form a sequence $T_n=(a_1,a_2,,,a_{p_n})$ called the “[i]sequence of the partitioned circle[/i]”. For example when $n=13$, the number of the partitioned circle $P_{13}$=4, the sequence of the partitioned circle $T_{13}=(1,3,2,7)$ or $(1,2,6,4)$. Determine the values of $P_{21}$ and $P_{31}$, and find a possible solution of $T_{21}$ and $T_{31}$ respectively.
Tom has a scientific calculator. Unfortunately, all keys are broken except for one row: 1, 2, 3, + and -.
Tom presses a sequence of $5$ random keystrokes; at each stroke, each key is equally likely to be pressed. The calculator then evaluates the entire expression, yielding a result of $E$. Find the expected value of $E$.
(Note: Negative numbers are permitted, so 13-22 gives $E = -9$. Any excess operators are parsed as signs, so -2-+3 gives $E=-5$ and -+-31 gives $E = 31$. Trailing operators are discarded, so 2++-+ gives $E=2$. A string consisting only of operators, such as -++-+, gives $E=0$.)
[i]Proposed by Lewis Chen[/i]
Consider the triangular numbers $T_n = \frac{n(n+1)}{2} , n \in \mathbb N$.
[list][b](a)[/b] If $a_n$ is the last digit of $T_n$, show that the sequence $(a_n)$ is periodic and find its basic period.
[b](b)[/b] If $s_n$ is the sum of the first $n$ terms of the sequence $(T_n)$, prove that for every $n \geq 3$ there is at least one perfect square between $s_{n-1} and $s_n$.[/list]
Let $a_1$, $a_2$, $a_3$, $\ldots$ be a sequence of positive integers such that $a_1=2021$ and
$$\sqrt{a_{n+1}-a_n}=\lfloor \sqrt{a_n} \rfloor. $$
Show that there are infinitely many odd numbers and infinitely many even numbers in this sequence.
[i] Proposed by Li4, Tsung-Chen Chen, and Ming Hsiao.[/i]
Consider a permutation $(a_1,a_2,a_3,a_4,a_5)$ of $\{1,2,3,4,5\}$. We say the $5$-tuple $(a_1,a_2,a_3,a_4,a_5)$ is dlawless if for all $1 \le i<j<k \le 5$, the sequence $(a_i,a_j,a_k)$ is [b]not [/b] an arithmetic progression (in that order). Find the number of flawless $5$-tuples.
We have $98$ cards, in each one we will write one of the numbers: $1, 2, 3, 4,...., 97, 98$.
We can order the $98$ cards, in a sequence such that two consecutive numbers $X$ and $Y$ and the number $X - Y$ is greater than $48$, determine how and how many ways we can make this sequence!!
Set $u_0 = \frac{1}{4},$ and for $k \geq 0$ let $u_{k+1}$ be determined by the recurrence $u_{k+1} = 2u_k - 2u_k^2.$ This sequence tends to a limit, call it $L.$ What is the least value of $k$ such that $$|u_k - L| \leq \frac{1}{2^{1000}}?$$
$\textbf{(A)}\ 10 \qquad\textbf{(B)}\ 97 \qquad\textbf{(C)}\ 253 \qquad\textbf{(D)}\
329 \qquad\textbf{(E)}\ 401$
For positive integer $n$ we define $f(n)$ as sum of all of its positive integer divisors (including $1$ and $n$). Find all positive integers $c$ such that there exists strictly increasing infinite sequence of positive integers $n_1, n_2,n_3,...$ such that for all $i \in \mathbb{N}$ holds $f(n_i)-n_i=c$
All $n$-digit words from the alphabet $\{0, 1\}$ considered. These $2^n$ words should be in a sequence $w_0, w_1, w_2, ..., w_{2^-1}$ be arranged that $w_m$ from $w_{m-1}$ by changing of a single ornament ($m = 1, 2, 3, ..., 2n-1$). Prove that the following algorithm achievesthis :
a) Start with $w_0 = 000... 00$.
b) Let $w_{m-1} = a_1a_2a_3 ... a_n$ with $a_i \in \{0; 1\}$, $i = 1, 2, 3, ..., n$.
Determine the exponent $e(m)$ of the highest power of two dividing $m$ and set $j = e(m)+1$. In $w_{m-1}$ replace the ornament $a_j$ with $1-aj$. this is now $w_m$.
For each integer $a_0 > 1$, define the sequence $a_0, a_1, a_2, \ldots$ for $n \geq 0$ as
$$a_{n+1} =
\begin{cases}
\sqrt{a_n} & \text{if } \sqrt{a_n} \text{ is an integer,} \\
a_n + 3 & \text{otherwise.}
\end{cases}
$$
Determine all values of $a_0$ such that there exists a number $A$ such that $a_n = A$ for infinitely many values of $n$.
[i]Proposed by Stephan Wagner, South Africa[/i]
Let $ \left( a_n\right)_{n\ge 1} $ be a sequence defined by $ a_1>0 $ and $ \frac{a_{n+1}}{a}=\frac{a_n}{a}+\frac{a}{a_n} , $ with $ a>0. $ Calculate $ \lim_{n\to\infty} \frac{a_n}{\sqrt{n+a}} . $
[i]Florin Rotaru[/i]
The kingdom of Anisotropy consists of $n$ cities. For every two cities there exists exactly one direct one-way road between them. We say that a [i]path from $X$ to $Y$[/i] is a sequence of roads such that one can move from $X$ to $Y$ along this sequence without returning to an already visited city. A collection of paths is called [i]diverse[/i] if no road belongs to two or more paths in the collection.
Let $A$ and $B$ be two distinct cities in Anisotropy. Let $N_{AB}$ denote the maximal number of paths in a diverse collection of paths from $A$ to $B$. Similarly, let $N_{BA}$ denote the maximal number of paths in a diverse collection of paths from $B$ to $A$. Prove that the equality $N_{AB} = N_{BA}$ holds if and only if the number of roads going out from $A$ is the same as the number of roads going out from $B$.
[i]Proposed by Warut Suksompong, Thailand[/i]
A group of people is lined up in [i]almost-order[/i] if, whenever person $A$ is to the left of person $B$ in the line, $A$ is not more than $8$ centimeters taller than $B$. For example, five people with heights $160, 165, 170, 175$, and $180$ centimeters could line up in almost-order with heights (from left-to-right) of $160, 170, 165, 180, 175$ centimeters.
(a) How many different ways are there to line up $10$ people in [i]almost-order[/i] if their heights are $140, 145, 150, 155,$ $160,$ $165,$ $170,$ $175,$ $180$, and $185$ centimeters?
Let $a>k$ be natural numbers and $r_1<r_2<\dots r_n,s_1<s_2<\dots <s_n$ be sequences of natural numbers such that:
$(a^{r_1}+k)(a^{r_2}+k)\dots (a^{r_n}+k)=(a^{s_1}+k)(a^{s_2}+k)\dots (a^{s_n}+k)$
Prove that these sequences are equal.
Find all integers $n \geq 3$ for which there exist real numbers $a_1, a_2, \dots a_{n + 2}$ satisfying $a_{n + 1} = a_1$, $a_{n + 2} = a_2$ and
$$a_ia_{i + 1} + 1 = a_{i + 2},$$
for $i = 1, 2, \dots, n$.
[i]Proposed by Patrik Bak, Slovakia[/i]
A sequence \(\{a_n\}\) is defined as follows: \(a_1 = 1\), \(a_2 = \frac{1}{3}\), and for all \(n \geq 1,\) \(\frac{(1+a_n)(1+a_{n+2})}{(1+a_n+1)^2} = \frac{a_na_{n+2}}{a_{n+1}^2}\).
Prove that, for all \(n \geq 1\), \(a_1 + a_2 + ... + a_n < \frac{34}{21}\).
Let the sequence $a_{1}, a_{2}, \cdots$ be defined recursively as follows: $a_{n}=11a_{n-1}-n$. If all terms of the sequence are positive, the smallest possible value of $a_{1}$ can be written as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. What is $m+n$?
For what positive integers $n, k$ (with $k < n$) are the binomial coefficients $${n \choose k- 1} \,\,\, , \,\,\, {n \choose k} \,\,\, , \,\,\, {n \choose k + 1}$$ three successive terms of an arithmetic progression?
Define the sequence $ (a_p)_{p\ge0}$ as follows: $ a_p\equal{}\displaystyle\frac{\binom p0}{2\cdot 4}\minus{}\frac{\binom p1}{3\cdot5}\plus{}\frac{\binom p2}{4\cdot6}\minus{}\ldots\plus{}(\minus{}1)^p\cdot\frac{\binom pp}{(p\plus{}2)(p\plus{}4)}$.
Find $ \lim_{n\to\infty}(a_0\plus{}a_1\plus{}\ldots\plus{}a_n)$.
Let $a_1,a_2,a_3,...$ be an infinite sequence of positive integers.
Suppose that a sequence $a_1,a_2,\ldots$ of positive integers satisfies $a_1=1$ and \[a_{n}=\sum_{n\neq d|n}a_d\] for every integer $n>1$. Prove that the exist infinitely many integers $k$ such that $a_k=k$.
Suppose that $(a_n)$ is a sequence of real numbers such that the series
$$\sum_{n=1}^\infty\frac{a_n}n$$is convergent. Show that the sequence
$$b_n=\frac1n\sum^n_{j=1}a_j$$is convergent and find its limit.
$\forall n\in \mathbb{Z_{+}}-\{1,2\}$ find the maximal length of a sequence with elements from a set $\{1,2,\ldots,n\}$, such that any two consecutive elements of this sequence are different and after removing all elements except for the four we do not receive a sequence in form $x,y,x,y$ ($x\neq y$).