Non-Recursive Formula of a Triangular Sum of an Arithmetic Sequence.

Abstract

Calculating the TRIANGULAR SUM of a set is defined as recursively creating a new set made of up the sums of each pair of consecutive numbers until a single number remains (the triangular sum). This proof attempts to find the TRIANGULAR SUM of an arithmetic sequence.

Read whole proof