Found problems: 5923
Show that the sequence
\begin{align*} a_n = \left \lfloor \left( \sqrt[3]{n-2} + \sqrt[3]{n+3} \right)^3 \right \rfloor \end{align*}
contains infinitely many terms of the form $a_n^{a_n}$
Suppose $a_{1} < a_{2}< \cdots < a_{2024}$ is an arithmetic sequence of positive integers, and $b_{1} <b_{2} < \cdots <b_{2024}$ is a geometric sequence of positive integers. Find the maximum possible number of integers that could appear in both sequences, over all possible choices of the two sequences.
[i]Ray Li[/i]
Let $ n \ge 3$ be a prime number and $ a_{1} < a_{2} < \cdots < a_{n}$ be integers. Prove that $ a_{1}, \cdots,a_{n}$ is an arithmetic progression if and only if there exists a partition of $ \{0, 1, 2, \cdots \}$ into sets $ A_{1},A_{2},\cdots,A_{n}$ such that
\[ a_{1} \plus{} A_{1} \equal{} a_{2} \plus{} A_{2} \equal{} \cdots \equal{} a_{n} \plus{} A_{n},\]
where $ x \plus{} A$ denotes the set $ \{x \plus{} a \vert a \in A \}$.
Given an infinite positive integer sequence $\{x_i\}$ such that $$x_{n+2}=x_nx_{n+1}+1$$ Prove that for any positive integer $i$ there exists a positive integer $j$ such that $x_j^j$ is divisible by $x_i^i$.
[i]Remark: Unfortunately, there was a mistake in the problem statement during the contest itself. In the last sentence, it should say "for any positive integer $i>1$ ..."[/i]
Let $SP_1P_2P_3EP_4P_5$ be a heptagon. A frog starts jumping at vertex $S$. From any vertex of the heptagon except $E$, the frog may jump to either of the two adjacent vertices. When it reaches vertex $E$, the frog stops and stays there. Find the number of distinct sequences of jumps of no more than $12$ jumps that end at $E$.
Let $x_0,x_1,\dots, x_{n-1}$ be real numbers such that $0<|x_0|<|x_1|<\dots<|x_{n-1}|$. We will write the sum of the elements of each one of the $2^n$ subsets of $\{x_0,x_1,\dots,x_{n-1}\}$ in a paper. Prove that the $2^n$ written numbers are consecutive elements of a arithmetic progression if and only if the ratios
$$|\frac{x_i}{x_j}|, 0\leq j<i\leq n-1$$
are equal(s) to the ratio(s) obtained with the numbers $2^0,2^1,\dots,2^{n-1}$.
Note: The sum of the elements of the empty set is $0$.
The infinite sequence $P_0(x),P_1(x),P_2(x),\ldots,P_n(x),\ldots$ is defined as
\[P_0(x)=x,\quad P_n(x) = P_{n-1}(x-1)\cdot P_{n-1}(x+1),\quad n\ge 1.\]
Find the largest $k$ such that $P_{2014}(x)$ is divisible by $x^k$.
Call an $n$-tuple $(a_1, . . . , a_n)$ [i]occasionally periodic [/i] if there exist a nonnegative integer $i$ and a positive integer $p$ satisfying $i + 2p \le n$ and $a_{i+j} = a_{i+p+j}$ for every $j = 1, 2, . . . , p$. Let $k$ be a positive integer. Find the least positive integer $n$ for which there exists an $n$-tuple $(a_1, . . . , a_n)$ with elements from set $\{1, 2, . . . , k\}$, which is not occasionally periodic but whose arbitrary extension $(a_1, . . . , a_n, a_{n+1})$ is occasionally periodic for any $a_{n+1} \in \{1, 2, . . . , k\}$.
In the set of $20$ elements $\{1, 2, 3, 4, 5, 6, 7, 8, 9, 0, A, B, C, D, J, K, L, U, X, Y , Z\}$ we have made a random sequence of $28$ throws. What is the probability that the sequence $CUBA \ JULY \ 1987$ appears in this order in the sequence already thrown?
Jay notices that there are $n$ primes that form an arithmetic sequence with common difference $12$. What is the maximum possible value for $n$?
[i]Proposed by James Lin[/i]
Let $\{a_n\}$ be a sequence of positive terms such that $a_{n+1}=a_n+ \frac{n^2}{a_n}$ . Let $b_n =a_n-n$ .
(1) Are there infinitely many $n$ such that $b_n \ge 0$ ?
(2) Prove that there is a positive number $M$ such that $\sum^{\infty}_{n=3} \frac{b_n}{n+1}<M$.
A sequence of numbers $a_1, a_2 , \dots a_m$ is a [i]geometric sequence modulo n of length m[/i] for $n,m \in \mathbb{Z}^+$ if for every index $i$, $a_i \in \{ 0, 1, 2, \dots , m-1\}$ and there exists an integer $k$ such that $n | a_{j+1} - ka_{j}$ for $1 \leq j \leq m-1$. How many geometric sequences modulo $14$ of length $14$ are there?
Let $n\geq3$ be an integer. We say that an arrangement of the numbers $1$, $2$, $\dots$, $n^2$ in a $n \times n$ table is [i]row-valid[/i] if the numbers in each row can be permuted to form an arithmetic progression, and [i]column-valid[/i] if the numbers in each column can be permuted to form an arithmetic progression. For what values of $n$ is it possible to transform any row-valid arrangement into a column-valid arrangement by permuting the numbers in each row?
Find all sequences of positive integers $(a_n)_{n\ge 1}$ which satisfy
$$a_{n+2}(a_{n+1}-1)=a_n(a_{n+1}+1)$$
for all $n\in \mathbb{Z}_{\ge 1}$.
[i](Bogdan Blaga)[/i]
$\{a_n\}$ is an infinite, strictly increasing sequence of positive integers and $a_{a_n}\leq a_n+a_{n+3}$ for all $n\geq 1$. Prove that, there are infinitely many triples $(k,l,m)$ of positive integers such that $k<l<m$ and $a_k+a_m=2a_l$
Let $\{a_{n}\}_{n \geq 0}$ and $\{b_{n}\}_{n \geq 0}$ be two sequences of integer numbers such that:
i. $a_{0}=0$, $b_{0}=8$.
ii. For every $n \geq 0$, $a_{n+2}=2a_{n+1}-a_{n}+2$, $b_{n+2}=2b_{n+1}-b_{n}$.
iii. $a_{n}^{2}+b_{n}^{2}$ is a perfect square for every $n \geq 0$.
Find at least two values of the pair $(a_{1992},\, b_{1992})$.
Find the smallest positive integer $n$ with the following property: in every sequence of $n$ positive integers such that the sum of the $n$ numbers is equal to $2013$, there are some consecutive terms whose sum is equal to $31$.
Let $({{x}_{n}}),({{y}_{n}})$ be two positive sequences defined by ${{x}_{1}}=1,{{y}_{1}}=\sqrt{3}$ and
\[ \begin{cases} {{x}_{n+1}}{{y}_{n+1}}-{{x}_{n}}=0 \\ x_{n+1}^{2}+{{y}_{n}}=2 \end{cases} \] for all $n=1,2,3,\ldots$.
Prove that they are converges and find their limits.
Define a sequence $\{u_n\}_{n=0}^{\infty}$ by $u_0=u_1=u_2=1,$ and thereafter by the condition that
$\det\begin{vmatrix} u_n & u_{n+1} \\ u_{n+2} & u_{n+3} \end{vmatrix}=n!$
for all $n\ge 0.$ Show that $u_n$ is an integer for all $n.$ (By convention, $0!=1$.)
Let $a_1,a_2, a_3,...$ be a sequence of real numbers which satisfy the relation $a_{n+1} =\sqrt{a_n^2 + 1}$
Suppose that there exists a positive integer $n_0$ such that $a_{2n_0} = 3a_{n_0}$ . Find the value of $a_{46}$.
Prove that for every $ \vartheta$, $ 0<\vartheta<1$, there exist a sequence $ \lambda_n$ of positive integers and a series $ \sum_{n=1}^{\infty} a_n$ such that
(i)$ \lambda_{n+1}-\lambda_n > (\lambda_n)^{\vartheta}$,
(ii) $ \lim_{r\rightarrow 1^-} \sum_{n=1}^{\infty} a_nr^{\lambda_n}$ exists,
(iii) $ \sum _{n=1}^{\infty} a_n$ is divergent.
[i]P. Turan[/i]
The Fibonacci sequence is the list of numbers that begins $1, 2, 3, 5, 8, 13$ and continues with each subsequent number being the sum of the previous two.
Prove that for every positive integer $n$ when the first $n$ elements of the Fibonacci sequence are alternately added and subtracted, the result is an element of the sequence or the negative of an element of the sequence.
For example, when $n = 4$ we have $1-2+3-5 = -3$ and $3$ is an element of the Fibonacci sequence.
Let $a_1$ be a natural number not divisible by $5$. The sequence $a_1,a_2,a_3, . . .$ is defined by $a_{n+1} =a_n+b_n$, where $b_n$ is the last digit of $a_n$. Prove that the sequence contains infinitely many powers of two.
(N. Agakhanov)
Show that the cube roots of three distinct prime numbers cannot be three terms (not necessarily consecutive) of an arithmetic progression.
A [i]word[/i] is a finite sequence of letters from some alphabet. A word is [i]repetitive[/i] if it is a concatenation of at least two identical subwords (for example, $ababab$ and $abcabc$ are repetitive, but $ababa$ and $aabb$ are not). Prove that if a word has the property that swapping any two adjacent letters makes the word repetitive, then all its letters are identical. (Note that one may swap two adjacent identical letters, leaving a word unchanged.)
[i]Romania (Dan Schwarz)[/i]