Found problems: 5802
Let $b$ and $c$ be any two positive integers. Define an integer sequence $a_n$, for $n\geq 1$, by $a_1=1$, $a_2=1$, $a_3=b$ and $a_{n+3}=ba_{n+2}a_{n+1}+ca_n$.
Find all positive integers $r$ for which there exists a positive integer $n$ such that the number $a_n$ is divisible by $r$.
Given $n$ sets $A_i$, with $| A_i | = n$, prove they may be indexed $A_i = \{a_{i,j} \mid j=1,2,\ldots,n \}$, in such way that the sets $B_j = \{a_{i,j} \mid i=1,2,\ldots,n \}$, $1\leq j\leq n$, also have $| B_j | = n$.
(Anonymous)
A prime number $p$ is a [b]moderate[/b] number if for every $2$ positive integers $k > 1$ and $m$, there exists k positive integers $n_1, n_2, ..., n_k $ such that \[ n_1^2+n_2^2+ ... +n_k^2=p^{k+m} \]
If $q$ is the smallest [b]moderate[/b] number, then determine the smallest prime $r$ which is not moderate and $q < r$.
Prove that for each $ n$:
\[ \sum_{k\equal{}1}^n\binom{n\plus{}k\minus{}1}{2k\minus{}1}\equal{}F_{2n}\]
In a table consisting of $2021\times 2021$ unit squares, some unit squares are colored black in such a way that if we place a mouse in the center of any square on the table it can walk in a straight line (up, down, left or right along a column or row) and leave the table without walking on any black square (other than the initial one if it is black). What is the maximum number of squares that can be colored black?
In each square of a garden shaped like a $2022 \times 2022$ board, there is initially a tree of height $0$. A gardener and a lumberjack alternate turns playing the following game, with the gardener taking the first turn:
[list]
[*] The gardener chooses a square in the garden. Each tree on that square and all the surrounding squares (of which there are at most eight) then becomes one unit taller.
[*] The lumberjack then chooses four different squares on the board. Each tree of positive height on those squares then becomes one unit shorter.
[/list]
We say that a tree is [i]majestic[/i] if its height is at least $10^6$. Determine the largest $K$ such that the gardener can ensure there are eventually $K$ majestic trees on the board, no matter how the lumberjack plays.
A sequence of positive real numbers $a_1, a_2, a_3, ... $ satisfies $a_n = a_{n-1} + a_{n-2}$ for all $n \ge 3$. A sequence $b_1, b_2, b_3, ...$ is defined by equations
$b_1 = a_1$ ,
$b_n = a_n + (b_1 + b_3 + ...+ b_{n-1})$ for even $n > 1$ ,
$b_n = a_n + (b_2 + b_4 + ... +b_{n-1})$ for odd $n > 1$.
Prove that if $n\ge 3$, then $\frac13 < \frac{b_n}{n \cdot a_n} < 1$
Two positive integers $a$ and $b$ are prime-related if $a = pb$ or $b = pa$ for some prime $p$. Find all positive integers $n$, such that $n$ has at least three divisors, and all the divisors can be arranged without repetition in a circle so that any two adjacent divisors are prime-related.
Note that $1$ and $n$ are included as divisors.
A crazy physicist discovered a new kind of particle wich he called an imon, after some of them mysteriously appeared in his lab. Some pairs of imons in the lab can be entangled, and each imon can participate in many entanglement relations. The physicist has found a way to perform the following two kinds of operations with these particles, one operation at a time.
(i) If some imon is entangled with an odd number of other imons in the lab, then the physicist can destroy it.
(ii) At any moment, he may double the whole family of imons in the lab by creating a copy $I'$ of each imon $I$. During this procedure, the two copies $I'$ and $J'$ become entangled if and only if the original imons $I$ and $J$ are entangled, and each copy $I'$ becomes entangled with its original imon $I$; no other entanglements occur or disappear at this moment.
Prove that the physicist may apply a sequence of such operations resulting in a family of imons, no two of which are entangled.
A strictly increasing sequence of positive integers $a_1, a_2, a_3, \ldots$ has the property that for every positive integer $k$, the subsequence $a_{2k-1}, a_{2k}, a_{2k+1}$ is geometric and the subsequence $a_{2k}, a_{2k+1}, a_{2k+2}$ is arithmetic. Suppose that $a_{13} = 2016$. Find $a_1$.
Show that for all positive integer $n$ the following inequality holds $3^{n^2} > (n!)^4$
.
Determine all functions $f:\mathbb{R}^{+} \to \mathbb{R}^{+}$ such that for any positive reals $x,y$,
$$f(xy+f(xy)) = xf(y) + yf(x)$$
Let $a_0,a_1,a_2,\dots $ be a sequence of real numbers such that $a_0=0, a_1=1,$ and for every $n\geq 2$ there exists $1 \leq k \leq n$ satisfying \[ a_n=\frac{a_{n-1}+\dots + a_{n-k}}{k}. \]Find the maximum possible value of $a_{2018}-a_{2017}$.
Find the least $n\in N$ such that among any $n$ rays in space sharing a common origin there exist two which form an acute angle.
Define $L(x) = x - \frac{x^2}{2}$ for every real number $x$. If $n$ is a positive integer, define $a_n$ by
\[
a_n = L \Bigl( L \Bigl( L \Bigl( \cdots L \Bigl( \frac{17}{n} \Bigr) \cdots \Bigr) \Bigr) \Bigr),
\]
where there are $n$ iterations of $L$. For example,
\[
a_4 = L \Bigl( L \Bigl( L \Bigl( L \Bigl( \frac{17}{4} \Bigr) \Bigr) \Bigr) \Bigr).
\]
As $n$ approaches infinity, what value does $n a_n$ approach?
Find all integers $n \ge 2$ for which there exists an integer $m$ and a polynomial $P(x)$ with integer coefficients satisfying the following three conditions: [list] [*]$m > 1$ and $\gcd(m,n) = 1$; [*]the numbers $P(0)$, $P^2(0)$, $\ldots$, $P^{m-1}(0)$ are not divisible by $n$; and [*]$P^m(0)$ is divisible by $n$. [/list] Here $P^k$ means $P$ applied $k$ times, so $P^1(0) = P(0)$, $P^2(0) = P(P(0))$, etc.
[i]Carl Schildkraut[/i]
We call an ordered set of distinct natural numbers good if for any two numbers in it, the larger one is divided by the smaller one. Prove that the number $(n + 1)! – 1$ can be represented as $x_1 + 2x_2 + \ldots + nx_n$, where $\{ x_1, x_2, \ldots , x_n \}$ is a good set, by at least $n!$ ways.
Let $n\in {{\mathbb{N}}^{*}}$. Prove that $2\sqrt{{{2}^{n}}}\cos \left( n\arccos \frac{\sqrt{2}}{4} \right)$ is an odd integer.
Consider all the possible subsets of the set $\{1,2,..., N\}$ which do not contain any consecutive numbers. Prove that the sum of the squares of the products of the numbers in these subsets is $(N + 1)! - 1$.
(Based on idea of R.P. Stanley)
Let $a_0 < a_1 < a_2 < \dots$ be an infinite sequence of positive integers. Prove that there exists a unique integer $n\geq 1$ such that
\[a_n < \frac{a_0+a_1+a_2+\cdots+a_n}{n} \leq a_{n+1}.\]
[i]Proposed by Gerhard Wöginger, Austria.[/i]
Let $f:\mathbb{R} \to \mathbb{R}$ be a function that is a function that is differentiable $n+1$ times for some positive integer $n$ . The $i^{th}$ derivative of $f$ is denoted by $f^{(i)}$ . Suppose-
$f(1)=f(0)=f^{(1)}(0)=...=f^{(n)}(0)=0$.
Prove that $f^{(n+1)}(x)=0$ for some $x \in (0,1)$
A sequence $x_1, x_2, \ldots$ is defined by $x_1 = 1$ and $x_{2k}=-x_k, x_{2k-1} = (-1)^{k+1}x_k$ for all $k \geq 1.$ Prove that $\forall n \geq 1$ $x_1 + x_2 + \ldots + x_n \geq 0.$
[i]Proposed by Gerhard Wöginger, Austria[/i]
The function $f$ is defined on the set of integers and satisfies \[ f(n)=\begin{cases} n-3 & \text{if } n\ge 1000 \\ f(f(n+5)) & \text{if } n<1000\end{cases} \] Find $f(84)$.
For a set $S$ of nonnegative integers, let $r_S(n)$ denote the number of ordered pairs $(s_1, s_2)$ such that $s_1 \in S$, $s_2 \in S$, $s_1 \neq s_2$, and $s_1 + s_2 = n$. Is it possible to partition the nonnegative integers into two sets $A$ and $B$ in such a way that $r_A(n) = r_B(n)$ for all $n$?
Consider a sequence of real numbers defined by:
\begin{align*}
x_{1} & = c \\
x_{n+1} & = cx_{n} + \sqrt{c^{2} - 1}\sqrt{x_{n}^{2} - 1} \quad \text{for all } n \geq 1.
\end{align*}
Show that if $c$ is a positive integer, then $x_{n}$ is an integer for all $n \geq 1$. [i](South Africa)[/i]