Logo

A Spiral Workbook for Discrete Mathematics

Large book cover: A Spiral Workbook for Discrete Mathematics

A Spiral Workbook for Discrete Mathematics
by

Publisher: Open SUNY Textbooks
ISBN/ASIN: 1942341180
Number of pages: 307

Description:
This is a text that covers the standard topics in a sophomore-level course in discrete mathematics: logic, sets, proof techniques, basic number theory, functions, relations, and elementary combinatorics, with an emphasis on motivation. It explains and clarifies the unwritten conventions in mathematics, and guides the students through a detailed discussion on how a proof is revised from its draft to a final polished form.

Home page url

Download or read it online for free here:
Download link
(1.9MB, PDF)

Similar books

Book cover: Elementary Computer MathematicsElementary Computer Mathematics
by - University of Cincinnati Blue Ash College
This book is an introduction to the mathematics used in the design of computer and network hardware and software. We will survey topics in computer arithmetic and data representation, logic and set theory, graph theory and computer measurement.
(5091 views)
Book cover: generatingfunctionologygeneratingfunctionology
by - 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.
(11759 views)
Book cover: Notes on Discrete MathematicsNotes on Discrete Mathematics
by
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.
(13588 views)
Book cover: Discrete Mathematics with AlgorithmsDiscrete Mathematics with Algorithms
by - 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...
(2991 views)