Ship-Ship-Hooray! FREE 2-Day Air* on $25+ Excludes marketplace items >

ISBN13: 978-0471849025

ISBN10: 0471849022

Edition: 88

Copyright: 1988

Publisher: John Wiley & Sons, Inc.

Published: 1988

International: No

ISBN10: 0471849022

Edition: 88

Copyright: 1988

Publisher: John Wiley & Sons, Inc.

Published: 1988

International: No

This first-year course in discrete mathematics requires no calculus or computer programming experience. The approach stresses finding efficient algorithms, rather than existential results. Provides an introduction to constructing proofs (especially by induction), and an introduction to algorithmic problem-solving. All algorithms are presented in English, in a format compatible with the Pascal programming language. Contains many exercises, with answers at the back of the book (detailed solutions being supplied for difficult problems).

**SETS AND ALGORITHMS: AN INTRODUCTION.**

Binary Arithmetic and the Magic Trick Revisited.

Algorithms.

Set Theory and the Magic Trick.

Set Cardinality and Counting.

**ARITHMETIC.**

Exponentiation: A First Look.

Three Inductive Proofs.

How Good Is Fast Exponentiation?

The ``Big Oh'' Notation.

**ARITHMETIC OF SETS.**

Binomial Coefficients.

Permutations.

The Binomial Theorem.

**NUMBER THEORY.**

Greatest Common Divisors.

The Euclidean Algorithm.

Fibonacci Numbers.

Congruences and Equivalence Relations.

An Application: Public Key Encryption Schemes.

**GRAPH THEORY.**

Building the LAN.

Graphs.

Trees and the LAN.

Graphical Highlights.

Index.

ISBN10: 0471849022

Edition: 88

Copyright: 1988

Publisher: John Wiley & Sons, Inc.

Published: 1988

International: No

This first-year course in discrete mathematics requires no calculus or computer programming experience. The approach stresses finding efficient algorithms, rather than existential results. Provides an introduction to constructing proofs (especially by induction), and an introduction to algorithmic problem-solving. All algorithms are presented in English, in a format compatible with the Pascal programming language. Contains many exercises, with answers at the back of the book (detailed solutions being supplied for difficult problems).

Table of Contents

**SETS AND ALGORITHMS: AN INTRODUCTION.**

Binary Arithmetic and the Magic Trick Revisited.

Algorithms.

Set Theory and the Magic Trick.

Set Cardinality and Counting.

**ARITHMETIC.**

Exponentiation: A First Look.

Three Inductive Proofs.

How Good Is Fast Exponentiation?

The ``Big Oh'' Notation.

**ARITHMETIC OF SETS.**

Binomial Coefficients.

Permutations.

The Binomial Theorem.

**NUMBER THEORY.**

Greatest Common Divisors.

The Euclidean Algorithm.

Fibonacci Numbers.

Congruences and Equivalence Relations.

An Application: Public Key Encryption Schemes.

**GRAPH THEORY.**

Building the LAN.

Graphs.

Trees and the LAN.

Graphical Highlights.

Index.

- Marketplace
- From