Found problems: 5923
The set of natural numbers is represented as a union of pairwise disjoint subsets, whose elements form infinite arithmetic progressions with positive differences $d_1,d_2,d_3,...$. Is it possible that the sum $\frac{1}{d_1}+\frac{1}{d_1}+\frac{1}{d_3}+... $ does not exceed $0.9$? Consider the cases where
(a) the total number of progressions is finite, and
(b) the number of progressions is infinite.
(In this case the condition that $\frac{1}{d_1}+\frac{1}{d_1}+\frac{1}{d_3}+... $ does not exceed $0.9$ should be taken to mean that the sum of any finite number of terms does not exceed 0.9.)
(A. Tolpugo, Kiev)
The teacher writes numbers $1$ at both ends of the blackboard. The first student adds a $2$ in the middle between them, each next student adds the sum of each two adjacent numbers already on the blackboard between them (hence there are numbers $1, 3, 2, 3, 1$ on the blackboard after the second student, $1, 4, 3, 5, 2, 5, 3, 4, 1$ after the third student etc.) Find the sum of all numbers on the blackboard after the $n$-th student.
Arman, starting from a number, calculates the sum of the cubes of the digits of that number, and again calculates the sum of the cubes of the digits of the resulting number and continues the same process. Arman calls a number $Good$ if it reaches $1$ after performing a number of steps. Prove that there is an arithmetic progression of length $1402$ of good numbers.
[i]Proposed by Navid Safaei [/i]
Prove that for any natural numbers $n,r$ with $r + 3 \le n $the binomial coefficients $n \choose r$, $n \choose r+1$, $n \choose r+2 $, $n \choose r+3 $ cannot be successive terms of an arithmetic progression.
Given is the sequence $(a_n)_{n\geq 0}$ which is defined as follows:$a_0=3$ and $a_{n+1}-a_n=n(a_n-1) \ , \ \forall n\geq 0$.
Determine all positive integers $m$ such that $\gcd (m,a_n)=1 \ , \ \forall n\geq 0$.
Define two sequences $x_n, y_n$ for $n = 1, 2, \ldots$ by \[x_n = \left(\sum^n_{k=0} \binom{2n}{2k}49^k 48^{n-k} \right) -1, \quad \text{and} \quad y_n = \sum^{n-1}_{k=0} \binom{2n}{2k + 1} 49^k 48^{n-k}\] Prove there is a positive integer $m$ for which for every integer $n > m,$ the greatest common factor of $x_n$ and $y_n$ is more than $10^{2024}.$
Let $n>1$ be an even positive integer. An $2n \times 2n$ grid of unit squares is given, and it is partitioned into $n^2$ contiguous $2 \times 2$ blocks of unit squares. A subset $S$ of the unit squares satisfies the following properties:
(i) For any pair of squares $A,B$ in $S$, there is a sequence of squares in $S$ that starts with $A$, ends with $B$, and has any two consecutive elements sharing a side; and
(ii) In each of the $2 \times 2$ blocks of squares, at least one of the four squares is in $S$.
An example for $n=2$ is shown below, with the squares of $S$ shaded and the four $2 \times 2$ blocks of squares outlined in bold.
[asy]
size(2.5cm);
fill((0,0)--(4,0)--(4,1)--(0,1)--cycle,mediumgrey);
fill((0,0)--(0,4)--(1,4)--(1,0)--cycle,mediumgrey);
fill((0,3)--(4,3)--(4,4)--(0,4)--cycle,mediumgrey);
fill((3,0)--(3,4)--(4,4)--(4,0)--cycle,mediumgrey);
draw((0,0)--(4,0)--(4,4)--(0,4)--cycle);
draw((1,0)--(1,4));
draw((2,0)--(2,4),linewidth(1));
draw((3,0)--(3,4));
draw((0,1)--(4,1));
draw((0,2)--(4,2),linewidth(1));
draw((0,3)--(4,3));
[/asy]
In terms of $n$, what is the minimum possible number of elements in $S$?
The numbers in the sequence 101, 104, 109, 116, $\dots$ are of the form $a_n = 100 + n^2$, where $n = 1$, 2, 3, $\dots$. For each $n$, let $d_n$ be the greatest common divisor of $a_n$ and $a_{n + 1}$. Find the maximum value of $d_n$ as $n$ ranges through the positive integers.
Let be the sequence $ \left( J_n \right)_{n\ge 1} , $ where $ J_n=\int_{(1+n)^2}^{1+(1+n)^2} \sqrt{\frac{x-1-n-n^2}{x-1}} dx. $
[b]a)[/b] Study its monotony.
[b]b)[/b] Calculate $ \lim_{n\to\infty } J_n\sqrt{n} . $
[i]Ion Bursuc[/i]
Given a positive integer whose base-$10$ representation is $\overline{d_k\ldots d_0}$ for some integer $k \geq 0$, where $d_k \neq 0$, a move consists of selecting some integers $0 \leq i \leq j \leq k$, such that the digits $d_j,\ldots,d_i$ are not all $0$, erasing them from $n$, and replacing them with a divisor of $\overline{d_j\ldots d_i}$ (this divisor need not have the same number of digits as $\overline{d_j\ldots d_i}$).
Prove that for all sufficiently large even integers $n$, we may apply some sequence of moves to $n$ to transform it into $2024$.
[i]Allen Wang[/i]
An array $ n\times n$ is given, consisting of $ n^2$ unit squares. A [i]pawn[/i] is placed arbitrarily on a unit square. The pawn can move from a square of the $ k$-th column to any square of the $ k$-th row. Show that there exists a sequence of $ n^2$ moves of the pawn so that all the unit squares of the array are visited once, the pawn returning to its original position.
[b]Dinu Serbanescu[/b]
Find the maximum constant $C$ such that, whenever $\{a_n \}_{n=1}^{\infty}$ is a sequence of positive real numbers satisfying $a_{n+1}-a_n=a_n(a_n+1)(a_n+2)$, we have
$$\frac{a_{2023}-a_{2020}}{a_{2022}-a_{2021}}>C.$$
There are $n=1681$ children, $a_1,a_2,...,a_{n}$ seated clockwise in a circle on the floor. The teacher walks behind the children in the clockwise direction with a box of $1000$ candies. She drops a candy behind the first child $a_1$. She then skips one child and drops a candy behind the third child, $a_3$. Now she skips two children and drops a candy behind the next child, $a_6$. She continues this way, at each stage skipping one child more than at the preceding stage before dropping a candy behind the next child. How many children will never receive a candy? Justify your answer.
Let $(x_n)_{n\ge2}$ be a sequence of real numbers such that $x_2>0$ and $x_{n+1}=-1+\sqrt[n]{1+nx_n}$ for $n\ge2$. Find
(a) $\lim_{n\to\infty}x_n$,
(b) $\lim_{n\to\infty}nx_n$.
Let $n$ be a positive integer. Find the number of sequences $a_0,a_1,a_2,\dots,a_{2n}$ of integers in the range $[0,n]$ such that for all integers $0\leq k\leq n$ and all nonnegative integers $m$, there exists an integer $k\leq i\leq 2k$ such that $\lfloor k/2^m\rfloor=a_i.$
[i]Andrew Carratu[/i]
One member of an infinite arithmetic sequence in the set of natural numbers is a perfect square. Show that there are infinitely many members of this sequence having this property.
For a positive integer $a$, $a'$ is the integer obtained by the following method: the decimal writing of $a'$ is the inverse of the decimal writing of $a$ (the decimal writing of $a'$ can begin by zeros, but not the one of $a$); for instance if $a=2370$, $a'=0732$, that is $732$.
Let $a_{1}$ be a positive integer, and $(a_{n})_{n \geq 1}$ the sequence defined by $a_{1}$ and the following formula for $n \geq 1$:
\[a_{n+1}=a_{n}+a'_{n}. \]
Can $a_{7}$ be prime?
The student wrote on the board three natural numbers that are consecutive members of one arithmetic progression. Then he erased the commas separating the numbers, resulting in a seven-digit number. What is the largest number that could result?
There're two positive inegers $a_1<a_2$. For every positive integer $n \geq 3$ let $a_n$ be the smallest integer that bigger than $a_{n-1}$ and such that there's unique pair $1\leq i< j\leq n-1$ such that this number equals to $a_i+a_j$. Given that there're finitely many even numbers in this sequence. Prove that sequence $\{a_{n+1}-a_n \}$ is periodic starting from some element.
Define a sequence $ < a_n > _{n\geq0}$ by $ a_0 \equal{} 0$, $ a_1 \equal{} 1$ and
\[ a_n \equal{} 2a_{n \minus{} 1} \plus{} a_{n \minus{} 2},\]
for $ n\geq2.$
$ (a)$ For every $ m > 0$ and $ 0\leq j\leq m,$ prove that $ 2a_m$ divides
$ a_{m \plus{} j} \plus{} ( \minus{} 1)^ja_{m \minus{} j}$.
$ (b)$ Suppose $ 2^k$ divides $ n$ for some natural numbers $ n$ and $ k$. Prove that $ 2^k$ divides $ a_n.$
Triangle $ABC$ is an equilateral triangle with side length $1$. Let $X_0,X_1,... $ be an infinite sequence of points such that the following conditions hold:
$\bullet$ $X_0$ is the center of $ABC$
$\bullet$ For all $i \ge 0$, $X_{2i+1}$ lies on segment $AB$ and $X_{2i+2}$ lies on segment $AC$.
$\bullet$ For all $i \ge 0$, $\angle X_iX_{i+1}X_{i+2} = 90^o.$
$\bullet$ For all $i \ge 1$, $X_{i+2}$ lies in triangle $AX_iX_{i+1}$.
Find the maximum possible value of $\sum^{\infty}_{i=0}|X_iX_{i+1}|$, where $|PQ|$ is the length of line segment $PQ$.
Suppose that we have $n$ events $A_1,\dots, A_n,$ each of which has probability at least $1-a$ of occuring, where $a<1/4.$ Further suppose that $A_i$ and $A_j$ are mutually independent if $|i-j|>1.$ Assume as known that the recurrence $u_{k+1}=u_k-au_{k-1}, u_0=1, u_1=1-a,$ defines positive real numb $u_k$ for $k=0,1,\dots.$ Show that the probability of all of $A_1,\dots, A_n$ occuring is at least $u_n.$
There are $2022$ numbers arranged in a circle $a_1, a_2, . . ,a_{2022}$. It turned out that for any three consecutive $a_i$, $a_{i+1}$, $a_{i+2}$ the equality $a_i =\sqrt2 a_{i+2} - \sqrt3 a_{i+1}$. Prove that $\sum^{2022}_{i=1} a_ia_{i+2} = 0$, if we know that $a_{2023} = a_1$, $a_{2024} = a_2$.
The numbers $1$ to $n^2$ are written in an n×n squared paper in the usual ordering. Any sequence of right and downwards steps from a square to an adjacent one (by side) starting at square $1$ and ending at square $n^2$ is called a path. Denote by $L(C)$ the sum of the numbers through which path $C$ goes.
(a) For a fixed $n$, let $M$ and $m$ be the largest and smallest $L(C)$ possible. Prove that $M-m$ is a perfect cube.
(b) Prove that for no $n$ can one find a path $C$ with $L(C ) = 1996$.
A sequence $a_n$ satisfies $a_1 =2t-3$ ($t \ne 1,-1$), and $a_{n+1}=\dfrac{(2t^{n+1}-3)a_n+2(t-1)t^n-1}{a_n+2t^n-1}$.
[list]
[b][i]i)[/i][/b] Find $a_n$,
[b][i]ii)[/i][/b] If $t>0$, compare $a_{n+1}$ with $a_n$.[/list]