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: 5923

Positive integers $a_1, a_2, \dots, a_{2023}$ satisfy the following conditions. [list] [*] $a_1 = 5, a_2 = 25$ [*] $a_{n + 2} = 7a_{n+1}-a_n-6$ for each $n = 1, 2, \dots, 2021$ [/list] Prove that there exist integers $x, y$ such that $a_{2023} = x^2 + y^2.$
Suppose that $\{a_n\}$ is a sequence such that $a_{n+1}=(1+\frac{k}{n})a_{n}+1$ with $a_{1}=1$.Find all positive integers $k$ such that any $a_n$ be integer.
The sequence of real numbers $a_1,a_2,...,a_{2015}$ is such that the 2015 equations: $a_1^3=a_1^2;a_1^3+a_2^3=(a_1+a_2 )^2;...;a_1^3+a_2^3+...+a_{2015}^3=(a_1+a_2+...+a_{2015} )^2$ are true. Prove that $a_1,a_2,…,a_{2015}$ are integers.
Determine all positive integers relatively prime to all the terms of the infinite sequence \[ a_n=2^n+3^n+6^n -1,\ n\geq 1. \]
Prove that there exists two strictly increasing sequences $(a_{n})$ and $(b_{n})$ such that $a_{n}(a_{n}+1)$ divides $b^{2}_{n}+1$ for every natural n.
Let $X =\{ X_1 , X_2 , ...\}$ be a countable set of points in space. Show that there is a positive sequence $\{a_k\}$ such that for any point $Z\not\in X$ the distance between the point Z and the set $\{X_1,X_2 , ...,X_k\}$ is at least $a_k$ for infinitely many k.
Suppose $f:\mathbb{R}\to\mathbb{R}$ is a differentiable function for which the inequality $f'(x) \leq f'(x+\frac{1}{n})$ holds for every $x\in\mathbb{R}$ and every $n\in\mathbb{N}$.Prove that f is continiously differentiable
Each term of a sequence of positive integers is obtained from the previous term by adding to it its largest digit. What is the maximal number of successive odd terms in such a sequence?
Consider a sequence $ x_1, x_2, x_3, ...$, defined by \begin{align*}x_1 &= \sqrt [3]{3}\\ x_2 &= \sqrt [3]{3} ^ {\sqrt [3]{3}},\end{align*}and in general \[ x_n \equal{} (x_{n \minus{} 1}) ^ {\sqrt [3]{3}}\,\,\text{ for }\,\,n > 1. \]What is the smallest value of $ n$ for which $ x_n$ is an integer? $ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 9 \qquad \textbf{(E)}\ 27$
Define a sequence of positive integers $\{a_n\}$ through the recursive formula: $a_{n+1}=a_n+b_n(n\ge 1)$,where $b_n$ is obtained by rearranging the digits of $a_n$ (in decimal representation) in reverse order (for example,if $a_1=250$,then $b_1=52,a_2=302$,and so on). Can $a_7$ be a prime?
Let $x_1,x_2,x_3, \dots$ be a sequence of nonzero real numbers satisfying $$x_n=\frac{x_{n-2}x_{n-1}}{2x_{n-2}-x_{n-1}} \text{ for } n=3,4,5, \dots.$$ Establish necessary and sufficient conditions on $x_1$ and $x_2$ for $x_n$ to be an integer for infinitely many values of $n.$
Find all primes $p>5$ for which there exists an integer $a$ and an integer $r$ satisfying $1\leq r\leq p-1$ with the following property: the sequence $1,\,a,\,a^2,\,\ldots,\,a^{p-5}$ can be rearranged to form a sequence $b_0,\,b_1,\,b_2,\,\ldots,\,b_{p-5}$ such that $b_n-b_{n-1}-r$ is divisible by $p$ for $1\leq n\leq p-5$.
$ P(x)$ is a quadratic trinomial. What maximum number of terms equal to the sum of the two preceding terms can occur in the sequence $ P(1)$, $ P(2)$, $ P(3)$, $ \dots?$ [i]Proposed by A. Golovanov[/i]
Let the [i]square decomposition[/i] of a number be defined as the sequence of numbers given by the following algorithm. Given a positive integer $n$, add the largest possible perfect square that is less than or equal to $n$ to a sequence, and then subtract that number from $n$. Repeat as many times as necessary until your current $n$ is $0$. So for example, the square decomposition of $60$ would be $49, 9, 1, 1$. Define the size of a square decomposition to be the number of numbers in the sequence. Say that the maximal size of a square decomposition of a number in the range $[1, 2020]$ is $m$. Find the largest number in the range $[1, 2020]$ that has a square decomposition of size $m$. [i]Proposed by Timothy Qian[/i]
For a positive integer $a$, define a sequence of integers $x_1,x_2,\ldots$ by letting $x_1=a$ and $x_{n+1}=2x_n+1$ for $n\geq 1$. Let $y_n=2^{x_n}-1$. Determine the largest possible $k$ such that, for some positive integer $a$, the numbers $y_1,\ldots,y_k$ are all prime.
There is a unique sequence of integers $a_1, a_2, \cdots a_{2023}$ such that $$ \tan2023x = \frac{a_1 \tan x + a_3 \tan^3 x + a_5 \tan^5 x + \cdots + a_{2023} \tan^{2023} x}{1 + a_2 \tan^2 x + a_4 \tan^4 x \cdots + a_{2022} \tan^{2022} x} $$ whenever $\tan 2023x$ is defined. What is $a_{2023}?$ $\textbf{(A) } -2023 \qquad\textbf{(B) } -2022 \qquad\textbf{(C) } -1 \qquad\textbf{(D) } 1 \qquad\textbf{(E) } 2023$
Does there exist an infinite sequence of integers \(a_0\), \(a_1\), \(a_2\), \(\ldots\) such that \(a_0\ne0\) and, for any integer \(n\ge0\), the polynomial \[P_n(x)=\sum_{k=0}^na_kx^k\] has \(n\) distinct real roots? [i]Proposed by Amol Rama and Espen Slettnes[/i]
Consider the recurrence relation $x_{n+2}=2x_{n+1}+x_n,$ with $x_0=0, x_1=1.$ What is the greatest common divisor of $x_{2023}$ and $x_{721}$?
Let $a_1$, $a_2$, ... be an infinite sequence of integers such that $0 \le a_k \le k$ for every positive integer $k$ and such that \[ 2017 = \sum_{k = 1}^\infty a_k \cdot k! \, . \] What is the value of the infinite series $\sum_{k = 1}^\infty a_k$?
There are $n$ holes in a circle. The holes are numbered $1,2,3$ and so on to $n$. In the beginning, there is a peg in every hole except for hole $1$. A peg can jump in either direction over one adjacent peg to an empty hole immediately on the other side. After a peg moves, the peg it jumped over is removed. The puzzle will be solved if all pegs disappear except for one. For example, if $n=4$ the puzzle can be solved in two jumps: peg $3$ jumps peg $4$ to hole $1$, then peg $2$ jumps the peg in $1$ to hole $4$. (See illustration below, in which black circles indicate pegs and white circles are holes.) [center][img]http://i.imgur.com/4ggOa8m.png[/img][/center] [list=a] [*]Can the puzzle be solved for $n=5$? [*]Can the puzzle be solved for $n=2014$? [/list] In each part (a) and (b) either describe a sequence of moves to solve the puzzle or explain why it is impossible to solve the puzzle.
Let $a_1,a_2,a_3,\ldots$ be an infinite sequence of positive integers such that $a_{n+2m}$ divides $a_{n}+a_{n+m}$ for all positive integers $n$ and $m.$ Prove that this sequence is eventually periodic, i.e. there exist positive integers $N$ and $d$ such that $a_n=a_{n+d}$ for all $n>N.$
We wish to tile a strip of $n$ $1$-inch by $1$-inch squares. We can use dominos which are made up of two tiles that cover two adjacent squares, or $1$-inch square tiles which cover one square. We may cover each square with one or two tiles and a tile can be above or below a domino on a square, but no part of a domino can be placed on any part of a different domino. We do not distinguish whether a domino is above or below a tile on a given square. Let $t(n)$ denote the number of ways the strip can be tiled according to the above rules. Thus for example, $t(1)=2$ and $t(2)=8$. Find a recurrence relation for $t(n)$, and use it to compute $t(6)$.
How many 3-term geometric sequences $a$, $b$, $c$ are there where $a$, $b$, and $c$ are positive integers with $a < b < c$ and $c = 8000$?
Let be a real number $ a, $ and a nondecreasing function $ f:\mathbb{R}\longrightarrow\mathbb{R} . $ Prove that $ f $ is continuous in $ a $ if and only if there exists a sequence $ \left( a_n \right)_{n\ge 1} $ of real positive numbers such that $$ \int_a^{a+a_n} f(x)dx+\int_a^{a-a_n} f(x)dx\le\frac{a_n}{n} , $$ for all natural numbers $ n. $ [i]Dan Marinescu[/i]
Consider an integer $n \geq 1$, $a_1,a_2, \ldots , a_n$ real numbers in $[-1,1]$ satisfying \begin{align*}a_1+a_2+\ldots +a_n=0 \end{align*} and a function $f: [-1,1] \mapsto \mathbb{R}$ such \begin{align*} \mid f(x)-f(y) \mid \le \mid x-y \mid \end{align*} for every $x,y \in [-1,1]$. Prove \begin{align*} \left| f(x) - \frac{f(a_1) +f(a_2) + \ldots + f(a_n)}{n} \right| \le 1 \end{align*} for every $x$ $\in [-1,1]$. For a given sequence $a_1,a_2, \ldots ,a_n$, Find $f$ and $x$ so hat the equality holds.