Prove that the sequence $(a_n)$, where $$a_n=\sum_{k=1}^n\left\{\frac{\left\lfloor2^{k-\frac12}\right\rfloor}2\right\}2^{1-k},$$converges, and determine its limit as $n\to\infty$.

The $16$ squares on a piece of paper are numbered as shown in the diagram. While lying on a table, the paper is folded in half four times in the following sequence: [list=1] [*]fold the top half over the bottom half [*]fold the bottom half over the top half [*]fold the right half over the left half [*]fold the left half over the right half.[/list] Which numbered square is on top after step $4$? [asy] unitsize(18); for(int a=0; a<5; ++a) { draw((a,0)--(a,4)); } for(int b=0; b<5; ++b) { draw((0,b)--(4,b)); } label("$1$",(0.5,3.1),N); label("$2$",(1.5,3.1),N); label("$3$",(2.5,3.1),N); label("$4$",(3.5,3.1),N); label("$5$",(0.5,2.1),N); label("$6$",(1.5,2.1),N); label("$7$",(2.5,2.1),N); label("$8$",(3.5,2.1),N); label("$9$",(0.5,1.1),N); label("$10$",(1.5,1.1),N); label("$11$",(2.5,1.1),N); label("$12$",(3.5,1.1),N); label("$13$",(0.5,0.1),N); label("$14$",(1.5,0.1),N); label("$15$",(2.5,0.1),N); label("$16$",(3.5,0.1),N); [/asy] $\text{(A)}\ 1 \qquad \text{(B)}\ 9 \qquad \text{(C)}\ 10 \qquad \text{(D)}\ 14 \qquad \text{(E)}\ 16$

Let $S = \{1, 2, \ldots, n\}$ for some positive integer $n$, and let $A$ be an $n$-by-$n$ matrix having as entries only ones and zeroes. Define an infinite sequence $\{x_i\}_{i \ge 0}$ to be [i]strange[/i] if: [list] [*] $x_i \in S$ for all $i$, [*] $a_{x_kx_{k+1}} = 1$ for all $k$, where $a_{ij}$ denotes the element in the $i^{\text{th}}$ row and $j^{\text{th}}$ column of $A$. [/list] Prove that the set of strange sequences is empty if and only if $A$ is nilpotent, i.e. $A^m = 0$ for some integer $m$.

Prove that for each natural number $d$, There is a monic and unique polynomial of degree $d$ like $P$ such that $P(1)$≠$0$ and for each sequence like $a_{1}$,$a_{2}$, $...$ of real numbers that the recurrence relation below is true for them, there is a natural number $k$ such that $0=a_{k}=a_{k+1}= ...$ : $P(n)a_{1} + P(n-1)a_{2} + ... + P(1)a_{n}=0$ $n>1$

Suppose that $P(x)$ is a polynomial with degree $10$ and integer coefficients. Prove that, there is an infinite arithmetic progression (open to bothside) not contain value of $P(k)$ with $k\in\mathbb{Z}$

Let $a_1,a_2,a_3,\cdots$ be the sequence of positive integers such that $$a_1=1 , a_{k+1}=a^3_k+1, $$ for all positive integers $k.$ Prove that for every prime number $p$ of the form $3l +2,$ where $l$ is a non-negative integer ,there exists a positive integer $n$ such that $a_n$ is divisible by $p.$

Let $\{x_n\}$ be a sequence of natural numbers such that \[(a) 1 = x_1 < x_2 < x_3 < \ldots; \quad (b) x_{2n+1} \leq 2n \quad \forall n.\] Prove that, for every natural number $k$, there exist terms $x_r$ and $x_s$ such that $x_r - x_s = k.$

The number $2021$ can be written as the sum of $2021$ consecutive integers. What is the largest term in the sequence of $2021$ consecutive integers? [i]Proposed by Taiki Aiba[/i]

Let be a bounded sequence of positive real numbers $ \left( x_n \right)_{n\ge 1} $ satisfying the recurrence: $$ x_{n+3} =\sqrt[3]{3x_n-2} . $$ Prove that $ \left( x_n \right)_{n\ge 1} $ is convergent. [i]Cristinel Mortici[/i]

Let $\{x_{n}\}_{n\ge0}$ and $\{y_{n}\}_{n\ge0}$ be two sequences defined recursively as follows \[x_{0}=1, \; x_{1}=4, \; x_{n+2}=3 x_{n+1}-x_{n},\] \[y_{0}=1, \; y_{1}=2, \; y_{n+2}=3 y_{n+1}-y_{n}.\] [list=a][*] Prove that ${x_{n}}^{2}-5{y_{n}}^{2}+4=0$ for all non-negative integers. [*] Suppose that $a$, $b$ are two positive integers such that $a^{2}-5b^{2}+4=0$. Prove that there exists a non-negative integer $k$ such that $a=x_{k}$ and $b=y_{k}$.[/list]

The Fibonacci sequence $F_n$ is defined by $F_1=F_2=1$ and the recurrence relation $F_n=F_{n-1}+F_{n-2}$ for all integers $n\geq3$. Let $m,n\geq1$ be integers. Find the minimal degree $d$ for which there exists a polynomial $f(x)=a_dx^d+a_{d-1}x^{d-1}+\dots+a_1x+a_0$, which satisfies $f(k)=F_{m+k}$ for all $k=0,1,...,n$.

$F_n$ is the Fibonacci sequence $F_0 = F_1 = 1$, $F_{n+2} = F_{n+1} + F_n$. Find all pairs $m > k \geq 0$ such that the sequence $x_0, x_1, x_2, ...$ defined by $x_0 = \frac{F_k}{F_m}$ and $x_{n+1} = \frac{2x_n - 1}{1 - x_n}$ for $x_n \not = 1$, or $1$ if $x_n = 1$, contains the number $1$

For a fixed natural number $m \geq 2$, prove that [b]a.)[/b] There exists integers $x_1, x_2, \ldots, x_{2m}$ such that \[x_i x_{m + i} = x_{i + 1} x_{m + i - 1} + 1, i = 1, 2, \ldots, m \hspace{2cm}(*)\] [b]b.)[/b] For any set of integers $\lbrace x_1, x_2, \ldots, x_{2m}$ which fulfils (*), an integral sequence $\ldots, y_{-k}, \ldots, y_{-1}, y_0, y_1, \ldots, y_k, \ldots$ can be constructed such that $y_k y_{m + k} = y_{k + 1} y_{m + k - 1} + 1, k = 0, \pm 1, \pm 2, \ldots$ such that $y_i = x_i, i = 1, 2, \ldots, 2m$.

Let $n,d$ be natural numbers. Prove that there is an arithmetic sequence of positive integers. $$a_1,a_2,...,a_n$$ with common difference of $d$ and $a_i$ with prime factor greater than or equal to $i$ for all values $i=1,2,...,n$. [i](nooonuii)[/i]

Let $N$ be a normed linear space with a dense linear subspace $M$. Prove that if $L_1,\ldots,L_m$ are continuous linear functionals on $N$, then for all $x\in N$ there exists a sequence $(y_n)$ in $M$ converging to $x$ satisfying $L_j(y_n)=L_j(x)$ for all $j=1,\ldots,m$ and $n\in \mathbb{N}$.