A guess about sequences Let $a_n \le b_n$ for all $n \in \mathbb{N}$ and $\lim_{n \to \infty} a_n = \infty$ . Can we conclude $\lim_{n \to \infty} b_n = \infty$ ? Intuitively , it seems right but I can't prove it or find a counterexample . 
 A: Given $M>0$, there exists $N$ such that $n\ge N$ implies that 
$$
M\leq a_n\leq b_n
$$
as desired.
A: Yes, you can.
To see how, start with the definition: we say that $a_n\to\infty$ as $n\to\infty$ if given any $M\in\mathbb{R}$, we have $a_n\geq M$ for $n$ sufficiently large.  (That is: for any $M$, there exists $N\in\mathbb{N}$ such that $n\geq N$ implies $a_n\geq M$.)
Clearly, though, this implies that for $n\geq N$, $b_n\geq a_n\geq M$; therefore $b_n\to\infty$ as $n\to\infty$ as well.
A: (If I didn't read the question wrong...) the proof should be a simple application of the definition of limits. 
$$\lim_{n \rightarrow \infty} a_n = \infty$$
means that for each $N \in \mathbb{N}$ there exists some $n_{a} \in \mathbb{N}$ such that $\forall k \geq n_{a}$, $a_{k} \geq N$. 
To show that the sequence $B = \{b_1, b_2, ...\}$ tends to infinity, given an $N$, we need to find a $n_{b}$ such that $\forall k \geq n_b$, $b_{k} \geq N$. Since $a_i \leq b_i$, our choice of $n_b$ is simply $n_a$. Then $\forall k \geq n_{a}$, $b_k \geq a_k \geq N$ as required. 
