{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# Logic1104 - Generalized induction n4 1 2 3 The least number...

This preview shows pages 1–5. Sign up to view the full content.

@ f 4° °°° °° Generalized induction 1. The least number principle 2. Generalized induction 3. Descending chain

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
HW #7 (due 11/11) 1. By using one of the induction prin- ciples, show that every natural number greater than 1 is a product of prime num- bers. 2. Show why Theorem 15.1 follows from Theorem 15.4 (this actually shows Theor- ems 15.1-4 are all equivalent to one an- other).
Never miss a class unless you missed it last time Q. If you follow the above instruction, do you have to attend the first class? G For every class, either you missed the class last time, or you don’t miss the cur- rent class. But there was no class before, and you cannot have missed it. Therefore, you must attend the first class, and every class thereafter.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
15.6 (theorem 15.4, finite descent) (1) For any n, if P fails for n, then P fails for some natural number less than n. Then P holds for all natural numbers. (Proof) (1) f For any n, if P holds for all numbers less than n, then P holds for n (complete induction).
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 13

Logic1104 - Generalized induction n4 1 2 3 The least number...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online