Found problems: 766
Let $a_1, a_2, a_3, \ldots$ be a sequence of positive real numbers, and $s$ be a positive integer, such that
\[a_n = \max \{ a_k + a_{n-k} \mid 1 \leq k \leq n-1 \} \ \textrm{ for all } \ n > s.\]
Prove there exist positive integers $\ell \leq s$ and $N$, such that
\[a_n = a_{\ell} + a_{n - \ell} \ \textrm{ for all } \ n \geq N.\]
[i]Proposed by Morteza Saghafiyan, Iran[/i]
Let $k$ be a positive integer. For each nonnegative integer $n$, let $f(n)$ be the number of solutions $(x_1,\ldots,x_k)\in\mathbb{Z}^k$ of the inequality $|x_1|+...+|x_k|\leq n$. Prove that for every $n\ge1$, we have $f(n-1)f(n+1)\leq f(n)^2$.
(Proposed by Esteban Arreaga, Renan Finder and José Madrid, IMPA, Rio de Janeiro)
Determine whether there exist two reals $x,y$ and a sequence $\{a_n\}_{n=0}^{\infty}$ of nonzero reals such that $a_{n+2}=xa_{n+1}+ya_n$ for all $n\ge0$ and for every positive real number $r$, there exist positive integers $i,j$ such that $|a_i|<r<|a_j|$.
[i]Alex Zhu.[/i]
Let $P=A_1A_2\cdots A_k$ be a convex polygon in the plane. The vertices $A_1, A_2, \ldots, A_k$ have integral coordinates and lie on a circle. Let $S$ be the area of $P$. An odd positive integer $n$ is given such that the squares of the side lengths of $P$ are integers divisible by $n$. Prove that $2S$ is an integer divisible by $n$.
For natural numbers $x_1,\ldots,x_k$, let $[x_k,\ldots,x_1]$ be defined recurrently as follows: $[x_2,x_1]=x_2^{x_1}$ and, for $k\ge3$, $[x_k,x_{k-1},\ldots,x_1]=x_k^{[x_{k-1},\ldots,x_1]}$.
(a) Let $3\le a_1\le a_2\le\ldots\le a_n$be integers. For a permutation $\sigma$ of the set $\{1,2,\ldots,n\}$, we set $P(\sigma)=[a_{\sigma(n)},a_{\sigma(n-1)},\ldots,a_{\sigma(1)}]$. Find the permutations $\sigma$ for which $P(\sigma)$ is minimal or maximal.
(b) Find all integers $a,b,c,d$, greater than or equal to $2$, for which $[178,9]\le[a,b,c,d]\le[198,9]$.
Let $f_0$ be the function from $\mathbb{Z}^2$ to $\{0,1\}$ such that $f_0(0,0)=1$ and $f_0(x,y)=0$ otherwise. For each positive integer $m$, let $f_m(x,y)$ be the remainder when \[ f_{m-1}(x,y) + \sum_{j=-1}^{1} \sum_{k=-1}^{1} f_{m-1}(x+j,y+k) \] is divided by $2$.
Finally, for each nonnegative integer $n$, let $a_n$ denote the number of pairs $(x,y)$ such that $f_n(x,y) = 1$.
Find a closed form for $a_n$.
[i]Proposed by Bobby Shen[/i]
Let $ a$ be the greatest positive root of the equation $ x^3 \minus{} 3 \cdot x^2 \plus{} 1 \equal{} 0.$ Show that $ \left[a^{1788} \right]$ and $ \left[a^{1988} \right]$ are both divisible by 17. Here $ [x]$ denotes the integer part of $ x.$
Where $n$ is a positive integer, the sequence $a_n$ is determined by the formula $$a_{n+1}=\frac{1}{a_1 + a_2 +... + a_n} -\sqrt2, \,a_1 = 1.$$ Find the limit of the sequence $S_n$ defined by $S_n=a_1 + a_2 +... + a_n$.
Consider all arithmetical sequences of real numbers $(x_i)^{\infty}=1$ and $(y_i)^{\infty} =1$ with the common first term, such that for some $k > 1, x_{k-1}y_{k-1} = 42, x_ky_k = 30$, and $x_{k+1}y_{k+1} = 16$. Find all such pairs of sequences with the maximum possible $k$.
$\{a_n\}$ is a positive integer sequence such that $a_{i+2} = a_{i+1} +a_i$ (for all $i \ge 1$).
For positive integer $n$, de fine as $$b_n=\frac{1}{a_{2n+1}}\Sigma_{i=1}^{4n-2}a_i$$
Prove that $b_n$ is positive integer.
Let $ a_0 $ be a real number. The sequence $ \{a_n \} $ is given by $ a_ {n + 1} = 3 ^ n-5a_n $, $ n = 0,1,2, \ldots $.
a) Express the general member $ a_n $ through $ a_0 $ and $ n. $
b) Find such $ a_0, $ that $ a_ {n + 1}> a_n, $ for every $ n. $
Given the sequence $(u_n)_{n=1}^{\infty}$, where $u_1 = 1, u_2 = 2$, and $u_{n + 2} = u_{n + 1} +u_ n+ \frac{(-1)^n-1}{2}$ for any positive integers $n$. Prove that every positive integers can be expressed as the sum of some distinguished numbers of the sequence of numbers $(u_n)_{n=1}^{\infty}$
Nguyen Duy Thai Son, The University of Danang, Da Nang.
$(GBR 5)$ Let us define $u_0 = 0, u_1 = 1$ and for $n\ge 0, u_{n+2} = au_{n+1}+bu_n, a$ and $b$ being positive integers. Express $u_n$ as a polynomial in $a$ and $b.$ Prove the result. Given that $b$ is prime, prove that $b$ divides $a(u_b -1).$
Show that there are infinitely many positive integer numbers $n$ such that $n^2+1$ has two positive divisors whose difference is $n$.
Let $({{x}_{n}}),({{y}_{n}})$ be two positive sequences defined by ${{x}_{1}}=1,{{y}_{1}}=\sqrt{3}$ and
\[ \begin{cases} {{x}_{n+1}}{{y}_{n+1}}-{{x}_{n}}=0 \\ x_{n+1}^{2}+{{y}_{n}}=2 \end{cases} \] for all $n=1,2,3,\ldots$.
Prove that they are converges and find their limits.
Let $S_n$ denote the set of all permutations of the numbers $1,2,\dots,n.$ For $\pi\in S_n,$ let $\sigma(\pi)=1$ if $\pi$ is an even permutation and $\sigma(\pi)=-1$ if $\pi$ is an odd permutation. Also, let $v(\pi)$ denote the number of fixed points of $\pi.$ Show that
\[ \sum_{\pi\in S_n}\frac{\sigma(\pi)}{v(\pi)+1}=(-1)^{n+1}\frac{n}{n+1}. \]
Let $(a_n)_{n\ge 0}$ be the sequence of rational numbers with $a_0 = 2016$ and $a_{n+1} = a_n + \frac{2}{a_n}$ for all $n \ge 0$.
Show that the sequence does not contain a square of a rational number.
Proposed by Theresia Eisenkölbl
Let $S_n = \{1, 2,\cdots, n\}$ and $f_n : S_n \to S_n$ be defined inductively as follows: $f_1(1) = 1, f_n(2j) = j \ (j = 1, 2, \cdots , [n/2])$ and
[list]
[*][b][i](i)[/i][/b] if $n = 2k \ (k \geq 1)$, then $f_n(2j - 1) = f_k(j) + k \ (j = 1, 2, \cdots, k);$
[*][b][i](ii)[/i][/b] if $n = 2k + 1 \ (k \geq 1)$, then $f_n(2k + 1) = k + f_{k+1}(1), f_n(2j - 1) = k + f_{k+1}(j + 1) \ (j = 1, 2,\cdots , k).$[/list]
Prove that $f_n(x) = x$ if and only if $x$ is an integer of the form
\[\frac{(2n + 1)(2^d - 1)}{2^{d+1} - 1}\]
for some positive integer $d.$
Let $ a$, $ b$, $ c$ be three real numbers. For each positive integer number $ n$, $ a^n \plus{} b^n \plus{} c^n$ is an integer number. Prove that there exist three integers $ p$, $ q$, $ r$ such that $ a$, $ b$, $ c$ are the roots of the equation $ x^3 \plus{} px^2 \plus{} qx \plus{} r \equal{} 0$.
Find all polynomials $P$ such that
$P(x) + \binom{2018}{2}P(x+2)+...+\binom{2018}{2106}P(x+2016)+P(x+2018)=$
$=\binom{2018}{1}P(x+1)+\binom{2018}{3}P(x+3)+...+\binom{2018}{2105}P(x+2015)+\binom{2018}{2107}P(x+2017)$
for all real numbers $x$.
A [i]self-avoiding rook walk[/i] on a chessboard (a rectangular grid of unit squares) is a path traced by a sequence of moves parallel to an edge of the board from one unit square to another, such that each begins where the previous move ended and such that no move ever crosses a square that has previously been crossed, i.e., the rook's path is non-self-intersecting.
Let $ R(m, n)$ be the number of self-avoiding rook walks on an $ m \times n$ ($ m$ rows, $ n$ columns) chessboard which begin at the lower-left corner and end at the upper-left corner. For example, $ R(m, 1) \equal{} 1$ for all natural numbers $ m$; $ R(2, 2) \equal{} 2$; $ R(3, 2) \equal{} 4$; $ R(3, 3) \equal{} 11$. Find a formula for $ R(3, n)$ for each natural number $ n$.
The sequence $(a_n)$ is defined by $a_1 =\sqrt2$ and $a_{n+1} =\sqrt{2-\sqrt{4-a_n^2}}$.
Let $b_n =2^{n+1}a_n$. Prove that $b_n \le 7$ and $b_n < b_{n+1}$ for all $n$.
Let $S$ be the set of all positive integers $n$ such that $n^4$ has a divisor in the range $n^2 +1, n^2 + 2,...,n^2 + 2n$. Prove that there are infinitely many elements of $S$ of each of the forms $7m, 7m+1, 7m+2, 7m+5, 7m+6$ and no elements of $S$ of the form $7m+3$ and $7m+4$, where $m$ is an integer.
Let $ \mathcal{A}_n$ denote the set of all mappings $ f: \{1,2,\ldots ,n \} \rightarrow \{1,2,\ldots, n \}$ such that $ f^{-1}(i) :=\{ k \colon f(k)=i\ \} \neq \varnothing$ implies $ f^{-1}(j) \neq \varnothing, j \in \{1,2,\ldots, i \} .$ Prove \[ |\mathcal{A}_n| =
\sum_{k=0}^{\infty} \frac{k^n}{2^{k+1}}.\]
[i]L. Lovasz[/i]
Find all triples $(x, y, z)$ of positive integers such that
\[x^2 + 4^y = 5^z. \]
[i]Proposed by Li4 and ltf0501[/i]