Two proof variants

Two proofs of the fact that 1+2+ … + n = n(n+1)/2. One proof uses induction; the other organizes the terms of twice the sum so each of n pairs sums to n+1. These proofs are used to start a class discussion about elegance.

Files in this media folder:

Twoproofs-rev1

PDF

Twoproofs-rev1.tex

TEX

Download all files in this media folder as a single zip file.

Please Click "Preview" to view individual files.

License: CC BY Page content licensed by M.I.T. Department of Mathematics under the license:
CC BY (Attribution)

Accessibility