# <math-tex> demo

For n \in \mathbb N = 1, 2, 3, \ldots we have

\sum_{k=1}^n k = \frac{n(n+1)}{2}

The first two Fibonacci numbers are defined to be (click for more):

• F_0 = 0
• F_1 = 1