this is for holding javascript data
Dat Do edited beginproblem_a_You_a.tex
about 10 years ago
Commit id: 41199e65f0a1409393549ace5992dea6eefe99c8
deletions | additions
diff --git a/beginproblem_a_You_a.tex b/beginproblem_a_You_a.tex
index 308903b..e2c67cd 100644
--- a/beginproblem_a_You_a.tex
+++ b/beginproblem_a_You_a.tex
...
Assume $W(k) = 2^{k+1}-k-2$, we must show that $W(k+1) = 2^{k+2}-k-3$
\\*
\begin{problem}
\textbf{Problem 2: }Prove that there is an integer $c>0$ such that
the following inequality holds for all $n\ge c$: