Found problems: 5923
What is the number of nondecreasing positive integer sequences of length $7$ whose last term is at most $9$?
Let $c$ be a fixed positive integer, and let ${a_n}^{\inf}_{n=1}$ be a sequence of positive integers such that $a_n < a_{n+1} < a_n+c$ for every positive integer $n$. Let $s$ denote the infinite string of digits obtained by writing the terms in the sequence consecutively from left to right, starting from the first term. For every positive integer $k$, let $s_k$ denote the number whose decimal representation is identical to the $k$ most left digits of $s$. Prove that for every positive integer $m$ there exists a positive integer $k$ such that $s_k$ is divisible by $m$.
Let be the sequence $ \left( I_n \right)_{n\ge 1} $ defined as $ I_n=\int_0^{\pi } \frac{dx}{x+\sin^n x +\cos^n x} . $
[b]a)[/b] Study the monotony of $ \left( I_n \right)_{n\ge 1} . $
[b]b)[/b] Calculate the limit of $ \left( I_n \right)_{n\ge 1} . $
For each integer $k\geq 2$, determine all infinite sequences of positive integers $a_1$, $a_2$, $\ldots$ for which there exists a polynomial $P$ of the form \[ P(x)=x^k+c_{k-1}x^{k-1}+\dots + c_1 x+c_0, \] where $c_0$, $c_1$, \dots, $c_{k-1}$ are non-negative integers, such that \[ P(a_n)=a_{n+1}a_{n+2}\cdots a_{n+k} \] for every integer $n\geq 1$.
Let $n > 1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k )_{k\ge 1}$, defined by \[a_k=\left\lfloor\frac{n^k}{k}\right\rfloor,\] are odd. (For a real number $x$, $\lfloor x\rfloor$ denotes the largest integer not exceeding $x$.)
[i]Proposed by Hong Kong[/i]
Let $n> 2$ be a positive integer. Given is a horizontal row of $n$ cells where each cell is painted blue or red. We say that a block is a sequence of consecutive boxes of the same color. Arepito the crab is initially standing at the leftmost cell. On each turn, he counts the number $m$ of cells belonging to the largest block containing the square he is on, and does one of the following:
If the square he is on is blue and there are at least $m$ squares to the right of him, Arepito moves $m$ squares to the right;
If the square he is in is red and there are at least $m$ squares to the left of him, Arepito moves $m$ cells to the left;
In any other case, he stays on the same square and does not move any further.
For each $n$, determine the smallest integer $k$ for which there is an initial coloring of the row with $k$ blue cells, for which Arepito will reach the rightmost cell.
Let us choose arbitrarily $n$ vertices of a regular $2n$-gon and color them red. The remaining vertices are colored blue. We arrange all red-red distances into a nondecreasing sequence and do the same with the blue-blue distances. Prove that the two sequences thus obtained are identical.
The sequence $ (a_n)$ is given by $ a_1\equal{}1,a_2\equal{}0$ and:
$ a_{2k\plus{}1}\equal{}a_k\plus{}a_{k\plus{}1}, a_{2k\plus{}2}\equal{}2a_{k\plus{}1}$ for $ k \in \mathbb{N}.$
Find $ a_m$ for $ m\equal{}2^{19}\plus{}91.$
Let $k$ be a fixed natural number. In the infinite number of real line, each integer is colored with color ..., red, green, blue, red, green, blue, ... and so on. A number of flea settles at first at integer points. On each turn, a flea will jump over the other tick so that the distance $k$ is the original distance. Formally, we may choose $2$ tails $A, B$ that are spaced $n$ and move $A$ to the different side of $B$ so the current distance is $kn$. Some fleas may occupy the same point because we consider the size of fleas very small. Determine all the values of $k$ so that, whatever the initial position of the ticks, we always get a position where all ticks land on the same color.
Given a finite sequence of integers $a_{1},$ $a_{2},$ $...,$ $a_{n}$ for $n\geq 2.$ Show that there exists a subsequence $a_{k_{1}},$ $a_{k_{2}},$ $...,$ $a_{k_{m}},$ where $1\leq k_{1}\leq k_{2}\leq...\leq k_{m}\leq n,$ such that the number $a_{k_{1}}^{2}+a_{k_{2}}^{2}+...+a_{k_{m}}^{2}$ is divisible by
$n.$
[b]Note by Darij:[/b] Of course, the $1\leq k_{1}\leq k_{2}\leq ...\leq k_{m}\leq n$ should be understood as $1\leq k_{1}<k_{2}<...<k_{m}\leq n;$ else, we could take $m=n$ and $k_{1}=k_{2}=...=k_{m},$ so that the number $a_{k_{1}}^{2}+a_{k_{2}}^{2}+...+a_{k_{m}}^{2}=n^{2}a_{k_{1}}^{2}$ will surely be divisible by $n.$
Consider the expanded form of $\left(x+\frac{1}{2\sqrt[4]{x}}\right)^n$, put all items in number (from high power to low power). If the coefficients of the first three items are arithmetic sequence, then the number of items with an integral power is________.
Starting from a given cyclic quadrilateral $\mathcal{Q}_0$, a sequence of quadrilaterals is constructed so that $\mathcal{Q}_{k + 1}$ is the circumscribed quadrilateral of $\mathcal{Q}_k$ for $k = 0,1,\dots$. The sequence terminates when a quadrilateral is reached that is not cyclic. (The circumscribed quadrilateral of a cylic quadrilateral $ABCD$ has sides that are tangent to the circumcircle of $ABCD$ at $A$, $B$, $C$ and $D$.) Prove that the sequence always terminates, except when $\mathcal{Q}_0$ is a square.
Let $\lambda$ the positive root of the equation $t^2-1998t-1=0$. It is defined the sequence $x_0,x_1,x_2,\ldots,x_n,\ldots$ by $x_0=1,\ x_{n+1}=\lfloor\lambda{x_n}\rfloor\mbox{ for }n=1,2\ldots$ Find the remainder of the division of $x_{1998}$ by $1998$.
Note: $\lfloor{x}\rfloor$ is the greatest integer less than or equal to $x$.
The sequence $(p_n)$ is defined as follows: $p_1=2$ and for all $n$ greater than or equal to $2$, $p_n$ is the largest prime divisor of the expression $p_1p_2p_3\ldots p_{n-1}+1$.
Prove that every $p_n$ is different from $5$.
The sequence $(a_n)_{n\geq 1}$ is defined by $a_1=1,a_2=2,a_3=24,$ and, for $n\geq 4,$ \[a_n=\dfrac{6a_{n-1}^2a_{n-3}-8a_{n-1}a_{n-2}^2}{a_{n-2}a_{n-3}}.\] Show that, for all $n$, $a_n$ is an integer multiple of $n$.
Suppose that $(a_1,\ldots,a_{20})$ and $(b_1,\ldots,b_{20})$ are two sequences of integers such that the sequence $(a_1,\ldots,a_{20},b_1,\ldots,b_{20})$ contains each of the numbers $1,\ldots,40$ exactly once. What is the maximum possible value of the sum \[\sum_{i=1}^{20}\sum_{j=1}^{20}\min(a_i,b_j)?\]
A sequence $(G_n)_{n=0}^{\infty}$ satisfies $G(0) = 0$ and $G(n) = n-G(G(n-1))$ for each $n \in N$. Show that
(a) $G(k) \ge G(k -1)$ for every $k \in N$;
(b) there is no integer $k$ for which $G(k -1) = G(k) = G(k +1)$.
A sequence of integers $(a_n)$ satisfies $a_{n+1} = a_n^3 + 1999$ for $n = 1,2,....$
Prove that there exists at most one $n$ for which $a_n$ is a perfect square.
For an integer $m\geq 4,$ let $T_{m}$ denote the number of sequences $a_{1},\dots,a_{m}$ such that the following conditions hold:
(1) For all $i=1,2,\dots,m$ we have $a_{i}\in \{1,2,3,4\}$
(2) $a_{1} = a_{m} = 1$ and $a_{2}\neq 1$
(3) For all $i=3,4\cdots, m, a_{i}\neq a_{i-1}, a_{i}\neq a_{i-2}.$
Prove that there exists a geometric sequence of positive integers $\{g_{n}\}$ such that for $n\geq 4$ we have that \[ g_{n} - 2\sqrt{g_{n}} < T_{n} < g_{n} + 2\sqrt{g_{n}}.\]
Let $ a_1,a_2,a_3,\dots$ be infinite sequence of positive integers satisfying the following conditon: for each prime number $ p$, there are only finite number of positive integers $ i$ such that $ p|a_i$. Prove that that sequence contains a sub-sequence $ a_{i_1},a_{i_2},a_{i_3},\dots$, with $ 1 \le i_1<i_2<i_3<\dots$, such that for each $ m \ne n$, $ \gcd(a_{i_m},a_{i_n})\equal{}1$.
Let $X_1, X_2, \ldots, X_{100}$ be a sequence of mutually distinct nonempty subsets of a set $S$. Any two sets $X_i$ and $X_{i+1}$ are disjoint and their union is not the whole set $S$, that is, $X_i\cap X_{i+1}=\emptyset$ and $X_i\cup X_{i+1}\neq S$, for all $i\in\{1, \ldots, 99\}$. Find the smallest possible number of elements in $S$.
Let $(a_{n})_{n\ge 0}$ and $(b_{n})_{n\ge 0}$ be two sequences with arbitrary real values $a_0, a_1, b_0, b_1$. For $n\ge 1$, let $a_{n+1}, b_{n+1}$ be defined in this way:
$$a_{n+1}=\dfrac{b_{n-1}+b_{n}}{2}, b_{n+1}=\dfrac{a_{n-1}+a_{n}}{2}$$
Prove that for any constant $c>0$ there exists a positive integer $N$ s.t. for all $n>N$, $|a_{n}-b_{n}|<c$.
A sequence $(a_1, a_2,...,a_k)$ consisting of pairwise different cells of an $n\times n$ board is called a cycle if $k \ge 4$ and cell ai shares a side with cell $a_{i+1}$ for every $i = 1,2,..., k$, where $a_{k+1} = a_1$. We will say that a subset $X$ of the set of cells of a board is [i]malicious [/i] if every cycle on the board contains at least one cell belonging to $X$. Determine all real numbers $C$ with the following property: for every integer $n \ge 2$ on an $n\times n$ board there exists a malicious set containing at most $Cn^2$ cells.
Let $m_1, m_2, \ldots, m_n$ be a collection of $n$ positive integers, not necessarily distinct. For any sequence of integers $A = (a_1, \ldots, a_n)$ and any permutation $w = w_1, \ldots, w_n$ of $m_1, \ldots, m_n$, define an [i]$A$-inversion[/i] of $w$ to be a pair of entries $w_i, w_j$ with $i < j$ for which one of the following conditions holds:
[list]
[*]$a_i \ge w_i > w_j$
[*]$w_j > a_i \ge w_i$, or
[*]$w_i > w_j > a_i$.
[/list]
Show that, for any two sequences of integers $A = (a_1, \ldots, a_n)$ and $B = (b_1, \ldots, b_n)$, and for any positive integer $k$, the number of permutations of $m_1, \ldots, m_n$ having exactly $k$ $A$-inversions is equal to the number of permutations of $m_1, \ldots, m_n$ having exactly $k$ $B$-inversions.
Find all finite sequences $(x_0, x_1, \ldots,x_n)$ such that for every $j$, $0 \leq j \leq n$, $x_j$ equals the number of times $j$ appears in the sequence.