Discrete mathematics with applications:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Australia
Cengage Learning
2020
|
| Ausgabe: | Fifth edition, metric version |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Includes index Aus dem Vorwort: This metric version differs from the U.S. version of Discrete Mathematics with Applications, Fifth Edition as follows: The units of measurement used in the examples have been converted from the U.S. Customary System (USCS) of unites (also referred to as English of Imperial units) to Metric units. The appendix containing solutions to selected exercises and the instructor's solutions manual have been converted to metric where appropriate. |
| Beschreibung: | xxii, 871, A-141, I-22 Seiten Illustrationen, Diagramme 27 cm |
| ISBN: | 9780357114087 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV046916963 | ||
| 003 | DE-604 | ||
| 005 | 20220718 | ||
| 007 | t | ||
| 008 | 200929s2020 a||| |||| 00||| eng d | ||
| 020 | |a 9780357114087 |9 9780357114087 | ||
| 035 | |a (OCoLC)1199068393 | ||
| 035 | |a (DE-599)BVBBV046916963 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-573 |a DE-473 | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 100 | 1 | |a Epp, Susanna S. |d 1943- |e Verfasser |0 (DE-588)1136686010 |4 aut | |
| 245 | 1 | 0 | |a Discrete mathematics with applications |c Susanna S. Epp, DePaul University |
| 250 | |a Fifth edition, metric version | ||
| 264 | 1 | |a Australia |b Cengage Learning |c 2020 | |
| 300 | |a xxii, 871, A-141, I-22 Seiten |b Illustrationen, Diagramme |c 27 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Includes index | ||
| 500 | |a Aus dem Vorwort: This metric version differs from the U.S. version of Discrete Mathematics with Applications, Fifth Edition as follows: The units of measurement used in the examples have been converted from the U.S. Customary System (USCS) of unites (also referred to as English of Imperial units) to Metric units. The appendix containing solutions to selected exercises and the instructor's solutions manual have been converted to metric where appropriate. | ||
| 505 | 8 | |a Speaking mathematically --The logic of compound statements -- The logic of quantified statements -- Elementary number theory and methods of proof -- Sequences, mathematical induction, and recursion -- Set theory -- Properties of functions -- Properties of relations -- Counting and probability -- Theory of graphs and trees -- Analysis of algorithm efficiency -- Regular expressions and finite-state automata | |
| 650 | 0 | 7 | |a Diskrete Mathematik |0 (DE-588)4129143-8 |2 gnd |9 rswk-swf |
| 653 | 0 | |a Mathematics | |
| 653 | 0 | |a Mathematics | |
| 653 | 6 | |a Textbooks | |
| 653 | 6 | |a Textbooks | |
| 689 | 0 | 0 | |a Diskrete Mathematik |0 (DE-588)4129143-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m Digitalisierung UB Bamberg - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=032326272&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032326272 | ||
Datensatz im Suchindex
| _version_ | 1804181801558605824 |
|---|---|
| adam_text | CONTENTS CHAPTER 1 Speaking Mathematically 1.1 Variables 1 1 Using Variables in Mathematical Discourse; Introduction to Universal, Existential, and Conditional Statements 1.2 The Language of Sets 6 The Set-Roster and Set-Builder Notations; Subsets; Cartesian Products; Strings 1.3 The Language of Relations and Functions 15 Definition of a Relation from One Set to Another; Arrow Diagram of a Relation; Definition of Function; Function Machines; Equality of Functions 1.4 The Language of Graphs 24 Definition and Representation of Graphs and Directed Graphs; Degree of a Vertex; Examples of Graphs Including a Graph Coloring Application CHAPTER 2 2.1 The Logic of Compound Statements Logical Form and Logical Equivalence 37 37 Statements; Compound Statements; Truth Values; Evaluating the Truth of More General Compound Statements; Logical Equivalence; Tautologies and Contradictions; Summary of Logical Equivalences 2.2 Conditional Statements 53 Logical Equivalences Involving —»; Representation of If-Then As Or, The Negation of a Conditional Statement; The Contrapositive of a Conditional Statement; The Converse and Inverse of a Conditional Statement; Only If and the Biconditional; Necessary and Sufficient Conditions; Remarks 2.3 Valid and Invalid Arguments 66 Modus Ponens and Modus Tollens; Additional Valid Argument Forms: Rules of Inference; Fallacies; Contradictions and Valid Arguments; Summary of Rules of Inference 2.4 Application: Digital Logic Circuits 79 Black Boxes and Gates; The Input/Output Table for a Circuit; The Boolean Expression Corresponding to a Circuit; The Circuit
Corresponding to a Boolean Expression; Finding
vi CONTENTS a Circuit That Corresponds to a Given Input/Output Table; Simplifying Combinational Circuits; NAND and NOR Gates 2.5 Application: Number Systems and Circuits for Addition 93 Binary Representation of Numbers; Binary Addition and Subtraction, Circuits for Computer Addition; Two’s Complements and the Computer Representation of Negative Integers; 8-Bit Representation of a Number; Computer Addition with Negative Integers; Hexadecimal Notation CHAPTER 3 3.1 The Logic of Quantified Statements Predicates and Quantified Statements I 108 I08 The Universal Quantifier: V; The Existential Quantifier: 3; Formal versus Informal Language; Universal Conditional Statements; Equivalent Forms of Universal and Existential Statements; Bound Variables and Scope; Implicit Quantification; Tarski’s World 3.2 Predicates and Quantified Statements II 122 Negations of Quantified Statements; Negations of Universal Conditional Statements; The Relation among V, 3, л, and v; Vacuous Truth of Universal Statements; Variants of Universal Conditional Statements; Necessary and Sufficient Conditions, Only If 3.3 Statements with Multiple Quantifiers 131 Translating from Informal to Formal Language; Ambiguous Language; Negations of Multiply-Quantified Statements; Order of Quantifiers; Formal Logical Notation; Prolog 3.4 CHAPTER 4 Arguments with Quantified Statements 146 Universal Modus Ponens; Use of Universal Modus Ponens in a Proof; Universal Modus Tollens; Proving Validity of Arguments with Quantified Statements; Using Diagrams to Test for Validity; Creating Additional Forms of Argument; Remark on
the Converse and Inverse Errors Elementary Number Theory and Methods of Proof 160 4.1 Direct Proof and Counterexample I: Introduction 161 Definitions; Proving Existential Statements; Disproving Universal Statements by Counterexample; Proving Universal Statements; Generalizing from the Generic Particular; Method of Direct Proof; Existential Instantiation; Getting Proofs Started; Examples 4.2 Direct Proof and Counterexample II: Writing Advice 4.3 173 Writing Proofs of Universal Statements; Common Mistakes; Examples; Showing That an Existential Statement Is False; Conjecture, Proof, and Disproof Direct Proof and Counterexample III: Rational Numbers 183 More on Generalizing from the Generic Particular; Proving Properties of Rational Numbers; Deriving New Mathematics from Old
CONTENTS Vii 4.4 Direct Proof and Counterexample IV: Divisibility 190 Proving Properties of Divisibility; Counterexamples and Divisibility; The Unique Factorization of Integers Theorem 4.5 Direct Proof and Counterexample V: Division into Cases and the Quotient-Remainder Theorem 200 Discussion of the Quotient-Remainder Theorem and Examples; div and mod; Alternative Representations of Integers and Applications to Number Theory; Absolute Value and the Triangle Inequality 4.6 Direct Proof and Counterexample VI: Floor and Ceiling Definition and Basic Properties; The Floor of n/2 4.7 Indirect Argument: Contradiction and Contraposition 211 218 Proof by Contradiction; Argument by Contraposition; Relation between Proof by Contradiction and Proof by Contraposition; Proof as a Problem-Solving Tool 4.8 Indirect Argument: Two Famous Theorems 228 The Irrationality of V2; Are There Infinitely Many Prime Numbers?; When to Use Indirect Proof; Open Questions in Number Theory 4.9 Application: The Handshake Theorem 235 The Total Degree of a Graph; The Handshake Theorem and Consequences; Applications; Simple Graphs; Complete Graphs; Bipartite Graphs 4.10 CHAPTER 5 5.1 Application: Algorithms 244 An Algorithmic Language; A Notation for Algorithms; Trace Tables; The Division Algorithm; The Euclidean Algorithm Sequences, Mathematical Induction, and Recursion 258 Sequences 258 Explicit Formulas for Sequences; Summation Notation; Product Notation; Properties of Summations and Products; Change of Variable; Factorial and n Choose / Notation; Sequences in Computer Programming; Application: Algorithm to
Convert from Base 10 to Base 2 Using Repeated Division by 2 5.2 Mathematical Induction I: Proving Formulas 275 Principle of Mathematical Induction; Sum of the First n Integers; Proving an Equality; Deducing Additional Formulas; Sum of a Geometric Sequence 5.3 Mathematical Induction II: Applications 289 Comparison of Mathematical Induction and Inductive Reasoning; Proving Divisibility Properties; Proving Inequalities; Trominoes and Other Applications
viii CONTENTS 5.4 Strong Mathematical Induction and the Well-Ordering Principle for the Integers 301 Strong Mathematical Induction; The Well-Ordering Principle for the Integers; Binary Representation of Integers and Other Applications Application: Correctness of Algorithms 5.5 314 Assertions; Loop Invariants; Correctness of the Division Algorithm; Correctness of the Euclidean Theorem 5.6 Defining Sequences Recursively 325 Examples of Recursively Defined Sequences; Recursive Definitions of Sum and Product 5.7 Solving Recurrence Relations by Iteration 340 The Method of Iteration; Using Formulas to Simplify Solutions Obtained by Iteration; Checking the Correctness of a Formula by Mathematical Induction; Discovering That an Explicit Formula Is Incorrect 5.8 Second-Order Linear Homogeneous Recurrence Relations with Constant Coefficients 352 Derivation of a Technique for Solving These Relations; The Distinct-Roots Case; The Single-Root Case 5.9 General Recursive Definitions and Structural Induction 364 Recursively Defined Sets; Recursive Definitions for Boolean Expressions, Strings, and Parenthesis Structures; Using Structural Induction to Prove Properties about Recursively Defined Sets; Recursive Functions CHAPTER 6 6.1 Set Theory 377 Set Theory: Definitions and the Element Method of Proof 377 Subsets: Introduction to Proof and Disproof for Sets; Set Equality; Venn Diagrams; Operations on Sets; The Empty Set; Partitions of Sets; Power Sets; An Algorithm to Check Whether One Set Is a Subset of Another (Optional) 6.2 Properties of Sets 391 Set Identities; Proving Subset Relations
and Set Equality; Proving That a Set Is the Empty Set 6.3 Disproofs and Algebraic Proofs 407 Disproving an Alleged Set Property; Problem-Solving Strategy; The Number of Subsets of a Set; “Algebraic” Proofs of Set Identities 6.4 Boolean Algebras, Russell’s Paradox, and the Halting Problem 414 Boolean Algebras: Definition and Properties; Russell’s Paradox; The Halting Problem
CONTENTS CHAPTER 7 7.1 Properties of Functions ІХ 425 Functions Defined on General Sets 425 Dynamic Function Terminology; Equality of Functions; Additional Examples of Functions; Boolean Functions; Checking Whether a Function Is Well Defined; Functions Acting on Sets 7.2 One-to-One, Onto, and Inverse Functions 439 One-to-One Functions; One-to-One Functions on Infinite Sets; Application: Hash Functions and Cryptographic Hash Functions; Onto Functions; Onto Functions on Infinite Sets; Relations between Exponential and Logarithmic Functions; One-to-One Correspondences; Inverse Functions 7.3 Composition of Functions 461 Definition and Examples; Composition of One-to-One Functions; Composition of Onto Functions 7.4 Cardinality with Applications to Computability 473 Definition of Cardinal Equivalence; Countable Sets; The Search for Larger Infinities: The Cantor Diagonalization Process; Application: Cardinality and Computability CHAPTER 8 8.1 8.2 Properties of Relations 487 Relations on Sets 487 Additional Examples of Relations; The Inverse of a Relation; Directed Graph of a Relation; A-ary Relations and Relational Databases Reflexivity, Symmetry, and Transitivity 495 Reflexive, Symmetric, and Transitive Properties; Properties of Relations on Infinite Sets; The Transitive Closure of a Relation Equivalence Relations 8.3 505 The Relation Induced by a Partition; Definition of an Equivalence Relation; Equivalence Classes of an Equivalence Relation 8.4 Modular Arithmetic with Applications to Cryptography 8.5 524 Properties of Congruence Modulo zt; Modular Arithmetic; Extending the
Euclidean Algorithm; Finding an Inverse Modulo n; RSA Cryptography; Euclid’s Lemma; Fermat’s Little Theorem; Why Does the RSA Cipher Work?; Message Authentication; Additional Remarks on Number Theory and Cryptography Partial Order Relations 546 Antisymmetry; Partial Order Relations; Lexicographic Order; Hasse Diagrams; Partially and Totally Ordered Sets; Topological Sorting; An Application: PERT and CPM
X CONTENTS CHAPTER 9 Counting and Probability 564 9.1 Introduction to Probability 564 Definition of Sample Space and Event; Probability in the Equally Likely Case; Counting the Elements of Lists, Sublists, and One-Dimensional Arrays 9.2 Possibility Trees and the Multiplication Rule 573 Possibility Trees; The Multiplication Rule; When the Multiplication Rule Is Difficult or Impossible to Apply; Permutations; Permutations of Selected Elements 9.3 Counting Elements of Disjoint Sets: The Addition Rule 589 The Addition Rule; The Difference Rule; The Inclusion/Exclusion Rule 9.4 The Pigeonhole Principle 604 Statement and Discussion of the Principle; Applications; Decimal Expansions of Fractions; Generalized Pigeonhole Principle; Proof of the Pigeonhole Principle 9.5 Counting Subsets of a Set: Combinations 617 r-Combinations; Ordered and Unordered Selections; Relation between Permutations and Combinations; Permutation of a Set with Repeated Elements; Some Advice about Counting; The Number of Partitions of a Set into r Subsets 9.6 r-Combinations with Repetition Allowed 634 Multisets and How to Count Them; Which Formula to Use? 9.7 Pascal’s Formula and the Binomial Theorem 642 Combinatorial Formulas; Pascal’s Triangle; Algebraic and Combinatorial Proofs of Pascal’s Formula; The Binomial Theorem and Algebraic and Combinatorial Proofs for It; Applications 9.8 Probability Axioms and Expected Value 655 Probability Axioms; Deriving Additional Probability Formulas; Expected Value 9.9 Conditional Probability, Bayes’ Formula, and Independent Events Conditional Probability; Bayes’ Theorem;
Independent Events CHAPTER 10 10.1 Theory of Graphs and Trees Trails, Paths, and Circuits 662 677 677 Definitions; Connectedness; Euler Circuits; Hamiltonian Circuits 10.2 Matrix Representations of Graphs 698 Matrices; Matrices and Directed Graphs; Matrices and Undirected Graphs; Matrices and Connected Components; Matrix Multiplication; Counting Walks of Length N 10.3 Isomorphisms of Graphs 713 Definition of Graph Isomorphism and Examples; Isomorphic Invariants֊ Graph Isomorphism for Simple Graphs
ХІ CONTENTS 10.4 Trees: Examples and Basic Properties 720 Definition and Examples of Trees; Characterizing Trees 10.5 Rooted Trees 732 Definition and Examples of Rooted Trees; Binary Trees and Their Properties; Binary Search Trees 10.6 Spanning Trees and a Shortest Path Algorithm 742 Definition of a Spanning Tree; Minimum Spanning Trees; Kruskal’s Algorithm; Prim’s Algorithm; Dijkstra’s Shortest Path Algorithm CHAPTER 11 11.1 Analysis of Algorithm Efficiency 760 Real-Valued Functions of a Real Variable and Their Graphs 760 Graph of a Function; Power Functions; The Floor Function; Graphing Functions Defined on Sets of Integers; Graph of a Multiple of a Function; Increasing and Decreasing Functions 11.2 Big-О, Big-Omega, and Big-Theta Notations 769 Definition and General Properties of Ο-, Ω-, and ©-Notations; Orders of Power Functions; Orders of Polynomial Functions; A Caution about О-Notation; Theorems about Order Notation 11.3 Application: Analysis of Algorithm Efficiency I 787 Measuring the Efficiency of an Algorithm; Computing Orders of Simple Algorithms; The Sequential Search Algorithm; The Insertion Sort Algorithm; Time Efficiency of an Algorithm 11.4 Exponential and Logarithmic Functions: Graphs and Orders 800 Graphs of Exponential and Logarithmic Functions; Application: Number of Bits Needed to Represent an Integer in Binary Notation; Application: Using Logarithms to Solve Recurrence Relations; Exponential and Logarithmic Orders 11.5 CHAPTER 12 Application: Analysis of Algorithm Efficiency 11 813 Binary Search; Divide-and-Conquer Algorithms; The Efficiency of the
Binary Search Algorithm; Merge Sort; Tractable and Intractable Problems; A Final Remark on Algorithm Efficiency Regular Expressions and Finite-State Automata 828 12.1 Formal Languages and Regular Expressions 829 Definitions and Examples of Formal Languages and Regular Expressions; The Language Defined by a Regular Expression; Practical Uses of Regular Expressions 12.2 Finite-State Automata 841 Definition of a Finite-State Automaton; The Language Accepted by an Automaton; The Eventual-State Function; Designing a Finite-State Automaton; Simulating a Finite-State
xii CONTENTS Automaton Using Software; Finite-State Automata and Regular Expressions; Regular Languages 12.3 Simplifying Finite-State Automata 858 ♦-Equivalence of States; ^-Equivalence of States; Finding the «-Equivalence Classes; The Quotient Automaton; Constructing the Quotient Automaton; Equivalent Automata APPENDIX A Properties of the Real Numbers APPENDIX В Solutions and Hints to Selected Exercises Index 1-1 Α-Ί A-4
|
| adam_txt |
CONTENTS CHAPTER 1 Speaking Mathematically 1.1 Variables 1 1 Using Variables in Mathematical Discourse; Introduction to Universal, Existential, and Conditional Statements 1.2 The Language of Sets 6 The Set-Roster and Set-Builder Notations; Subsets; Cartesian Products; Strings 1.3 The Language of Relations and Functions 15 Definition of a Relation from One Set to Another; Arrow Diagram of a Relation; Definition of Function; Function Machines; Equality of Functions 1.4 The Language of Graphs 24 Definition and Representation of Graphs and Directed Graphs; Degree of a Vertex; Examples of Graphs Including a Graph Coloring Application CHAPTER 2 2.1 The Logic of Compound Statements Logical Form and Logical Equivalence 37 37 Statements; Compound Statements; Truth Values; Evaluating the Truth of More General Compound Statements; Logical Equivalence; Tautologies and Contradictions; Summary of Logical Equivalences 2.2 Conditional Statements 53 Logical Equivalences Involving —»; Representation of If-Then As Or, The Negation of a Conditional Statement; The Contrapositive of a Conditional Statement; The Converse and Inverse of a Conditional Statement; Only If and the Biconditional; Necessary and Sufficient Conditions; Remarks 2.3 Valid and Invalid Arguments 66 Modus Ponens and Modus Tollens; Additional Valid Argument Forms: Rules of Inference; Fallacies; Contradictions and Valid Arguments; Summary of Rules of Inference 2.4 Application: Digital Logic Circuits 79 Black Boxes and Gates; The Input/Output Table for a Circuit; The Boolean Expression Corresponding to a Circuit; The Circuit
Corresponding to a Boolean Expression; Finding
vi CONTENTS a Circuit That Corresponds to a Given Input/Output Table; Simplifying Combinational Circuits; NAND and NOR Gates 2.5 Application: Number Systems and Circuits for Addition 93 Binary Representation of Numbers; Binary Addition and Subtraction, Circuits for Computer Addition; Two’s Complements and the Computer Representation of Negative Integers; 8-Bit Representation of a Number; Computer Addition with Negative Integers; Hexadecimal Notation CHAPTER 3 3.1 The Logic of Quantified Statements Predicates and Quantified Statements I 108 I08 The Universal Quantifier: V; The Existential Quantifier: 3; Formal versus Informal Language; Universal Conditional Statements; Equivalent Forms of Universal and Existential Statements; Bound Variables and Scope; Implicit Quantification; Tarski’s World 3.2 Predicates and Quantified Statements II 122 Negations of Quantified Statements; Negations of Universal Conditional Statements; The Relation among V, 3, л, and v; Vacuous Truth of Universal Statements; Variants of Universal Conditional Statements; Necessary and Sufficient Conditions, Only If 3.3 Statements with Multiple Quantifiers 131 Translating from Informal to Formal Language; Ambiguous Language; Negations of Multiply-Quantified Statements; Order of Quantifiers; Formal Logical Notation; Prolog 3.4 CHAPTER 4 Arguments with Quantified Statements 146 Universal Modus Ponens; Use of Universal Modus Ponens in a Proof; Universal Modus Tollens; Proving Validity of Arguments with Quantified Statements; Using Diagrams to Test for Validity; Creating Additional Forms of Argument; Remark on
the Converse and Inverse Errors Elementary Number Theory and Methods of Proof 160 4.1 Direct Proof and Counterexample I: Introduction 161 Definitions; Proving Existential Statements; Disproving Universal Statements by Counterexample; Proving Universal Statements; Generalizing from the Generic Particular; Method of Direct Proof; Existential Instantiation; Getting Proofs Started; Examples 4.2 Direct Proof and Counterexample II: Writing Advice 4.3 173 Writing Proofs of Universal Statements; Common Mistakes; Examples; Showing That an Existential Statement Is False; Conjecture, Proof, and Disproof Direct Proof and Counterexample III: Rational Numbers 183 More on Generalizing from the Generic Particular; Proving Properties of Rational Numbers; Deriving New Mathematics from Old
CONTENTS Vii 4.4 Direct Proof and Counterexample IV: Divisibility 190 Proving Properties of Divisibility; Counterexamples and Divisibility; The Unique Factorization of Integers Theorem 4.5 Direct Proof and Counterexample V: Division into Cases and the Quotient-Remainder Theorem 200 Discussion of the Quotient-Remainder Theorem and Examples; div and mod; Alternative Representations of Integers and Applications to Number Theory; Absolute Value and the Triangle Inequality 4.6 Direct Proof and Counterexample VI: Floor and Ceiling Definition and Basic Properties; The Floor of n/2 4.7 Indirect Argument: Contradiction and Contraposition 211 218 Proof by Contradiction; Argument by Contraposition; Relation between Proof by Contradiction and Proof by Contraposition; Proof as a Problem-Solving Tool 4.8 Indirect Argument: Two Famous Theorems 228 The Irrationality of V2; Are There Infinitely Many Prime Numbers?; When to Use Indirect Proof; Open Questions in Number Theory 4.9 Application: The Handshake Theorem 235 The Total Degree of a Graph; The Handshake Theorem and Consequences; Applications; Simple Graphs; Complete Graphs; Bipartite Graphs 4.10 CHAPTER 5 5.1 Application: Algorithms 244 An Algorithmic Language; A Notation for Algorithms; Trace Tables; The Division Algorithm; The Euclidean Algorithm Sequences, Mathematical Induction, and Recursion 258 Sequences 258 Explicit Formulas for Sequences; Summation Notation; Product Notation; Properties of Summations and Products; Change of Variable; Factorial and n Choose / Notation; Sequences in Computer Programming; Application: Algorithm to
Convert from Base 10 to Base 2 Using Repeated Division by 2 5.2 Mathematical Induction I: Proving Formulas 275 Principle of Mathematical Induction; Sum of the First n Integers; Proving an Equality; Deducing Additional Formulas; Sum of a Geometric Sequence 5.3 Mathematical Induction II: Applications 289 Comparison of Mathematical Induction and Inductive Reasoning; Proving Divisibility Properties; Proving Inequalities; Trominoes and Other Applications
viii CONTENTS 5.4 Strong Mathematical Induction and the Well-Ordering Principle for the Integers 301 Strong Mathematical Induction; The Well-Ordering Principle for the Integers; Binary Representation of Integers and Other Applications Application: Correctness of Algorithms 5.5 314 Assertions; Loop Invariants; Correctness of the Division Algorithm; Correctness of the Euclidean Theorem 5.6 Defining Sequences Recursively 325 Examples of Recursively Defined Sequences; Recursive Definitions of Sum and Product 5.7 Solving Recurrence Relations by Iteration 340 The Method of Iteration; Using Formulas to Simplify Solutions Obtained by Iteration; Checking the Correctness of a Formula by Mathematical Induction; Discovering That an Explicit Formula Is Incorrect 5.8 Second-Order Linear Homogeneous Recurrence Relations with Constant Coefficients 352 Derivation of a Technique for Solving These Relations; The Distinct-Roots Case; The Single-Root Case 5.9 General Recursive Definitions and Structural Induction 364 Recursively Defined Sets; Recursive Definitions for Boolean Expressions, Strings, and Parenthesis Structures; Using Structural Induction to Prove Properties about Recursively Defined Sets; Recursive Functions CHAPTER 6 6.1 Set Theory 377 Set Theory: Definitions and the Element Method of Proof 377 Subsets: Introduction to Proof and Disproof for Sets; Set Equality; Venn Diagrams; Operations on Sets; The Empty Set; Partitions of Sets; Power Sets; An Algorithm to Check Whether One Set Is a Subset of Another (Optional) 6.2 Properties of Sets 391 Set Identities; Proving Subset Relations
and Set Equality; Proving That a Set Is the Empty Set 6.3 Disproofs and Algebraic Proofs 407 Disproving an Alleged Set Property; Problem-Solving Strategy; The Number of Subsets of a Set; “Algebraic” Proofs of Set Identities 6.4 Boolean Algebras, Russell’s Paradox, and the Halting Problem 414 Boolean Algebras: Definition and Properties; Russell’s Paradox; The Halting Problem
CONTENTS CHAPTER 7 7.1 Properties of Functions ІХ 425 Functions Defined on General Sets 425 Dynamic Function Terminology; Equality of Functions; Additional Examples of Functions; Boolean Functions; Checking Whether a Function Is Well Defined; Functions Acting on Sets 7.2 One-to-One, Onto, and Inverse Functions 439 One-to-One Functions; One-to-One Functions on Infinite Sets; Application: Hash Functions and Cryptographic Hash Functions; Onto Functions; Onto Functions on Infinite Sets; Relations between Exponential and Logarithmic Functions; One-to-One Correspondences; Inverse Functions 7.3 Composition of Functions 461 Definition and Examples; Composition of One-to-One Functions; Composition of Onto Functions 7.4 Cardinality with Applications to Computability 473 Definition of Cardinal Equivalence; Countable Sets; The Search for Larger Infinities: The Cantor Diagonalization Process; Application: Cardinality and Computability CHAPTER 8 8.1 8.2 Properties of Relations 487 Relations on Sets 487 Additional Examples of Relations; The Inverse of a Relation; Directed Graph of a Relation; A-ary Relations and Relational Databases Reflexivity, Symmetry, and Transitivity 495 Reflexive, Symmetric, and Transitive Properties; Properties of Relations on Infinite Sets; The Transitive Closure of a Relation Equivalence Relations 8.3 505 The Relation Induced by a Partition; Definition of an Equivalence Relation; Equivalence Classes of an Equivalence Relation 8.4 Modular Arithmetic with Applications to Cryptography 8.5 524 Properties of Congruence Modulo zt; Modular Arithmetic; Extending the
Euclidean Algorithm; Finding an Inverse Modulo n; RSA Cryptography; Euclid’s Lemma; Fermat’s Little Theorem; Why Does the RSA Cipher Work?; Message Authentication; Additional Remarks on Number Theory and Cryptography Partial Order Relations 546 Antisymmetry; Partial Order Relations; Lexicographic Order; Hasse Diagrams; Partially and Totally Ordered Sets; Topological Sorting; An Application: PERT and CPM
X CONTENTS CHAPTER 9 Counting and Probability 564 9.1 Introduction to Probability 564 Definition of Sample Space and Event; Probability in the Equally Likely Case; Counting the Elements of Lists, Sublists, and One-Dimensional Arrays 9.2 Possibility Trees and the Multiplication Rule 573 Possibility Trees; The Multiplication Rule; When the Multiplication Rule Is Difficult or Impossible to Apply; Permutations; Permutations of Selected Elements 9.3 Counting Elements of Disjoint Sets: The Addition Rule 589 The Addition Rule; The Difference Rule; The Inclusion/Exclusion Rule 9.4 The Pigeonhole Principle 604 Statement and Discussion of the Principle; Applications; Decimal Expansions of Fractions; Generalized Pigeonhole Principle; Proof of the Pigeonhole Principle 9.5 Counting Subsets of a Set: Combinations 617 r-Combinations; Ordered and Unordered Selections; Relation between Permutations and Combinations; Permutation of a Set with Repeated Elements; Some Advice about Counting; The Number of Partitions of a Set into r Subsets 9.6 r-Combinations with Repetition Allowed 634 Multisets and How to Count Them; Which Formula to Use? 9.7 Pascal’s Formula and the Binomial Theorem 642 Combinatorial Formulas; Pascal’s Triangle; Algebraic and Combinatorial Proofs of Pascal’s Formula; The Binomial Theorem and Algebraic and Combinatorial Proofs for It; Applications 9.8 Probability Axioms and Expected Value 655 Probability Axioms; Deriving Additional Probability Formulas; Expected Value 9.9 Conditional Probability, Bayes’ Formula, and Independent Events Conditional Probability; Bayes’ Theorem;
Independent Events CHAPTER 10 10.1 Theory of Graphs and Trees Trails, Paths, and Circuits 662 677 677 Definitions; Connectedness; Euler Circuits; Hamiltonian Circuits 10.2 Matrix Representations of Graphs 698 Matrices; Matrices and Directed Graphs; Matrices and Undirected Graphs; Matrices and Connected Components; Matrix Multiplication; Counting Walks of Length N 10.3 Isomorphisms of Graphs 713 Definition of Graph Isomorphism and Examples; Isomorphic Invariants֊ Graph Isomorphism for Simple Graphs
ХІ CONTENTS 10.4 Trees: Examples and Basic Properties 720 Definition and Examples of Trees; Characterizing Trees 10.5 Rooted Trees 732 Definition and Examples of Rooted Trees; Binary Trees and Their Properties; Binary Search Trees 10.6 Spanning Trees and a Shortest Path Algorithm 742 Definition of a Spanning Tree; Minimum Spanning Trees; Kruskal’s Algorithm; Prim’s Algorithm; Dijkstra’s Shortest Path Algorithm CHAPTER 11 11.1 Analysis of Algorithm Efficiency 760 Real-Valued Functions of a Real Variable and Their Graphs 760 Graph of a Function; Power Functions; The Floor Function; Graphing Functions Defined on Sets of Integers; Graph of a Multiple of a Function; Increasing and Decreasing Functions 11.2 Big-О, Big-Omega, and Big-Theta Notations 769 Definition and General Properties of Ο-, Ω-, and ©-Notations; Orders of Power Functions; Orders of Polynomial Functions; A Caution about О-Notation; Theorems about Order Notation 11.3 Application: Analysis of Algorithm Efficiency I 787 Measuring the Efficiency of an Algorithm; Computing Orders of Simple Algorithms; The Sequential Search Algorithm; The Insertion Sort Algorithm; Time Efficiency of an Algorithm 11.4 Exponential and Logarithmic Functions: Graphs and Orders 800 Graphs of Exponential and Logarithmic Functions; Application: Number of Bits Needed to Represent an Integer in Binary Notation; Application: Using Logarithms to Solve Recurrence Relations; Exponential and Logarithmic Orders 11.5 CHAPTER 12 Application: Analysis of Algorithm Efficiency 11 813 Binary Search; Divide-and-Conquer Algorithms; The Efficiency of the
Binary Search Algorithm; Merge Sort; Tractable and Intractable Problems; A Final Remark on Algorithm Efficiency Regular Expressions and Finite-State Automata 828 12.1 Formal Languages and Regular Expressions 829 Definitions and Examples of Formal Languages and Regular Expressions; The Language Defined by a Regular Expression; Practical Uses of Regular Expressions 12.2 Finite-State Automata 841 Definition of a Finite-State Automaton; The Language Accepted by an Automaton; The Eventual-State Function; Designing a Finite-State Automaton; Simulating a Finite-State
xii CONTENTS Automaton Using Software; Finite-State Automata and Regular Expressions; Regular Languages 12.3 Simplifying Finite-State Automata 858 ♦-Equivalence of States; ^-Equivalence of States; Finding the «-Equivalence Classes; The Quotient Automaton; Constructing the Quotient Automaton; Equivalent Automata APPENDIX A Properties of the Real Numbers APPENDIX В Solutions and Hints to Selected Exercises Index 1-1 Α-Ί A-4 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Epp, Susanna S. 1943- |
| author_GND | (DE-588)1136686010 |
| author_facet | Epp, Susanna S. 1943- |
| author_role | aut |
| author_sort | Epp, Susanna S. 1943- |
| author_variant | s s e ss sse |
| building | Verbundindex |
| bvnumber | BV046916963 |
| classification_rvk | SK 890 |
| contents | Speaking mathematically --The logic of compound statements -- The logic of quantified statements -- Elementary number theory and methods of proof -- Sequences, mathematical induction, and recursion -- Set theory -- Properties of functions -- Properties of relations -- Counting and probability -- Theory of graphs and trees -- Analysis of algorithm efficiency -- Regular expressions and finite-state automata |
| ctrlnum | (OCoLC)1199068393 (DE-599)BVBBV046916963 |
| discipline | Mathematik |
| discipline_str_mv | Mathematik |
| edition | Fifth edition, metric version |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02367nam a2200409 c 4500</leader><controlfield tag="001">BV046916963</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220718 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">200929s2020 a||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780357114087</subfield><subfield code="9">9780357114087</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1199068393</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046916963</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-573</subfield><subfield code="a">DE-473</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Epp, Susanna S.</subfield><subfield code="d">1943-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1136686010</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Discrete mathematics with applications</subfield><subfield code="c">Susanna S. Epp, DePaul University</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Fifth edition, metric version</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Australia</subfield><subfield code="b">Cengage Learning</subfield><subfield code="c">2020</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xxii, 871, A-141, I-22 Seiten</subfield><subfield code="b">Illustrationen, Diagramme</subfield><subfield code="c">27 cm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes index</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Aus dem Vorwort: This metric version differs from the U.S. version of Discrete Mathematics with Applications, Fifth Edition as follows: The units of measurement used in the examples have been converted from the U.S. Customary System (USCS) of unites (also referred to as English of Imperial units) to Metric units. The appendix containing solutions to selected exercises and the instructor's solutions manual have been converted to metric where appropriate.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Speaking mathematically --The logic of compound statements -- The logic of quantified statements -- Elementary number theory and methods of proof -- Sequences, mathematical induction, and recursion -- Set theory -- Properties of functions -- Properties of relations -- Counting and probability -- Theory of graphs and trees -- Analysis of algorithm efficiency -- Regular expressions and finite-state automata</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Diskrete Mathematik</subfield><subfield code="0">(DE-588)4129143-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Mathematics</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Mathematics</subfield></datafield><datafield tag="653" ind1=" " ind2="6"><subfield code="a">Textbooks</subfield></datafield><datafield tag="653" ind1=" " ind2="6"><subfield code="a">Textbooks</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Diskrete Mathematik</subfield><subfield code="0">(DE-588)4129143-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bamberg - ADAM Catalogue Enrichment</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=032326272&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032326272</subfield></datafield></record></collection> |
| id | DE-604.BV046916963 |
| illustrated | Illustrated |
| index_date | 2024-07-03T15:30:03Z |
| indexdate | 2024-07-10T08:57:26Z |
| institution | BVB |
| isbn | 9780357114087 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032326272 |
| oclc_num | 1199068393 |
| open_access_boolean | |
| owner | DE-573 DE-473 DE-BY-UBG |
| owner_facet | DE-573 DE-473 DE-BY-UBG |
| physical | xxii, 871, A-141, I-22 Seiten Illustrationen, Diagramme 27 cm |
| publishDate | 2020 |
| publishDateSearch | 2020 |
| publishDateSort | 2020 |
| publisher | Cengage Learning |
| record_format | marc |
| spelling | Epp, Susanna S. 1943- Verfasser (DE-588)1136686010 aut Discrete mathematics with applications Susanna S. Epp, DePaul University Fifth edition, metric version Australia Cengage Learning 2020 xxii, 871, A-141, I-22 Seiten Illustrationen, Diagramme 27 cm txt rdacontent n rdamedia nc rdacarrier Includes index Aus dem Vorwort: This metric version differs from the U.S. version of Discrete Mathematics with Applications, Fifth Edition as follows: The units of measurement used in the examples have been converted from the U.S. Customary System (USCS) of unites (also referred to as English of Imperial units) to Metric units. The appendix containing solutions to selected exercises and the instructor's solutions manual have been converted to metric where appropriate. Speaking mathematically --The logic of compound statements -- The logic of quantified statements -- Elementary number theory and methods of proof -- Sequences, mathematical induction, and recursion -- Set theory -- Properties of functions -- Properties of relations -- Counting and probability -- Theory of graphs and trees -- Analysis of algorithm efficiency -- Regular expressions and finite-state automata Diskrete Mathematik (DE-588)4129143-8 gnd rswk-swf Mathematics Textbooks Diskrete Mathematik (DE-588)4129143-8 s DE-604 Digitalisierung UB Bamberg - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=032326272&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Epp, Susanna S. 1943- Discrete mathematics with applications Speaking mathematically --The logic of compound statements -- The logic of quantified statements -- Elementary number theory and methods of proof -- Sequences, mathematical induction, and recursion -- Set theory -- Properties of functions -- Properties of relations -- Counting and probability -- Theory of graphs and trees -- Analysis of algorithm efficiency -- Regular expressions and finite-state automata Diskrete Mathematik (DE-588)4129143-8 gnd |
| subject_GND | (DE-588)4129143-8 |
| title | Discrete mathematics with applications |
| title_auth | Discrete mathematics with applications |
| title_exact_search | Discrete mathematics with applications |
| title_exact_search_txtP | Discrete mathematics with applications |
| title_full | Discrete mathematics with applications Susanna S. Epp, DePaul University |
| title_fullStr | Discrete mathematics with applications Susanna S. Epp, DePaul University |
| title_full_unstemmed | Discrete mathematics with applications Susanna S. Epp, DePaul University |
| title_short | Discrete mathematics with applications |
| title_sort | discrete mathematics with applications |
| topic | Diskrete Mathematik (DE-588)4129143-8 gnd |
| topic_facet | Diskrete Mathematik |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=032326272&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT eppsusannas discretemathematicswithapplications |