**Exploring Discrete Mathematics Using Maple**

by Kenneth H. Rosen

**Publisher**: Mcgraw-Hill College 1996**ISBN/ASIN**: 0070541280**Number of pages**: 400

**Description**:

This is a guide to help you explore concepts in discrete mathematics using the computer system Maple. The book is designed to be accessible to those who are complete novices with Maple and with computer programming, but it has much to offer even experts.

Download or read it online for free here:

**Download link**

(multiple PDF files)

## Similar books

**Discrete Mathematics: An Open Introduction**

by

**Oscar Levin**-

**University of Northern Colorado**

This book was written to be used as the primary text for introduction to proof, as well as an introduction to topics in discrete mathematics. Contents: Counting; Sequences; Symbolic Logic and Proofs; Graph Theory; Generating Functions; and more.

(

**2285**views)

**Lists, Decisions, and Graphs**

by

**Edward A. Bender, S. Gill Williamson**-

**University of California, San Diego**

In this book, four basic areas of discrete mathematics are presented: Counting and Listing, Functions, Decision Trees and Recursion, and Basic Concepts in Graph Theory. At the end of each unit is a list of Multiple Choice Questions for Review.

(

**1602**views)

**Topics in Discrete Mathematics**

by

**A.F. Pixley**-

**Harvey Mudd College**

This text is an introduction to a selection of topics in discrete mathematics: Combinatorics; The Integers; The Discrete Calculus; Order and Algebra; Finite State Machines. The prerequisites include linear algebra and computer programming.

(

**4608**views)

**Discrete Mathematics for Computer Science**

by

**Jean Gallier**-

**arXiv**

These are notes on discrete mathematics for computer scientists. The presentation is somewhat unconventional. I emphasize partial functions more than usual, and I provide a fairly complete account of the basic concepts of graph theory.

(

**9175**views)