Found problems: 5923
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?
A finite sequence of three-digit integers has the property that the tens and units digits of each term are, respectively, the hundreds and tens digits of the next term, and the tens and units digits of the last term are, respectively, the hundreds and tens digits of the first term. For example, such a sequence might begin with the terms $ 247,$ $ 275,$ and $ 756$ and end with the term $ 824.$ Let $ \mathcal{S}$ be the sum of all the terms in the sequence. What is the largest prime factor that always divides $ \mathcal{S}?$
$ \textbf{(A)}\ 3 \qquad \textbf{(B)}\ 7 \qquad \textbf{(C)}\ 13 \qquad \textbf{(D)}\ 37 \qquad \textbf{(E)}\ 43$
Is there exist a sequence $a_0,a_1,a_2,\cdots $ consisting of non-zero integers that satisfies the following condition?
[b]Condition[/b]: For all integers $n$ ($\ge 2020$), equation
$$a_n x^n+a_{n-1}x^{n-1}+\cdots +a_0=0$$
has a real root with its absolute value larger than $2.001$.
Let $F_1,F_2,F_3,...$ be the [i]Fibonacci sequence[/i], the sequence of positive integers with $F_1 =F_2 =1$ and $F_{n+2}=F_{n+1}+F_n$ for all $n \ge 1$. A [i]Fibonacci number[/i] is by definition a number appearing in this sequence.
Let $P_1,P_2,P_3,...$ be the sequence consisting of all the integers that are products of two Fibonacci numbers (not
necessarily distinct) in increasing order. The first few terms are $1,2,3,4,5,6,8,9,10,13,...$ since, for example $3 = 1 \cdot 3, 4 = 2 \cdot 2$, and $10 = 2 \cdot 5$.
Consider the sequence $D_n$ of [i]successive [/i] differences of the $P_n$ sequence, where $D_n = P_{n+1}-P_n$ for $n \ge 1$. The first few terms of D_n are $1,1,1,1,1,2,1,1,3, ...$ .
Prove that every number in $D_n$ is a [i]Fibonacci number[/i].
Zeros of a fourth-degree polynomial $f (x)$ form an arithmetic progression. Prove that the zeros of $f '(x)$ also form an arithmetic progression.
The sequence $a_0,a_1,a_2,...$ is defined such that $a_0 = 2+ \sqrt3$, $a_1 =\sqrt{5-2\sqrt5}$, and
$$a_n a_{n-1}a_{n-2} - a_n + a_{n-1} + a_{n-2} = 0.$$
Find the least positive integer $n$ such that $a_n = 1$.
Let $n \geqslant 3$ be a positive integer and let $\left(a_{1}, a_{2}, \ldots, a_{n}\right)$ be a strictly increasing sequence of $n$ positive real numbers with sum equal to 2. Let $X$ be a subset of $\{1,2, \ldots, n\}$ such that the value of
\[
\left|1-\sum_{i \in X} a_{i}\right|
\]
is minimised. Prove that there exists a strictly increasing sequence of $n$ positive real numbers $\left(b_{1}, b_{2}, \ldots, b_{n}\right)$ with sum equal to 2 such that
\[
\sum_{i \in X} b_{i}=1.
\]
Define the sequence $a_0,a_1,a_2,\hdots$ by $a_n=2^n+2^{\lfloor n/2\rfloor}$. Prove that there are infinitely many terms of the sequence which can be expressed as a sum of (two or more) distinct terms of the sequence, as well as infinitely many of those which cannot be expressed in such a way.
Let $A$ be a finite set of positive reals, let $B = \{x/y\mid x,y\in A\}$ and let $C = \{xy\mid x,y\in A\}$.
Show that $|A|\cdot|B|\le|C|^2$.
[i](Proposed by Gerhard Woeginger, Austria)[/i]
Given are polynomial $f(x)$ with non-negative integral coefficients and positive integer $a.$ The sequence $\{a_{n}\}$ is defined by $a_{1}=a,$ $a_{n+1}=f(a_{n}).$ It is known that the set of primes dividing at least one of the terms of this sequence is finite.
Prove that $f(x)=cx^{k}$ for some non-negative integral $c$ and $k.$
[i]Proposed by F. Petrov[/i]
[hide="For those of you who liked this problem."]
Check [url=http://www.artofproblemsolving.com/Forum/viewtopic.php?t=62259]this thread[/url] out.[/hide]
Let $a_1,a_2,a_3,\ldots$ be a sequence of integers, with the property that every consecutive group of $a_i$'s averages to a perfect square. More precisely, for every positive integers $n$ and $k$, the quantity \[\frac{a_n+a_{n+1}+\cdots+a_{n+k-1}}{k}\] is always the square of an integer. Prove that the sequence must be constant (all $a_i$ are equal to the same perfect square).
[i]Evan O'Dorney and Victor Wang[/i]
$a$ and $b$ are fixed real numbers. With $x_n$ we denote the sum of the digits of $an+b$ in the decimal number system. Prove that the sequence $x_n$ contains an infinite constant subsequence.
Let $(a_n)$ be the Lucas sequence: $a_0=2,a_1=1, a_{n+1}=a_n+a_{n-1}$ for $n\geq 1$. Show that $a_{59}$ divides $(a_{30})^{59}-1$.
Consider a sequence $(a_k)_{k \ge 1}$ of natural numbers defined as follows: $a_1=a$ and $a_2=b$ with $a,b>1$ and $\gcd(a,b)=1$ and for all $k>0$, $a_{k+2}=a_{k+1}+a_k$. Prove that for all natural numbers $n$ and $k$, $\gcd(a_n,a_{n+k}) <\frac{a_k}{2}$.
Let $a$ and $b$ be two odd positive integers. Define the sequence $(x_n)_{n\in\mathbb{N}}$ as such: $x_1=a, x_2=b,$ for every $n\geq3$ the term $x_n{}$ is the greatest odd integer of $x_{n-1}+x_{n-2}$. Show that starting with a term, all the following terms are constant.
Let $X$ be a set of $100$ elements. Find the smallest possible $n$ satisfying the following condition: Given a sequence of $n$ subsets of $X$, $A_1,A_2,\ldots,A_n$, there exists $1 \leq i < j < k \leq n$ such that
$$A_i \subseteq A_j \subseteq A_k \text{ or } A_i \supseteq A_j \supseteq A_k.$$
If $(a_n)$ is a sequence of real numbers such that for $n \geq 1$
$$(2-a_n )a_{n+1} =1,$$
prove that $\lim_{n\to \infty} a_n =1.$
For each fixed positiver integer $n$, $n\geq 4$ and $P$ an integer, let $(P)_n \in [1, n]$ be the smallest positive residue of $P$ modulo $n$. Two sequences $a_1, a_2, \dots, a_k$ and $b_1, b_2, \dots, b_k$ with the terms in $[1, n]$ are defined as equivalent, if there is $t$ positive integer, gcd$(t,n)=1$, such that the sequence $(ta_1)_n, \dots, (ta_k)_n$ is a permutation of $b_1, b_2, \dots, b_k$.
Let $\alpha$ a sequence of size $n$ and your terms are in $[1, n]$, such that each term appears $h$ times in the sequence $\alpha$ and $2h\geq n$.
Show that $\alpha$ is equivalent to some sequence $\beta$ which contains a subsequence such that your size is(at most) equal to $h$ and your sum is exactly equal to $n$.
Let $a_1,a_2,a_3,\ldots$ be a sequence of all composite positive integers in increasing order. A sequence $b_1,b_2,b_3,\ldots$ is given for all positive integers $i$ by equation $$b_i=ia_1^2+(i-1)a_2^2+\ldots+2a_{i-1}^2+a_i^2$$
What is the maximum amount of consecutive elements of sequence $b_1,b_2,b_3,\ldots$ which can be divisible by $3$?
[i]M. Shutro[/i]
Let $\mathbb Z$ be the set of integers. We consider functions $f :\mathbb Z\to\mathbb Z$ satisfying
\[f\left(f(x+y)+y\right)=f\left(f(x)+y\right)\]
for all integers $x$ and $y$. For such a function, we say that an integer $v$ is [i]f-rare[/i] if the set
\[X_v=\{x\in\mathbb Z:f(x)=v\}\]
is finite and nonempty.
(a) Prove that there exists such a function $f$ for which there is an $f$-rare integer.
(b) Prove that no such function $f$ can have more than one $f$-rare integer.
[i]Netherlands[/i]
Let $ \{a_n\}_{n \in \mathbb{N}_0}$ be a sequence defined as follows: $ a_1=0$, $ a_n=a_{[\frac{n}{2}]}+(-1)^{n(n+1)/2}$, where $ [x]$ denotes the floor function. For every $ k \ge 0$, find the number $ n(k)$ of positive integers $ n$ such that $ 2^k \le n < 2^{k+1}$ and $ a_n=0$.
Consider a $100 \times 100$ table, and identify the cell in row $a$ and column $b$, $1 \leq a, b \leq 100$, with the ordered pair $(a, b)$. Let $k$ be an integer such that $51 \leq k \leq 99$. A $k$-knight is a piece that moves one cell vertically or horizontally and $k$ cells to the other direction; that is, it moves from $(a, b)$ to $(c, d)$ such that $(|a-c|, |b - d|)$ is either $(1, k)$ or $(k, 1)$. The $k$-knight starts at cell $(1, 1)$, and performs several moves. A sequence of moves is a sequence of cells $(x_0, y_0)= (1, 1)$, $(x_1, y_1), (x_2, y_2)$, $\ldots, (x_n, y_n)$ such that, for all $i = 1, 2, \ldots, n$, $1 \leq x_i , y_i \leq 100$ and the $k$-knight can move from $(x_{i-1}, y_{i-1})$ to $(x_i, y_i)$. In this case, each cell $(x_i, y_i)$ is said to be reachable. For each $k$, find $L(k)$, the number of reachable cells.
Let $\sigma$ be a bijection on the positive integers. Let $x_1,x_2,x_3,\ldots$ be a sequence of real numbers with the following three properties:
$(\text i)$ $|x_n|$ is a strictly decreasing function of $n$;
$(\text{ii})$ $|\sigma(n)-n|\cdot|x_n|\to0$ as $n\to\infty$;
$(\text{iii})$ $\lim_{n\to\infty}\sum_{k=1}^nx_k=1$.
Prove or disprove that these conditions imply that
$$\lim_{n\to\infty}\sum_{k=1}^nx_{\sigma(k)}=1.$$
Find all functions $f: \mathbb{N}\to \mathbb{N}$ such that for all $n\in \mathbb{N}$: \[f(f(m)+f(n))=m+n.\]
[b]p1[/b]. Consider the following four statements referring to themselves:
1. At least one of these statements is true.
2. At least two of these statements are false.
3. At least three of these statements are true.
4. All four of these statements are false.
Determine which statements are true and which are false. Justify your answer.
[b]p2.[/b] Let $f(x) = a_{2017}x^{2017} + a_{2016}x^{2016} + ... + a_1x + a_0$ where the coefficients $a_0, a_1, ... , a_{2017}$ have not yet been determined. Alice and Bob play the following game:
$\bullet$ Alice and Bob alternate choosing nonzero integer values for the coefficients, with Alice going first. (For example, Alice’s first move could be to set $a_{18}$ to $-3$.)
$\bullet$ After all of the coefficients have been chosen:
- If f(x) has an integer root then Alice wins.
- If f(x) does not have an integer root then Bob wins.
Determine which player has a winning strategy and what the strategy is. Make sure to justify your answer.
[b]p3.[/b] Suppose that a circle can be inscribed in a polygon $P$ with $2017$ equal sides. Prove that $P$ is a regular polygon; that is, all angles of $P$ are also equal.
[b]p4.[/b] A $3 \times 3 \times 3$ cube of cheese is sliced into twenty-seven $ 1 \times 1 \times 1$ blocks. A mouse starts anywhere on the outside and eats one of the $1\times 1\times 1$ cubes. He then moves to an adjacent cube (in any direction), eats that cube, and continues until he has eaten all $27$ cubes. (Two cubes are considered adjacent if they share a face.) Prove that no matter what strategy the mouse uses, he cannot eat the middle cube last.
[Note: One should neglect gravity – intermediate configurations don’t collapse.]
p5. Suppose that a constant $c > 0$ and an infinite sequence of real numbers $x_0, x_1, x_2, ...$ satisfy
$x_{k+1} =\frac{x_k + 1}{1 - cx_k}$ for all $k \ge 0$. Prove that the sequence $x_0, x_1, x_2, ....$ contains infinitely many positive terms and also contains infinitely many negative terms.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].