**Applied Finite Mathematics**

by Rupinder Sekhon

**Publisher**: Connexions 2011**Number of pages**: 347

**Description**:

Applied Finite Mathematics covers topics including linear equations, matrices, linear programming (geometrical approach and simplex method), the mathematics of finance, sets and counting, probability, Markov chains, and game theory.

Download or read it online for free here:

**Download link**

(multiple formats)

## Similar books

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

(

**6212**views)

**Notes on Discrete Mathematics**

by

**Miguel A. Lerma**

Summary of the course CS 310: Mathematical Foundations of Computer Science. It covers concepts of discreet mathematics and applications to computer science, logic and Boolean circuits, functions, sets, relations, databases, finite automata, and more.

(

**18599**views)

**Discrete Math for Computer Science Students**

by

**Ken Bogart, Cliff Stein**-

**Dartmouth College**

It gives thorough coverage to topics that have great importance to computer scientists and provides a motivating computer science example for each math topic. Contents: Counting; Cryptography and Number Theory; Reflections on Logic and Proof.

(

**8446**views)

**generatingfunctionology**

by

**Herbert S. Wilf**-

**A K Peters, Ltd.**

The book about main ideas on generating functions and some of their uses in discrete mathematics. Generating functions are a bridge between discrete mathematics and continuous analysis. The book is suitable for undergraduates.

(

**20080**views)