this is for holding javascript data
Dat Do edited beginproblem_a_You_a.tex
about 10 years ago
Commit id: a7154bf49b0a0b07513c712376788e0ad5a85584
deletions | additions
diff --git a/beginproblem_a_You_a.tex b/beginproblem_a_You_a.tex
index 292de2f..4355050 100644
--- a/beginproblem_a_You_a.tex
+++ b/beginproblem_a_You_a.tex
...
(d) First, we will find the lower bound for $W(n) = 2^{n+1}-n-2$
\\
$2^{n+1}-n \geq 2^n - \frac{2^n}{2}$ which is true for $n > 2$
\\Since $\frac{2^n}{2}$ belongs to
$\BigO(2^n), W(n) $\Omega(2^n)$, $W(n)$ must as well since it is
less greater than
\frac{2^n}{2}$ or equal to $\frac{2^n}{2}$
\\*