CISC 102 Lecture Notes - Lecture 11: Natural Number, Complex Instruction Set Computing, Modular Arithmetic

73 views4 pages
Verified Note

Document Summary

The sum of the first n odd numbers is n2. Testing some small values of n: n = 1 (1=12), n = 2 (1 + 3 = 4 = 22), n = 3 (1 + 3 + 5 = 9 = 32) Not a proof, just shows that propositions p(1), p(2), and p(3) are true. The kth odd number can be written as 2k-1. e. g. 1 = 2 x 1-1, 3 = 2x2-1, 5 = 2x3-1 etc. This fact will be useful for proving the sum of the first n odd numbers is n2. Now we"ll look at what is meant by an odd number so we can more precisely define it. If 2 divides n, that is n/2 is a natural number, then we say that n is even. 2/2 = 1 (so 2 is even), 4/2 = 2 (so 4 is even). So, every even natural num can be expressed as a multiple of 2.

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