Goodwin, Roger L
(2005):
*Class Notes in Discrete Mathematics, Operations Research, Statistics and Probability (Fourth Edition, v1).*

Preview |
PDF
MPRA_paper_96699.pdf Download (16MB) | Preview |

## Abstract

EditorÃƒÆ’Ã‚Â¢ÃƒÂ¢Ã¢â‚¬Å¡Ã‚Â¬ÃƒÂ¢Ã¢â‚¬Å¾Ã‚Â¢s Note: In graduate school, it became too cumbersome for me to look-up equations, theorems, proofs, and problem solutions from previous courses. I had three boxes full of notes and was going on my fourth. Due to the need to reference my notes periodically, the notes became more unorganized over time. ThatÃƒÆ’Ã‚Â¢ÃƒÂ¢Ã¢â‚¬Å¡Ã‚Â¬ÃƒÂ¢Ã¢â‚¬Å¾Ã‚Â¢s when I decided to typeset them. I have been doing this for over a decade. Later in life, some colleagues asked if I could make these notes available to others (they were talking about themselves). I did. These notes can be downloaded for free from the web site http://www.repec.org/ and can be found in the Library of Congress. Note that the beginning of each chapter lists the professorÃƒÆ’Ã‚Â¢ÃƒÂ¢Ã¢â‚¬Å¡Ã‚Â¬ÃƒÂ¢Ã¢â‚¬Å¾Ã‚Â¢s name and aÃƒÆ’Ã‚Â¯ÃƒÂ¢Ã¢â‚¬Å¡Ã‚Â¬Ãƒâ€¦Ã‚Â½liation. Additionally, the course number, the date the course was taken, and the text book are given. The reader may also notice that I have made more use of the page space than in the previous editions of this manuscript. Hence, the book is shorter. If this causes the reader problems, then simply copy the proofs onto a blank sheet of paper ÃƒÆ’Ã‚Â¢ÃƒÂ¢Ã¢â‚¬Å¡Ã‚Â¬ÃƒÂ¢Ã¢â€šÂ¬Ã¯Â¿Â½ one line per algebraic manipulation. In this text, I put several algebraic manipulations on one line to save space.

Item Type: | MPRA Paper |
---|---|

Original Title: | Class Notes in Discrete Mathematics, Operations Research, Statistics and Probability (Fourth Edition, v1) |

English Title: | Class Notes in Discrete Mathematics, Operations Research, Statistics and Probability (Fourth Edition, v1) |

Language: | English |

Keywords: | discrete mathematics, statistics, probability, computer science, Logical Inferences, sets, induction, deduction, formal languages, primitive recursion, mu recursion, Automata, Vector Processing, super computing, Linear Algebra, Stochastic Models, math models, methods of proof, assertions, proof techniques, math reasoning, reasoning problems, predicates, quantifiers, negation, sets, operators, operations, venn diagrams, binary relationsips, graph theory, formal languages, productions, lambda productions, grammars, context free grammars, computations, formal computations, recursion, mu recursion, primitive recursion, computable functions, flow charts, while language, goto language, languages, regular languages, pushdown automata, automata, parsing, regular expressions |

Subjects: | C - Mathematical and Quantitative Methods > C8 - Data Collection and Data Estimation Methodology ; Computer Programs |

Item ID: | 96699 |

Depositing User: | Mr. Roger L Goodwin |

Date Deposited: | 31 Oct 2019 16:17 |

Last Modified: | 20 Oct 2023 02:49 |

References: | 1. R. McNaughton, Elementary Computability, Formal Languages, and Automata, Printice-Hall, Inc., Englewood Cliffs, New Jersey, 1982. 2. D. Stanat and D. F. McAllister, Discrete Mathematics in Computer Science, Prentice-Hall, Inc., Englewood Cliffs, NJ, 1977. |

URI: | https://mpra.ub.uni-muenchen.de/id/eprint/96699 |