Induction The first exercise was to proof $$ \sum_{k=1}^{n}{k} = \frac{n(n+1)}{2} $$ with induction. The first step is to proof it for any number, here we pick the minimum $ n=1 $. This results in $ 1 = 1 $. The next step is to change the n to n+1; $ n \to {n+1} $ $$ \sum_{k=1}^{n+1}{k} = \frac{(n+1)(n+2)}{2} $$ Is the result we need. We can generate the right side, starting from the left side.

While it is possible to keep all the static data in the hugo static directory, it can quickly become messy. So if there are a lot of media heavy posts which would clutter the directory, it is better to use a resource folder instead. The folder structure changes to this: Index.md actually contains all this code. With the help of a slug: or url: in out header, we can even change the url this post is rendered at.