Found problems: 50
India EGMO 2021 TST, 4
Let $n$ be a positive integer. Find the number of permutations $a_1$, $a_2$, $\dots a_n$ of the
sequence $1$, $2$, $\dots$ , $n$ satisfying
$$a_1 \le 2a_2\le 3a_3 \le \dots \le na_n$$.
Proposed by United Kingdom
2005 AMC 12/AHSME, 10
The first term of a sequence is 2005. Each succeeding term is the sum of the cubes of the digits of the previous terms. What is the 2005th term of the sequence?
$ \textbf{(A)}\ 29\qquad
\textbf{(B)}\ 55\qquad
\textbf{(C)}\ 85\qquad
\textbf{(D)}\ 133\qquad
\textbf{(E)}\ 250$
2018 IFYM, Sozopol, 8
The row $x_1, x_2,…$ is defined by the following recursion
$x_1=1$ and $x_{n+1}=x_n+\sqrt{x_n}$
Prove that
$\sum_{n=1}^{2018}{\frac{1}{x_n}}<3$.
2022 BMT, 8
Define the two sequences $a_0, a_1, a_2, \cdots$ and $b_0, b_1, b_2, \cdots$ by $a_0 = 3$ and $b_0 = 1$ with the recurrence relations $a_{n+1} = 3a_n + b_n$ and $b_{n+1} = 3b_n - a_n$ for all nonnegative integers $n.$ Let $r$ and $s$ be the remainders when $a_{32}$ and $b_{32}$ are divided by $31,$ respectively. Compute $100r + s.$
2015 AIME Problems, 12
There are $2^{10}=1024$ possible 10-letter strings in which each letter is either an A or a B. Find the number of such strings that do not have more than 3 adjacent letters that are identical.
2020 IMO Shortlist, C1
Let $n$ be a positive integer. Find the number of permutations $a_1$, $a_2$, $\dots a_n$ of the
sequence $1$, $2$, $\dots$ , $n$ satisfying
$$a_1 \le 2a_2\le 3a_3 \le \dots \le na_n$$.
Proposed by United Kingdom
2019 AMC 12/AHSME, 9
A sequence of numbers is defined recursively by $a_1 = 1$, $a_2 = \frac{3}{7}$, and
$$a_n=\frac{a_{n-2} \cdot a_{n-1}}{2a_{n-2} - a_{n-1}}$$for all $n \geq 3$ Then $a_{2019}$ can be written as $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive inegers. What is $p+q ?$
$\textbf{(A) } 2020 \qquad\textbf{(B) } 4039 \qquad\textbf{(C) } 6057 \qquad\textbf{(D) } 6061 \qquad\textbf{(E) } 8078$
2022 Korea Junior Math Olympiad, 5
A sequence of real numbers $a_1, a_2, \ldots $ satisfies the following conditions.
$a_1 = 2$, $a_2 = 11$.
for all positive integer $n$, $2a_{n+2} =3a_n + \sqrt{5 (a_n^2+a_{n+1}^2)}$
Prove that $a_n$ is a rational number for each of positive integer $n$.
1990 IMO Shortlist, 18
Let $ a, b \in \mathbb{N}$ with $ 1 \leq a \leq b,$ and $ M \equal{} \left[\frac {a \plus{} b}{2} \right].$ Define a function $ f: \mathbb{Z} \mapsto \mathbb{Z}$ by
\[ f(n) \equal{} \begin{cases} n \plus{} a, & \text{if } n \leq M, \\
n \minus{} b, & \text{if } n >M. \end{cases}
\]
Let $ f^1(n) \equal{} f(n),$ $ f_{i \plus{} 1}(n) \equal{} f(f^i(n)),$ $ i \equal{} 1, 2, \ldots$ Find the smallest natural number $ k$ such that $ f^k(0) \equal{} 0.$
2015 India National Olympiad, 4
There are four basketball players $A,B,C,D$. Initially the ball is with $A$. The ball is always passed from one person to a different person.
In how many ways can the ball come back to $A$ after $\textbf{seven}$ moves? (for example $A\rightarrow C\rightarrow B\rightarrow D\rightarrow A\rightarrow B\rightarrow C\rightarrow A$, or $A\rightarrow D\rightarrow A\rightarrow D\rightarrow C\rightarrow A\rightarrow B\rightarrow A)$.
1983 Bundeswettbewerb Mathematik, 4
Let $f(0), f(1), f(2), \dots$ be a sequence satisfying \[ f(0) = 0 \quad \text{and} \quad f(n) = n - f(f(n-1)) \] for $n=1,2,3,\dots$. Give a formula for $f(n)$ such that its value can be immediately computed using $n$ without having to compute the previous terms.
2024 AMC 12/AHSME, 21
Suppose that $a_1 = 2$ and the sequence $(a_n)$ satisfies the recurrence relation \[\frac{a_n -1}{n-1}=\frac{a_{n-1}+1}{(n-1)+1}\] for all $n \ge 2.$ What is the greatest integer less than or equal to \[\sum^{100}_{n=1} a_n^2?\]
$\textbf{(A) } 338{,}550 \qquad \textbf{(B) } 338{,}551 \qquad \textbf{(C) } 338{,}552 \qquad \textbf{(D) } 338{,}553 \qquad \textbf{(E) } 338{,}554$
2021 Brazil Team Selection Test, 1
Let $n$ be a positive integer. Find the number of permutations $a_1$, $a_2$, $\dots a_n$ of the
sequence $1$, $2$, $\dots$ , $n$ satisfying
$$a_1 \le 2a_2\le 3a_3 \le \dots \le na_n$$.
Proposed by United Kingdom
2010 Putnam, B4
Find all pairs of polynomials $p(x)$ and $q(x)$ with real coefficients for which
\[p(x)q(x+1)-p(x+1)q(x)=1.\]
2013 USAJMO, 4
Let $f(n)$ be the number of ways to write $n$ as a sum of powers of $2$, where we keep track of the order of the summation. For example, $f(4)=6$ because $4$ can be written as $4$, $2+2$, $2+1+1$, $1+2+1$, $1+1+2$, and $1+1+1+1$. Find the smallest $n$ greater than $2013$ for which $f(n)$ is odd.
2018 IFYM, Sozopol, 7
The rows $x_n$ and $y_n$ of positive real numbers are such that:
$x_{n+1}=x_n+\frac{1}{2y_n}$ and $y_{n+1}=y_n+\frac{1}{2x_n}$
for each positive integer $n$.
Prove that at least one of the numbers $x_{2018}$ and $y_{2018}$ is bigger than 44,9
2019 USAJMO, 5
Let $n$ be a nonnegative integer. Determine the number of ways that one can choose $(n+1)^2$ sets $S_{i,j}\subseteq\{1,2,\ldots,2n\}$, for integers $i,j$ with $0\leq i,j\leq n$, such that:
[list]
[*] for all $0\leq i,j\leq n$, the set $S_{i,j}$ has $i+j$ elements; and
[*] $S_{i,j}\subseteq S_{k,l}$ whenever $0\leq i\leq k\leq n$ and $0\leq j\leq l\leq n$.
[/list]
[i]Proposed by Ricky Liu[/i]
1994 AIME Problems, 9
A solitaire game is played as follows. Six distinct pairs of matched tiles are placed in a bag. The player randomly draws tiles one at a time from the bag and retains them, except that matching tiles are put aside as soon as they appear in the player's hand. The game ends if the player ever holds three tiles, no two of which match; otherwise the drawing continues until the bag is empty. The probability that the bag will be emptied is $p/q,$ where $p$ and $q$ are relatively prime positive integers. Find $p+q.$
2009 Kyiv Mathematical Festival, 5
a) Suppose that a sequence of numbers $x_1,x_2,x_3,...$ satisfies the inequality $x_n-2x_{n+1}+x_{n+2} \le 0$ for any $n$ . Moreover $x_o=1,x_{20}=9,x_{200}=6$. What is the maximal value of $x_{2009}$ can be?
b) Suppose that a sequence of numbers $x_1,x_2,x_3,...$ satisfies the inequality $2x_n-3x_{n+1}+x_{n+2} \le 0$ for any $n$. Moreover $x_o=1,x_1=2,x_3=1$. Can $x_{2009}$ be greater then $0,678$ ?
2020 Bulgaria EGMO TST, 1
Let $n$ and $t$ be positive integers. What is the number of ways to place $t$ dominoes $(1\times 2$ or $2\times 1$ rectangles) in a $2\times n$ table so that there is no $2\times 2$ square formed by $2$ dominoes and each $2\times 3$ rectangle either does not have a horizontal domino in the middle and last cell in the first row or does not have a horizontal domino in the first and middle cell in the second row (or both)?
2017 Bundeswettbewerb Mathematik, 4
The sequence $a_0,a_1,a_2,\dots$ is recursively defined by \[ a_0 = 1 \quad \text{and} \quad a_n = a_{n-1} \cdot \left(4-\frac{2}{n} \right) \quad \text{for } n \geq 1. \] Prove for each integer $n \geq 1$:
(a) The number $a_n$ is a positive integer.
(b) Each prime $p$ with $n < p \leq 2n$ is a divisor of $a_n$.
(c) If $n$ is a prime, then $a_n-2$ is divisible by $n$.
2024 Irish Math Olympiad, P1
The [i]runcible[/i] positive integers are defined recursively as follows:
[list]
[*]$1$ and $2$ are runcible
[*]If $a$ and $b$ are runcible (where $a$ and $b$ are not necessarily distinct) then $2a + 3b$ is runcible.
[/list]
Is $2024$ runcible?
2021 Taiwan TST Round 1, C
Let $n$ be a positive integer. Find the number of permutations $a_1$, $a_2$, $\dots a_n$ of the
sequence $1$, $2$, $\dots$ , $n$ satisfying
$$a_1 \le 2a_2\le 3a_3 \le \dots \le na_n$$.
Proposed by United Kingdom
2017 AIME Problems, 12
Call a set $S$ [i]product-free[/i] if there do not exist $a, b, c \in S$ (not necessarily distinct) such that $a b = c$. For example, the empty set and the set $\{16, 20\}$ are product-free, whereas the sets $\{4, 16\}$ and $\{2, 8, 16\}$ are not product-free. Find the number of product-free subsets of the set $\{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\}$.
2018 India National Olympiad, 2
For any natural number $n$, consider a $1\times n$ rectangular board made up of $n$ unit squares. This is covered by $3$ types of tiles : $1\times 1$ red tile, $1\times 1$ green tile and $1\times 2$ domino. (For example, we can have $5$ types of tiling when $n=2$ : red-red ; red-green ; green-red ; green-green ; and blue.) Let $t_n$ denote the number of ways of covering $1\times n$ rectangular board by these $3$ types of tiles. Prove that, $t_n$ divides $t_{2n+1}$.