Transcription of Discrete Structures Lecture Notes - Stanford University
{{id}} {{{paragraph}}}
Discrete StructuresLecture NotesVladlen Koltun1 Winter 20081 Computer Science Department, 353 Serra Mall, Gates 374, Stanford University , Stanford , CA94305, Sets and Defining sets .. Set operations .. More sets ..42 Introducing induction .. Strong induction .. Why is the induction principle true? ..83 More Proof Proofs by contradiction .. Direct proofs ..124 The division algorithm .. Remainders .. Greatest common divisors .. Greatest common divisors and linear combinations ..185 Prime The fundamental theorem of arithmetic .. The infinity of primes ..226 Modular Congruences .. Modular division ..277 Relations and Ordered pairs .. Relations .. Kinds of relations .. Creating relations .. Functions ..358 Mathematical Propositions and predicates.
Discrete Structures Lecture Notes Vladlen Koltun1 Winter 2008 1Computer Science Department, 353 Serra Mall, Gates 374, Stanford University, Stanford, CA 94305, USA; vladlen@stanford.edu.
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}