Discrete Mathematics with Applications 4th Edition

Published by Cengage Learning
ISBN 10: 0-49539-132-8
ISBN 13: 978-0-49539-132-6

Chapter 11 - Analysis of Algorithm Efficiency - Exercise Set 11.4 - Page 763: 33

Answer

Show $2^{n+1}$ is $\Theta(2^n)$. For all n, $0 \leq 2^n$ $2^n \leq 2^n + 2^n = 2(2^n) = 2^{n+1}$ (add $2^n$ to both sides) $|2^n| \leq |2^{n+1}|$ (because all terms are positive) $2^n \leq 2(2^n)$ $2(2^n) = 2^{n+1} \leq 4(2^n)$ (multiply both sides by 2) $| 2^{n+1}| \leq 4|(2^n)|$ (because all terms are positive) Hence for A=1, B=4, k=0, $A|2^n| \leq |2^{n+1}| \leq B|2^n|$ for all $x>k$. Thus $2^{n+1}$ is $\Theta(2^n)$.

Work Step by Step

Recall the definition of $\Theta$-notation: $f(x)$ is $\Theta(g(x))$ iff there exist positive real numbers A, B, k, such that $A|g(x)| \leq |f(x)| \leq B|g(x)| $ for all $x>k$.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.