Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I need to prove that $\lim_{n \to \infty} \sup \{2^k : 2^k \leq n\} = \infty$.

I know that the supreme exists, the set is non-empty ($\forall n \geq 1$ : $2^{-1} \in \{2^k : 2^k \leq n\}$). I also know that the set is bounded by aboven (by $n$). But how can I correctly say that this limit goes to infinity?

share|cite|improve this question
If you call the sets $E_n$ then $\sup E_{2^n} = 2^n$ which gets very big. – Epsilon Mar 31 '14 at 13:36
Not every question involving sets is about set theory. – Asaf Karagila Mar 31 '14 at 13:54
@user54297 : Don't write \mbox{ sup }. I changed it to \sup. That not only prevents italicization but also results in proper spacing in things like $a\sup b$ but also affects format when things like $\displaystyle\left(\sup_{a\in S} \cdots\right)$ appear in a displayed, as opposed to inline, setting. It is standard usage. ${}\qquad{}$ – Michael Hardy Mar 31 '14 at 14:18

Let $M_n := \{2^k : 2^k \le n\}$. For $n_1 \le n_2$ you get $\sup M_{n_1} \le \sup M_{n_2}$. Therefore you only need to look at a subsequence: Let‘s take $\sup M_{2^l}$ which is equal to $l$. So for $l \rightarrow \infty$ you get $\sup M_{2^l} \rightarrow \infty$.

share|cite|improve this answer

Let $M_n = \{2^k\mid 2^k\le n\}$.

We then have $\frac12n < \sup M_n$, because there is a number of the form $2^k$ in $(\frac 12 n, n]$.

Therefore, from the definition of limit, if you have $K$ and want to find $N$ such that $\sup M_n\ge K$ for all $n\ge N$, you can just take $N=2K$.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.