Win $250 in textbooks! Enter now >

Edition: 88

Copyright: 1988

Publisher: John Wiley & Sons, Inc.

Published: 1988

International: No

Copyright: 1988

Publisher: John Wiley & Sons, Inc.

Published: 1988

International: No

Well, that's no good. Unfortunately, this edition is currently out of stock. Please check back soon.

Available in the Marketplace starting at $1.99

Price | Condition | Seller | Comments |
---|

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.

Summary

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.

Publisher Info

Publisher: John Wiley & Sons, Inc.

Published: 1988

International: No

Published: 1988

International: No

**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.