this is for holding javascript data
Dat Do edited beginproblem_a_You_a.tex
about 10 years ago
Commit id: c2c831dd7ed7c77dfd35f23f4c4158ff1a8efa67
deletions | additions
diff --git a/beginproblem_a_You_a.tex b/beginproblem_a_You_a.tex
index d16ae3d..b47e6a2 100644
--- a/beginproblem_a_You_a.tex
+++ b/beginproblem_a_You_a.tex
...
We see that each term $W(k+1) = 2W(k) + (k+1)$ so,
\\$W(k+1) = 2(2^{k+1}-k-2) + (k+1)$
\\$W(k+1) = 2^{k+2}-2k-4+k+1$
\\$W(k+1) =
2^{k+2}-k-3$\textit{ 2^{k+2}-k-3$
\\Therefore, $W(n) = 2^{n+1}-n-2$
\textit{ Q.E.D.}
\end{proof}