0.9		Techniques of proof (including mathematical induction)

Good Induction versus Bad Induction, from Howard Eves, 1:2, 1970, 16, C
If...Some Suggestions on Presenting the Connector "if...then", Aaron Seligman, 1:2, 1970, 22-26, 9.1
Some Applications of the Law of the Contrapositive, Morton J. Hellman, 4:3, 1973, 86-88, C, 9.1
Mathematical Induction: If Student k Understands It, Will Student k + 1?, Judith L. Gersting, 6:2, 1975, 18-20, 0.2
The Well-Ordering Principle as an Alternative to Mathematical Induction in Our Lower Division Recursive Formula Proofs, Orrin G. Cocks, 7:1, 1976, 13-14
A Helpful Device: or One More Use for Pascal's Triangle, Robert Rosenfeld, 8:3, 1977, 188-191, C, 5.4.2
A Note on the Principle of Mathematical Induction, Charles M. Bundrick and David L. Sherry, 9:1, 1978, 17-18
Mathematical Induction, or "What Good is All This Stuff if We Are Going to Assume It's True Anyway?", Leonard G. Swanson and Rodney T. Hansen, 12:1, 1981, 8-12
A Discrete Look at 1 + 2 + ... + n, Loren C. Larson, 16:5, 1985, 369-382, 0.2, 3.1, 3.2, 5.4.2, 6.3
A Division Game: How Far Can You Stretch Mathematical Induction?, William H. Ruckle, 18:3, 1987, 212-218, 3.2, 9.9
Behold! (1x2)+(2x3)+ . . . +nx(n+1) = (1/3)([(n+1)^3 - (n+1)], Ali R. Amir-Moez, 18:4, 1987, 318, C
Sum of Squares (Proof by Picture), Pi-Chun Chuang, 20:2, 1989, 123, C
Product of k^k times k! (Proof by Picture), Edward T. A. Wang, 20:2, 1989, 152, C
Sum of Squares (Proof by Picture), Sidney H. Kung, 20:3, 1989, 205, C
FFF. Equal Integers, Ed Barbeau, 22:2, 1991, 133, F (also 23:1, 1992, 38)
FFF. Four Weighings, Ed Barbeau, 22:2, 1991, 133, F
FFF #45. All Powers of x are Constant, Ed Barbeau, 22:5, 1991, 403, F, 5.1.2
FFF #59. A Formula that Works Only for n=1, Ed Barbeau, 24:3, 1993, 229-230, F, 0.2
FFF. Which Balls are Actually There?, Ruma Falk, 26:1, 1995, 37, F
Count the Dots: 1+2+...+n = [n(n+1)]/2 (proof by picture), S. J. Farlow, 26:3, 1995, 190, C
Sum of Alternating Series (proof by picture), Guanshen Ren, 26:3, 1995, 213, 5.4.2
FFF #92. An Inductive Fallacy, Adrian Riskin and William Stein, 26:5, 1995, 382, F
MAD Property of Medians: An Induction Proof, Eugene F. Schuster, 26:5, 1995, 387-389, C, 7.3
FFF #94. Every Second Square is the Same, Allen J. Schwenk, 27:1, 1996, 44, F
FFF #103. Polynomial Detection, Ed Barbeau, 27:2, 1996, 118, F
FFF #118. Rabbits Reproduce; Integers Don't, Annie and John Selden, 28:4, 1997, 285, F
FFF #119. Yet Another Perplexing Proof by Induction, P. D. Johnson and Martin Schlam, 28:4, 1997, 285-286, F
Weighing Coins: Divide and Conquer to Detect a Counterfeit, Mario Martelli and Gerald Gannon, 28:5, 1997, 365-367, 3.3
A Discrete Intermediate Value Theorem, Richard Johnsonbaugh, 29:1, 1998, 42, C, 3.3
The End of Aviation, Peter Ross, 30:5, 1999, C
Yet Another Refreshing Induction Fallacy, Shay Gueron, 31:3, 2000, 205-207, F, 3.1
A Proof That Proves, A Proof That Explains, and A Proof That Works, Seannie Dar, Shay Gueron, and Oran Lang, 32:2, 2001, 115-117, F, 9.5
Leapfrogs: The Mathematical Details, Matt Wyneken, Steve Althoen, and John Berry, 36:2, 2005, 144-146, C