CISC 203 Lecture Notes - Lecture 3: Maximal And Minimal Elements, Well-Order

42 views2 pages

Document Summary

Well ordering: well-ordered set: a set s and an ordering r every subset of s except has a minimum element, well-ordered principle: n (natural numbers) is well-ordered (cid:449)ith r = (cid:862)(cid:1095)(cid:863) A and b are not counter examples. A and b are either prime or product of primes. K - 2 is not a counter example because it is 2 less than the minimal counter example. K - 2 = 2x + 3y for some positive x and y. K is not a counter example . A set of counter examples is . The claim is true: claim: n (cid:1096) 4, 2n (cid:1096) n2, suppose this is false. = 2(m2 2m + 1: a minimum counter example, m. 2m < m2: observe that because 24 = 42, m (cid:1096) 5. M 1 (cid:1096) 4 (it is in the set) M 1 is not a counter example.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents

Related Questions