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

Is $2^{2n} = O(2^n)$?

My solution is:

$2^n 2^n \leq C_{1}2^n$

$2^n \leq C_{1}$,


Is this correct?

share|cite|improve this question
You're saying all powers of two are bounded by a constant? – anon Apr 13 '12 at 19:04
Please, explain me, I don't understand what is what I must to prove, Thanks. – Albert Apr 13 '12 at 19:06
Is there really a constant $C_1$ such that $2^n \le C_1$ for all $n$? – André Nicolas Apr 13 '12 at 19:08
You have to figure out whether or not there exists a constant $C$ such that $2^{2n}\le C2^n$ (or equivalently as you note, $2^n\le C$) for all $n$ beyond a certain, say, $n_0$. In other words, here you have to decide whether or not the integer powers of two have an upper bound. – anon Apr 13 '12 at 19:08
@Albert: En inglés, no existe el signo de interrogación izquierdo. – Arturo Magidin Apr 13 '12 at 19:14
up vote 8 down vote accepted

If $2^{2n}=O(2^n)$, then there is a constant $C$ and an integer $M$ such that for all $n\ge M$, the inequality $2^{2n}\le C 2^n$ holds.

This would imply that $2^n\cdot 2^n\le C 2^n$ for all $n\ge M$, which in turn implies $$\tag{1} 2^n\le C \quad {\bf for\ all } \quad n\ge M. $$ Can such $C$ and $M$ exist? Note the right hand side of $(1)$ is fixed, and the left hand side...

share|cite|improve this answer
Ok, now I understand, thanks a lot. – Albert Apr 13 '12 at 19:42

$x^n=o(y^n)$ iff $x<y$, as $(\frac{x}{y})^n\rightarrow 0$. Here 4 and 2, so no.

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.