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

91 views3 pages
Verified Note

Document Summary

A proposition is defined as a statement that is either true or false (e. g. sky is blue, earth is flat). In this course we"ll make declarative statements and then proceed to show that it is true/false (often easier to show that something is false). P is a proposition defined on the positive integers n. p(n) is either true or false for each n in the natural numbers. P(1) is true (easy to show - just test it) P(k+1) is true whenever p(k) is true (note that k can be anything; as big as you like) Mathematical induction is a very important concept, we will see it often. Note: we can start at anything, not just one, as long as it"s the smallest value (e. g. could be 4), and then go on for as long as you like. 1 + 2 + 22 + + 2n = 2n + 1 - 1 for all natural numbers n.

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