Two proof variants

Posted on August 22, 2012 by abouzaid
Tags: , , , , ,
Media Folder Description:

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:
all files in this media folder as a single zip file.
Folder content licensed by M.I.T. Department of Mathematics under the license:
CC BY (Attribution)