Question: Find a closed-form expression for the nth triangular number, Tn .

Way #1: This way will be geometric, yet NOT recursive. We demonstrate below with the cases T3 and T4 before generalizing. Case T3 : Arrange 1 + 2 + 3 as dots forming a lattice right triangle:

Double that triangle again, ipping it to make a rectangle:

Now, how many dots are in this rectangle? Well, additively, we know that the number of dots is 2T3 . On the other hand, we see that there are 3 rows and 4 columns, making a grand total of 3 4 = 12 dots. So, putting everything together, we get: 34 T3 = =6 2 45 Below are the corresponding pictures for T4 = = 10: 2

Now, how is this going to generalize? Well, we see that were going to have a rectangle that has n rows of dots andthanks to ipping n + 1 columns of dots. That means that the rectangle will a total of (n)(n + 1) dots. BUT, since that rectangle also contains 2Tn dots, we see that the number of dots in Tn is in fact: Tn = n(n + 1) 2

Way #2: This will also be geometric, yet it will be recursive. We lead with an example of T3 . If we start by arranging T4 (note: NOT a typo) dots into a right triangle, we have:

If we then try to make a SQUAREnot just a rectanglewe need T3 dots to complete the square:

Now this square has a total of (3 + 1)2 = 42 = 16 dots. So, namely we see T4 + T3 = 42 But waittheres more! We know, almost trivially, that T4 = T3 + 4. Substituting, we get: (T3 + 4) + T3 = 42 T3 = 42 4 2

So, now we generalize. If we want to know what Tn is, we really need to start by using both Tn+1 and Tn to make a square of (n + 1)2 dots. Then, having Tn + Tn+1 = (n + 1)2 we note that Tn+1 = Tn + (n + 1). Substituting, we get: Tn = (n + 1)2 (n + 1) (n + 1)(n + 1 1) n(n + 1) = = 2 2 2