Exploring Discrete Mathematics Using Maple
by Kenneth H. Rosen
Publisher: Mcgraw-Hill College 1996
Number of pages: 400
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.
Home page url
Download or read it online for free here:
(multiple PDF files)
by Vladlen Koltun - Stanford University
Contents: Sets and Notation; Induction; More Proof Techniques; Divisibility; Prime Numbers; Modular Arithmetic; Relations and Functions; Mathematical Logic; Counting; Binomial Coefficients; Inclusion-Exclusion Principle; Pigeonhole Principle; etc.
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.
by M. O. Albertson, J. P. Hutchinson - J. Wiley
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...
Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. This book will help you think well about discrete problems: problems where tools like calculus fail because there's no continuity.