## Discrete algorithmic mathematicsWhat is discrete algorithmic mathematics. Mathematical preliminaries. Algorithms. Mathematical induction. Graphs and trees. Fundamental counting methods. Difference equations. Probability. An introduction to mathematical logic. Algorithmic linear algebra. Infinite processes in discrete mathematics. Sorting things out with sorting. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Mathematical Preliminaries | 10 |

Algorithms | 68 |

Mathematical Induction | 137 |

Copyright | |

9 other sections not shown

### Other editions - View all

Discrete Algorithmic Mathematics, Third Edition Stephen B. Maurer,Anthony Ralston Limited preview - 2005 |

Discrete Algorithmic Mathematics, Third Edition Stephen B. Maurer,Anthony Ralston Limited preview - 2005 |

### Common terms and phrases

adjacency matrix algebra algorithm answer argument assume average balls binomial Boolean calculate called Chapter coefficients color column compute consider converges correct defined definition difference equation digits digraph distribution downsweep edge eigenvalue elements endfor endif endrepeat entries equal Eulerian cycle Example expression factor FIGURE formula function Gaussian elimination give graph Hint inductive step Input instance integers iterative Karnaugh map length loop invariant Markov chain mathematics matrix merge sort method multiplication node nonnegative notation number of comparisons obtain output pair permutation pick pivot player polynomial positive integer probability problem procedure proof propositional calculus propositions prove Quicksort random real numbers recursive reduced echelon form repeat result sample space Section sequence solution solve sort spanning tree statement subset subtract summation Suppose Theorem tion true truth table urns variables vertex vertices wins write