Principles of proof writing

Principle 2.1 (First Principle of Mathematical Induction). Let S(n) be a statement about
integers for n  \in N  and suppose S(n0) is true for some integer n0. If for all integers k with
k n0, S(k) implies that S(k + 1) is true, then S(n) is true for all integers n greater than
or equal to n0.

 

Equivalence relation:

  1. Reflexive.
  2. Symmetric.
  3. Transitive.
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s