this is for holding javascript data
Dat Do edited beginproblem_a_You_a.tex
about 10 years ago
Commit id: db7722b3ca60333b786e43a02b38fb16d7671081
deletions | additions
diff --git a/beginproblem_a_You_a.tex b/beginproblem_a_You_a.tex
index ab293c4..8c9df26 100644
--- a/beginproblem_a_You_a.tex
+++ b/beginproblem_a_You_a.tex
...
The difference between $2^{n+1}$ and $W(n)$ appears to be $-n-2$ for each term, so the closed form expression for $W(n)$ must be $\sum\limits_{i=1}^n i*2^{n-i} = 2^{n+1}-n-2$
\\*
We can prove that this expression is correct using induction
\\*
\textit{Proof.}
\begin{problem}
\textbf{Problem 2: }Prove that there is an integer $c>0$ such that