Discrete Mathematics: An Open Introduction, 2nd Edition

This gentle introduction to discrete mathematics is written for first and second year math majors, especially those who intend to teach.

**Tag(s):**
Discrete Mathematics

**Publication date**: 16 Aug 2016

**ISBN-10**:
1534970746

**ISBN-13**:
9781534970748

**Paperback**:
336 pages

**Views**: 6,331

**Type**: Textbook

**Publisher**:
CreateSpace Independent Publishing Platform

**License**:
Creative Commons Attribution-ShareAlike 4.0 International

**Post time**: 31 Aug 2016 08:50:00

Discrete Mathematics: An Open Introduction, 2nd Edition

This gentle introduction to discrete mathematics is written for first and second year math majors, especially those who intend to teach.

You are free to:

Share — copy and redistribute the material in any medium or format

Adapt — remix, transform, and build upon the material for any purpose, even commercially.

The licensor cannot revoke these freedoms as long as you follow the license terms.

Click**here** to read the full license.

Share — copy and redistribute the material in any medium or format

Adapt — remix, transform, and build upon the material for any purpose, even commercially.

The licensor cannot revoke these freedoms as long as you follow the license terms.

Click

Note:

More resources on this textbook and the previous edition are available at the book's webpage.

From the Book Description:

More resources on this textbook and the previous edition are available at the book's webpage.

From the Book Description:

Oscar Levin wrote:This gentle introduction to discrete mathematics is written for first and second year math majors, especially those who intend to teach. The text began as a set of lecture notes for the discrete mathematics course at the University of Northern Colorado. This course serves both as an introduction to topics in discrete math and as the "introduction to proof" course for math majors. The course is usually taught with a large amount of student inquiry, and this text is written to help facilitate this.

Four main topics are covered: counting, sequences, logic, and graph theory. Along the way proofs are introduced, including proofs by contradiction, proofs by induction, and combinatorial proofs. The book contains over 360 exercises, including 230 with solutions and 130 more involved problems suitable for homework. There are also Investigate! activities throughout the text to support active, inquiry based learning.

While there are many fine discrete math textbooks available, this text has the following advantages:

- It is written to be used in an inquiry rich course.

- It is written to be used in a course for future math teachers.

- It is open source, with low cost print editions and free electronic editions.

Tweet

About The Author(s)

Oscar Levin is an assistant professor of math in the School of Mathematical Sciences at the University of Northern Colorado. His primary interests lie in effective algebra and combinatorics, computability theory, reverse mathematics, and mathematical logic.

Book Categories

Computer Science
Introduction to Computer Science
Introduction to Computer Programming
Algorithms and Data Structures
Artificial Intelligence
Computer Vision
Machine Learning
Neural Networks
Game Development and Multimedia
Data Communication and Networks
Coding Theory
Computer Security
Information Security
Cryptography
Information Theory
Computer Organization and Architecture
Operating Systems
Image Processing
Parallel Computing
Concurrent Programming
Relational Database
Document-oriented Database
Data Mining
Big Data
Data Science
Digital Libraries
Compiler Design and Construction
Functional Programming
Logic Programming
Object Oriented Programming
Formal Methods
Software Engineering
Agile Software Development
Information Systems
Geographic Information System (GIS)

Mathematics
Mathematics
Algebra
Abstract Algebra
Linear Algebra
Number Theory
Numerical Methods
Precalculus
Calculus
Differential Equations
Category Theory
Proofs
Discrete Mathematics
Theory of Computation
Graph Theory
Real Analysis
Complex Analysis
Probability
Statistics
Game Theory
Queueing Theory
Operations Research
Computer Aided Mathematics

Supporting Fields
Web Design and Development
Mobile App Design and Development
System Administration
Cloud Computing
Electric Circuits
Embedded System
Signal Processing
Integration and Automation
Network Science
Project Management

Operating System
Programming/Scripting
Ada
Assembly
C / C++
Common Lisp
Forth
Java
JavaScript
Lua
Microsoft .NET
Rexx
Perl
PHP
Python
R
Rebol
Ruby
Scheme
Tcl/Tk

Miscellaneous
Sponsors