Discrete Structures

Lecture Notes, 12 Nov 2010

Last Update: 12 November 2010

Note: NEW or UPDATED material is highlighted

Note: A username and password may be required to access certain documents. Please contact Bill Rapaport.

Index to all lecture notes
…Previous lecture

§4.1: Mathematical Induction (cont'd)

  1. Mathematical Induction as a Proof Strategy (reminder):

    To show:(∀nN)P(n):
    "base case"
    & show:(∀kN)[P(k) → P(k+1)]
    "inductive case"

  2. Another example of a proof by mathematical induction:

    Thm (General Distributive Law)

  3. Another Example (which we did not have time for in class, so I'll record the entire proof here):

    Thm (the cardinality of the power set of S = 2 raised to the cardinality of S)


Next lecture…

Text copyright © 2010 by William J. Rapaport (rapaport@buffalo.edu)
Cartoon links and screen-captures appear here for your enjoyment. They are not meant to infringe on any copyrights held by the creators. For more information on any cartoon, click on it, or contact me.