Discrete mathematics : an open introduction / Oscar Levin

By:

Levin, Oscar

Material type: Text

TextPublication details: Colorado ; Oscar Levin c2021Edition: 3rd EditionDescription: xiv, 393 pages : illustrations ; 26cmISBN:

978-1792-90169-0

LOC classification:

GC QA 39 .L48 2021

Contents:

Introduction and Preliminaries -- Counting -- Sequences -- Symbolic Logic and Proofs -- Graph Theory -- Additional Topics.

Summary: 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 470 exercises, including 275 with solutions and over 100 with hints. There are also Investigate! activities throughout the text to support active, inquiry based learning.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Home library	Collection	Shelving location	Call number	Status	Date due	Barcode
Books	NU BALIWAG	NU BALIWAG	Information Technology	General Circulation	GC QA 39 .L48 2021 (Browse shelf(Opens below))	Available		NUBUL000004420

Browsing NU BALIWAG shelves, Shelving location: General Circulation, Collection: Information Technology Close shelf browser (Hides shelf browser)

Previous							No cover image available	Next
Previous	GC QA 76.73.J38 2021 c.1 Beginning programming with java : for dummies /	GC QA 76.73.P98 .L68 2021 c.1 Python object-oriented programming : build robust and maintainable object-oriented Python applications and libraries /	GC QA 76.76 .H94 .M34 2023 c.1 HtMl,CSS & javascript: for dummies /	GC QA 39 .L48 2021 Discrete mathematics : an open introduction /	GC QA 39 .R67 2019 Discrete mathematics and its application /	GC QA 76 .J36 2018 C# data structures and algorithms : explore the possibilities of C# for developing a variety of efficient applications /	GC QA 76 .M67 2020 Jakarta EE cookbook : practical recipes for enterprise Java developers to deliver large scale applications with Jakarta EE /	Next

Include index

Introduction and Preliminaries -- Counting -- Sequences -- Symbolic Logic and Proofs -- Graph Theory -- Additional Topics.

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 470 exercises, including 275 with solutions and over 100 with hints. There are also Investigate! activities throughout the text to support active, inquiry based learning.

There are no comments on this title.

to post a comment.