CISC 102 Lecture Notes - Lecture 9: Mathematical Induction, Complex Instruction Set Computing

65 views3 pages
Verified Note

Document Summary

Think of a sequence of dominoes going on forever. All fall, so long as: domino 1 falls (p(1)) If the kth domino falls, it knocks over the k+1st domino. Let p(n) be the proposition that the num of two-element subsets of a set of n elements is given by the formula n(n-1) P(n) true for all natural numbers n can be demonstrated by using mathematical induction. A set w 1 element has no 2 element subsets, satisfying eq"n 0 = 1(0) P(k) is true for an arbirtrary natural num k 1. Let s be a set w k+1 elements, and let s s. the set of two-element subsets of s can be partitioned into subsets including element s and those that don"t. (s" contains all the elements in s except for s. ) The two-element subsets of s" are exactly the two-element subsets of s that don"t contain s.

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