Found problems: 5923
Robot "Mag-o-matic" manipulates $101$ glasses, displaced in a row whose positions are numbered from $1$ to $101$. In each glass you can find a ball or not. Mag-o-matic only accepts elementary instructions of the form $(a;b,c)$, which it interprets as
"consider the glass in position $a$: if it contains a ball, then switch the glasses in positions $b$ and $c$ (together with their own content), otherwise move on to the following instruction"
(it means that $a,\,b,\,c$ are integers between $1$ and $101$, with $b$ and $c$ different from each other but not necessarily different from $a$). A $\emph{programme}$ is a finite sequence of elementary instructions, assigned at the beginning, that Mag-o-matic does one by one.
A subset $S\subseteq \{0,\,1,\,2,\dots,\,101\}$ is said to be $\emph{identifiable}$ if there exists a programme which, starting from any initial configuration, produces a final configuration in which the glass in position $1$ contains a ball if and only if the number of glasses containing a ball is an element of $S$.
(a) Prove that the subset $S$ of the odd numbers is identifiable.
(b) Determine all subsets $S$ that are identifiable.
The natural number $n$ can be replaced by $ab$ if $a + b = n$, where $a$ and $b$ are natural numbers. Can the number $2001$ be obtained from $22$ after a sequence of such replacements?
Let $a_n = 2^{3n-1} + 3^{6n-2} + 5^{6n-3}$. Compute gcd$(a_1, a_2, ... , a_{25})$
Let $c$ be fixed natural number. Sequence $(a_n)$ is defined by:
$a_1=1$, $a_{n+1}=d(a_n)+c$ for $n=1,2,...$.
where $d(m)$ is number of divisors of $m$. Prove that there exist $k$ natural such that sequence $a_k,a_{k+1},...$ is periodic.
Let $(a_k)^{\infty}_{k=0}$ be a sequence of real numbers such that if $k$ is a non-negative integer, then
$$a_{k+1} = 3a_k - \lfloor 2a_k \rfloor - \lfloor a_k \rfloor.$$
Definitely all positive integers $n$ such that if $a_0 = 1/n$, then this sequence is constant after a certain term.
A nonconstant polynomial $f$ with integral coefficients has the property that, for each prime $p$, there exist a prime $q$ and a positive integer $m$ such that $f(p) = q^m$. Prove that $f = X^n$ for some positive integer $n$.
[i]AMM Magazine[/i]
Given that $9\times10\times11\times\cdots\times15=32432400$, what is $1\times3\times5\times\cdots\times15$?
[i]2017 CCA Math Bonanza Team Round #1[/i]
A sequence with first term $a_0$ is defined such that $a_{n+1}=2a_n^2-1$ for $n\geq0.$ Let $N$ denote the number of possible values of $a_0$ such that $a_0=a_{2020}.$ Find the number of factors of $N.$
[i]Proposed by Alex Li[/i]
Let $\alpha$ be a real number in the interval $(0,1).$ Prove that there exists a sequence $(\varepsilon_n)_{n\geq 1}$ where each term is either $0$ or $1$ such that the sequence $(s_n)_{n\geq 1}$ \[s_n=\frac{\varepsilon_1}{n(n+1)}+\frac{\varepsilon_2}{(n+1)(n+2)}+...+\frac{\varepsilon_n}{(2n-1)2n}\]verifies the inequality \[0\leq \alpha-2ns_n\leq\frac{2}{n+1}\] for any $n\geq 2.$
Do there exist a sequence $a_1, a_2, \ldots , a_n, \ldots$ of positive integers such that for any
positive integers $i, j$:
$$d(a_i + a_j ) = i + j?$$
Here $d(n)$ is the number of positive divisors of a positive integer
We say that a strictly increasing positive real sequence $a_1,a_2,\cdots $ is an [i]elf sequence[/i] if for any $c>0$ we can find an $N$ such that $a_n<cn$ for $n=N,N+1,\cdots$. Furthermore, we say that $a_n$ is a [i]hat[/i] if $a_{n-i}+a_{n+i}<2a_n$ for $\displaystyle 1\le i\le n-1$. Is it true that every elf sequence has infinitely many hats?
In a finite sequence of real numbers the sum of any seven successive terms is negative and the sum of any eleven successive terms is positive. Determine the maximum number of terms in the sequence.
The sequence $\left(a_{n}\right)_{n\in\mathbb{N}}$ is defined recursively as $a_{0}=a_{1}=1$, $a_{n+2}=5a_{n+1}-a_{n}-1$, $\forall n\in\mathbb{N}$
Prove that
$$a_{n}\mid a_{n+1}^{2}+a_{n+1}+1$$
for any $n\in\mathbb{N}$
The numbers from $1$ to $100$ are placed without repetition in each cell of a \(10 \times 10\) board. An increasing path of length \(k\) on this board is a sequence of cells \(c_1, c_2, \ldots, c_k\) such that, for each \(i = 2, 3, \ldots, k\), the following properties are satisfied:
• The cells \(c_i\) and \(c_{i-1}\) share a side or a vertex;
• The number in \(c_i\) is greater than the number in \(c_{i-1}\).
What is the largest positive integer \(k\) for which we can always find an increasing path of length \(k\), regardless of how the numbers from 1 to 100 are arranged on the board?
Given are a positive integer $n$ and an infinite sequence of proper fractions $x_0 = \frac{a_0}{n}$, $\ldots$, $x_i=\frac{a_i}{n+i}$, with $a_i < n+i$. Prove that there exist a positive integer $k$ and integers $c_1$, $\ldots$, $c_k$ such that \[ c_1 x_1 + \ldots + c_k x_k = 1. \]
[i]Proposed by M. Dubashinsky[/i]
Let $n>3$ be an integer. Integers $a_1, \dots, a_n$ are given so that $a_k\in \{k, -k\}$ for all $1\leq k\leq n$. Prove that there is a sequence of indices $1\leq k_1, k_2, \dots, k_n\leq n$, not necessarily distinct, for which the sums
\[a_{k_1}\]
\[a_{k_1}+a_{k_2}\]
\[a_{k_1}+a_{k_2}+a_{k_3}\]
\[\vdots\]
\[a_{k_1}+a_{k_2}+\cdots+a_{k_n}\]
have distinct residues modulo $2n+1$, and so that the last one is divisible by $2n+1$.
Let $\alpha$ be an irrational number with $0<\alpha < 1$, and draw a circle in the plane whose circumference has length $1$. Given any integer $n\ge 3$, define a sequence of points $P_1, P_2, \ldots , P_n$ as follows. First select any point $P_1$ on the circle, and for $2\le k\le n$ define $P_k$ as the point on the circle for which the length of arc $P_{k-1}P_k$ is $\alpha$, when travelling counterclockwise around the circle from $P_{k-1}$ to $P_k$. Suppose that $P_a$ and $P_b$ are the nearest adjacent points on either side of $P_n$. Prove that $a+b\le n$.
Let $a_o,a_1,a_2,..,a_ n$ be a non-decreasing sequence of $n+1$ real numbers where $a_0 = 0$ and for every $j > i $ we have $a_j - a_i \le j - i$. Show that $$\left (\sum_{i=0}^n a_i \right )^2 \ge \sum_{i=0}^n a_i^3$$
Define the sequence of positive integers $a_n$ recursively by $a_1=7$ and $a_n=7^{a_{n-1}}$ for all $n\geq 2$. Determine the last two digits of $a_{2007}$.
[b](a)[/b] Find the rearrangement $\{a_1, \dots , a_n\}$ of $\{1, 2, \dots, n\}$ that maximizes
\[a_1a_2 + a_2a_3 + \cdots + a_na_1 = Q.\]
[b](b)[/b] Find the rearrangement that minimizes $Q.$
A boy lives in a small island in which there are three roads at every junction. He starts
from his home and walks along the roads. At each junction he would choose to turn
to the road on his right or left alternatively, i.e., his choices would be . . ., left, right,
left,... Prove that he will eventually return to his home.
The sequence $a_0, a_1, a_2, ..$ is defined by $a_0 = a, a_{n+1} = a_n + L(a_n)$, where $L(m)$ is the last digit of $m$ (eg $L(14) = 4$). Suppose that the sequence is strictly increasing. Show that infinitely many terms must be divisible by $d = 3$. For what other d is this true?
Given a positive integer $k$, let $s(k)$ denote the sum of the digits of $k$. Let $a_1$, $a_2$, $a_3$, $...$ denote the strictly increasing sequence of all positive integers $n$ such that $s(7n + 1) = 7s(n) + 1$. Compute $a_{2023}$.
$(MOR 1)$ Denote by $[x]$ the greatest integer not exceeding $x$. For all real $k > 1$, define two sequences:
\[a_n(k) = [nk]\text{ and } b_n(k) =\left[\frac{nk}{k - 1}\right]\]
If $A(k) = \{a_n(k) : n \in\mathbb{N}\}$ and $B(k) = \{b_n(k) : n \in \mathbb{N}\}$, prove that $A(k)$ and $B(k)$ form a partition of $\mathbb{N}$ if and only if $k$ is irrational.
All possible $6$-digit numbers, in each of which the digits occur in nonincreasing order (from left to right, e.g. $877550$) are written as a sequence in increasing order. Find the $2005$-th number in this sequence.