this is for holding javascript data
Rachael Sharp edited i__1.tex
about 8 years ago
Commit id: 6d7e9bea3fe0073a252b3cb62523b75141e48140
deletions | additions
diff --git a/i__1.tex b/i__1.tex
index 597a6db..ec480c4 100644
--- a/i__1.tex
+++ b/i__1.tex
...
i If you were to try to solve the puzzle with a small number of disks, say $1$ disk, $2$ disks, or $3$ disks, you would find that $T_1=1, T_2=3$, and $T_3=7$ where $T_n$ is the minimum number of moves required to solve the problem with $n$ disks. It may also be helpful to note that $T_0=0$. With this information, one can find that the recurrence relation that is followed is $T_n=2T_{n-1}+1$, where the next term in the sequence depends on the one before it.
