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:
Please Click "Preview" to view individual files.
