This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 1239

Let $n$ be a positive integer. Show that there is a prime $p$ and a sequence $\left(a_k\right)_{k\ge1}$ of positive integers such that the sequence $\left(p+na_k\right)_{k\ge1}$ consists of distinct primes.
We consider the real sequence ($x_n$) defined by $x_0=0, x_1=1$ and $x_{n+2}=3x_{n+1}-2 x_{n}$ for $n=0,1,2,...$ We define the sequence ($y_n$) by $y_n=x^2_n+2^{n+2}$ for every nonnegative integer $n$. Prove that for every $n>0, y_n$ is the square of an odd integer.
[b]1.[/b] Let $a_{v} $ and $b_{v} $, ${v= 1,2,\dots,n} $, be real numbers such that $a_{1}\geq a_{2} \geq a_{3}\geq\dots\geq a_{n}> 0 $ and $b_{1}\geq a_{1}, b_{1}b_{2}\geq a_{1}a_{2},\dots,b_{1}b_{2}\dots b_{n}\geq a_{1}a_{2}\dots a_{n} $ Show that $b_{1}+b_{2}+\dots+b_{n}\geq a_{1}+a_{2}+\dots+a_{n} $ [b](S. 4)[/b]
Let $(a_n)_{n\geq 1}$ be a sequence of positive real numbers with the property that $$(a_{n+1})^2 + a_na_{n+2} \leq a_n + a_{n+2}$$ for all positive integers $n$. Show that $a_{2022}\leq 1$.
A sequence of natural numbers is constructed by listing the first $4$, then skipping one, listing the next $5$, skipping $2$, listing $6$, skipping $3$, and, on the $n$th iteration, listing $n+3$ and skipping $n$. The sequence begins $1,2,3,4,6,7,8,9,10,13$. What is the $500,000$th number in the sequence? $ \textbf{(A)}\ 996,506\qquad\textbf{(B)}\ 996507\qquad\textbf{(C)}\ 996508\qquad\textbf{(D)}\ 996509\qquad\textbf{(E)}\ 996510 $
Some positive integers, sum of which is $23$, are written in sequential form. Neither one of the terms nor the sum of some consecutive terms in the sequence is equal to $3$. [b]a) [/b]Is it possible that the sequence contains exactly $11$ terms? [b]b)[/b]Is it possible that the sequence contains exactly $12$ terms?
Any positive integer $n$ can be written in the form $n = 2^b(2c+1)$. We call $2c+1$ the[i] odd part[/i] of $n$. Given an odd integer $n > 0$, define the sequence $ a_0, a_1, a_2, ...$ as follows: $a_0 = 2^n-1, a_{k+1} $ is the [i]odd part[/i] of $3a_k+1$. Find $a_n$.
Given a sequence $\{a_n\}$ of real numbers such that $|a_{k+m} - a_k - a_m| \leq 1$ for all positive integers $k$ and $m$, prove that, for all positive integers $p$ and $q$, \[|\frac{a_p}{p} - \frac{a_q}{q}| < \frac{1}{p} + \frac{1}{q}.\]
Consider $k$ positive integers $a_1,a_2,\ldots,a_k$ satisfying $1\le a_1<a_2<\ldots<a_k\le n$ and $\operatorname{lcm}(a_i,a_j)\le n$ for any $i,j$. Prove that $$k\le2\lfloor\sqrt n\rfloor.$$
All possible sequences of numbers $-1$ and $+1$ of length $100$ are considered. For each of them, the square of the sum of the terms is calculated. Find the arithmetic average of the resulting values.
Let $n$ be a positive integer, and consider a sequence $a_1 , a_2 , \dotsc , a_n $ of positive integers. Extend it periodically to an infinite sequence $a_1 , a_2 , \dotsc $ by defining $a_{n+i} = a_i $ for all $i \ge 1$. If \[a_1 \le a_2 \le \dots \le a_n \le a_1 +n \] and \[a_{a_i } \le n+i-1 \quad\text{for}\quad i=1,2,\dotsc, n, \] prove that \[a_1 + \dots +a_n \le n^2. \]
The numerical sequence $\{x_n\}$ satisfies the condition $$x_{n+1}=|x_n|-x_{n-1}$$ for all $n > 1$. Prove that the sequence is periodic with period $9$, i.e. for any $n > 1$ we have $x_n = x_{n+9}$. (M Kontsevich, Moscow)
A sequence of real numbers $ a_{0},\ a_{1},\ a_{2},\dots$ is defined by the formula \[ a_{i \plus{} 1} \equal{} \left\lfloor a_{i}\right\rfloor\cdot \left\langle a_{i}\right\rangle\qquad\text{for}\quad i\geq 0; \]here $a_0$ is an arbitrary real number, $\lfloor a_i\rfloor$ denotes the greatest integer not exceeding $a_i$, and $\left\langle a_i\right\rangle=a_i-\lfloor a_i\rfloor$. Prove that $a_i=a_{i+2}$ for $i$ sufficiently large. [i]Proposed by Harmel Nestra, Estionia[/i]
A sequence of real numbers $a_0, a_1, . . .$ is said to be good if the following three conditions hold. (i) The value of $a_0$ is a positive integer. (ii) For each non-negative integer $i$ we have $a_{i+1} = 2a_i + 1 $ or $a_{i+1} =\frac{a_i}{a_i + 2} $ (iii) There exists a positive integer $k$ such that $a_k = 2014$. Find the smallest positive integer $n$ such that there exists a good sequence $a_0, a_1, . . .$ of real numbers with the property that $a_n = 2014$. [i]Proposed by Wang Wei Hua, Hong Kong[/i]