Scribd
Upload
235 views10 pages

Discrete: Mathematics

asdasdasdadad

Uploaded by

IT Services MTsN 1 Yogyakarta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
235 views10 pages

Discrete: Mathematics

asdasdasdadad

Uploaded by

IT Services MTsN 1 Yogyakarta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

Discrete

Mathematics
An Open Introduction

Oscar Levin

3rd Edition
Discrete
Mathematics

An Open Introduction

Oscar Levin

3rd Edition
Oscar Levin

School of Mathematical Science

University of Northern Colorado

Greeley, Co 80639

[email protected]

http://math.oscarlevin.com/

© 2013-2019 by Oscar Levin

This work is licensed under the Creative Commons Attribution-ShareAlike

4.0 International License. To view a copy of this license, visit

http://creativecommons.org/licenses/by-sa/4.0/ .

3rd Edition

4th Printing: 12/29/2019

ISBN: 978-1792901690
For Madeline and Teagan
Acknowledgements

This book would not exist if not for “Discrete and Combinatorial Math-

ematics” by Richard Grassl and Tabitha Mingus. It is the book I learned

discrete math out of, and taught out of the semester before I began writing

this text. I wanted to maintain the inquiry based feel of their book but

update, expand and rearrange some of the material. Some of the best

exposition and exercises here were graciously donated from this source.

Thanks to Alees Seehausen who co-taught the Discrete Mathematics

course with me in 2015 and helped develop many of the Investigate! ac-

tivities and other problems currently used in the text. She also offered

many suggestions for improvement of the expository text, for which I am

quite grateful. Thanks also to Katie Morrison, Nate Eldredge and Richard

Grassl (again) for their suggestions after using parts of this text in their

classes.

While odds are that there are still errors and typos in the current

book, there are many fewer thanks to the work of Michelle Morgan over

the summer of 2016.

The book is now available in an interactive online format, and this is

entirely thanks to the work of Rob Beezer, David Farmer, and Alex Jordan

along with the rest of the participants of the pretext-support group.

Finally, a thank you to the numerous students who have pointed out

typos and made suggestions over the years and a thanks in advance to

those who will do so in the future.


vi
Preface

This text aims to give an introduction to select topics in discrete mathe-

matics at a level appropriate for first or second year undergraduate math

majors, especially those who intend to teach middle and high school math-

ematics. The book began as a set of notes for the Discrete Mathematics

course at the University of Northern Colorado. This course serves both as

a survey of the topics in discrete math and as the “bridge” course for math

majors, as UNC does not offer a separate “introduction to proofs” course.

Most students who take the course plan to teach, although there are a

handful of students who will go on to graduate school or study applied

math or computer science. For these students the current text hopefully

is still of interest, but the intent is not to provide a solid mathematical

foundation for computer science, unlike the majority of textbooks on the

subject.

Another difference between this text and most other discrete math

books is that this book is intended to be used in a class taught using

problem oriented or inquiry based methods. When I teach the class, I will

assign sections for reading after first introducing them in class by using

a mix of group work and class discussion on a few interesting problems.

The text is meant to consolidate what we discover in class and serve as a

reference for students as they master the concepts and techniques covered

in the unit. None-the-less, every attempt has been made to make the text

sufficient for self study as well, in a way that hopefully mimics an inquiry

based classroom.

The topics covered in this text were chosen to match the needs of

the students I teach at UNC. The main areas of study are combinatorics,

sequences, logic and proofs, and graph theory, in that order. Induction is

covered at the end of the chapter on sequences. Most discrete books put

logic first as a preliminary, which certainly has its advantages. However,

I wanted to discuss logic and proofs together, and found that doing both
viii

and proofs chapter or at the very end of the course). These additional

topics are covered in the last chapter.

While I (currently) believe this selection and order of topics is optimal,

you should feel free to skip around to what interests you. There are

occasionally examples and exercises that rely on earlier material, but I

have tried to keep these to a minimum and usually can either be skipped

or understood without too much additional study. If you are an instructor,

feel free to edit the L AT


E X or PreTeXt source to fit your needs.

Improvements to the 3rd Edition.

In addition to lots of minor corrections, both to typographical and math-

ematical errors, this third edition includes a few major improvements,

including:

• More than 100 new exercises, bringing the total to 473. The selection

of which exercises have solutions has also been improved, which

should make the text more useful for instructors who want to assign

homework from the book.

• A new section in on trees in the graph theory chapter.

• Substantial improvement to the exposition in chapter 0, especially

the section on functions.

• The interactive online version of the book has added interactivity.

Currently, many of the exercises are displayed as WeBWorK prob-

lems, allowing readers to enter answers to verify they are correct.

The previous editions (2nd edition, released in August 2016, and the

Fall 2015 edition) will still be available for instructors who wish to use

those versions due to familiarity.

My hope is to continue improving the book, releasing a new edition

each spring in time for fall adoptions. These new editions will incorporate

additions and corrections suggested by instructors and students who use

You might also like