I'm completely lost here.
Attempt
We know that $a_n$ converges to $L$. So by the definition convergence, $\forall \varepsilon \in R, \exists M \in N$ such that $|a_n - L| < \varepsilon, \forall n \ge M$.
We need to use this fact to show that $\forall \varepsilon \in R, \exists M' \in N$ such that $|2^{a_n} - 2^L| < \varepsilon, \forall n \ge M'$
I'm completely lost as to where to start. I can't think of any properties of exponents that I can exploit here. Would appreciate some hints.
Thank You
We want \begin{align} |2^{a_n}-2^L| &= 2^L |2^{a_n - L} - 1|< \epsilon \end{align}
$$|2^{a_n-L}-1| < \frac{\epsilon}{2^L}$$
$$1-\frac{\epsilon}{2^L}<2^{a_n -L}< 1+\frac{\epsilon}{2^L}$$
Focus on small $\epsilon$ to make sure the lower bound is positive
$$\log _2\left(1-\frac{\epsilon}{2^L}\right)<{a_n -L}< \log_2\left( 1+\frac{\epsilon}{2^L}\right)$$
Hence we want to choose $n$ large enough that
$$|a_n-L| < \min\left(-\log _2\left(1-\frac{\epsilon}{2^L}\right), \log_2\left( 1+\frac{\epsilon}{2^L} \right)\right) $$