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