Pairing proof for an arithmetic series

ID: pairing-proof-for-an-arithmetic-series

Reverse the finite list of sequence terms and add it to the original list. At position ,
Every position therefore contributes the same value. Reversal preserves the sum, giving and the stated formula. The symmetry explains why the endpoint average represents the whole list; one does not need to add each entry separately.
Figure 1.
An arithmetic progression and its reverse make eight equal pairs, each of value thirty-five
. Original positive-value example . Blue bars show the original entries; yellow bars show the reversed entries. The combined sum is , twice the original sum . The algebraic argument also applies when some entries are negative. Details.
The reversal argument works for both even and odd lengths. For , the two outer pairs each total sixteen and the middle entry is eight. Adding the list to its reverse counts that middle entry twice too, giving and . No half-entry is required for an odd number of entries.

New to topics? Read the docs here!