A First Course in Discrete Mathematics
A First Course in Discrete Mathematics

Author: Ian Anderson

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 177

ISBN-13: 085729315X

DOWNLOAD EBOOK

Drawing on many years'experience of teaching discrete mathem atics to students of all levels, Anderson introduces such as pects as enumeration, graph theory and configurations or arr angements. Starting with an introduction to counting and rel ated problems, he moves on to the basic ideas of graph theor y with particular emphasis on trees and planar graphs. He de scribes the inclusion-exclusion principle followed by partit ions of sets which in turn leads to a study of Stirling and Bell numbers. Then follows a treatment of Hamiltonian cycles, Eulerian circuits in graphs, and Latin squares as well as proof of Hall's theorem. He concludes with the constructions of schedules and a brief introduction to block designs. Each chapter is backed by a number of examples, with straightforw ard applications of ideas and more challenging problems.

A First Course in Discrete Mathematics
A First Course in Discrete Mathematics

Author: John C. Molluzzo

Publisher: Waveland Press

Published: 1997-01-28

Total Pages: 523

ISBN-13: 1478634391

DOWNLOAD EBOOK

This highly regarded work fills the need for a treatment of elementary discrete mathematics that provides a core of mathematical terminology and concepts as well as emphasizes computer applications. Includes numerous elementary applications to computing and examples with solutions.

Discrete Mathematics
Discrete Mathematics

Author: Oscar Levin

Publisher: Createspace Independent Publishing Platform

Published: 2018-07-30

Total Pages: 238

ISBN-13: 9781724572639

DOWNLOAD EBOOK

Note: This is a custom edition of Levin's full Discrete Mathematics text, arranged specifically for use in a discrete math course for future elementary and middle school teachers. (It is NOT a new and updated edition of the main text.)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.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.

A First Course in Discrete Dynamical Systems
A First Course in Discrete Dynamical Systems

Author: Richard A. Holmgren

Publisher: Springer Science & Business Media

Published: 2012-09-05

Total Pages: 231

ISBN-13: 1441987320

DOWNLOAD EBOOK

Given the ease with which computers can do iteration it is now possible for almost anyone to generate beautiful images whose roots lie in discrete dynamical systems. Images of Mandelbrot and Julia sets abound in publications both mathematical and not. The mathematics behind the pictures are beautiful in their own right and are the subject of this text. Mathematica programs that illustrate the dynamics are included in an appendix.

A Short Course in Discrete Mathematics
A Short Course in Discrete Mathematics

Author: Edward A. Bender

Publisher: Courier Corporation

Published: 2005-01-01

Total Pages: 258

ISBN-13: 0486439461

DOWNLOAD EBOOK

What sort of mathematics do I need for computer science? In response to this frequently asked question, a pair of professors at the University of California at San Diego created this text. Its sources are two of the university's most basic courses: Discrete Mathematics, and Mathematics for Algorithm and System Analysis. Intended for use by sophomores in the first of a two-quarter sequence, the text assumes some familiarity with calculus. Topics include Boolean functions and computer arithmetic; logic; number theory and cryptography; sets and functions; equivalence and order; and induction, sequences, and series. Multiple choice questions for review appear throughout the text. Original 2005 edition. Notation Index. Subject Index.

A First Course in Graph Theory
A First Course in Graph Theory

Author: Gary Chartrand

Publisher: Courier Corporation

Published: 2013-05-20

Total Pages: 466

ISBN-13: 0486297306

DOWNLOAD EBOOK

Written by two prominent figures in the field, this comprehensive text provides a remarkably student-friendly approach. Its sound yet accessible treatment emphasizes the history of graph theory and offers unique examples and lucid proofs. 2004 edition.

The Essence of Discrete Mathematics
The Essence of Discrete Mathematics

Author: Neville Dean

Publisher:

Published: 1997

Total Pages: 212

ISBN-13: 9780133459432

DOWNLOAD EBOOK

Presenting a gentle introduction to all the basics of discrete mathematics, this book introduces sets, propositional logic, predicate logic, and mathematical models. It discusses relations, including homogeneous relations.

Journey into Discrete Mathematics
Journey into Discrete Mathematics

Author: Owen D. Byer

Publisher: American Mathematical Soc.

Published: 2018-11-13

Total Pages: 402

ISBN-13: 1470446960

DOWNLOAD EBOOK

Journey into Discrete Mathematics is designed for use in a first course in mathematical abstraction for early-career undergraduate mathematics majors. The important ideas of discrete mathematics are included—logic, sets, proof writing, relations, counting, number theory, and graph theory—in a manner that promotes development of a mathematical mindset and prepares students for further study. While the treatment is designed to prepare the student reader for the mathematics major, the book remains attractive and appealing to students of computer science and other problem-solving disciplines. The exposition is exquisite and engaging and features detailed descriptions of the thought processes that one might follow to attack the problems of mathematics. The problems are appealing and vary widely in depth and difficulty. Careful design of the book helps the student reader learn to think like a mathematician through the exposition and the problems provided. Several of the core topics, including counting, number theory, and graph theory, are visited twice: once in an introductory manner and then again in a later chapter with more advanced concepts and with a deeper perspective. Owen D. Byer and Deirdre L. Smeltzer are both Professors of Mathematics at Eastern Mennonite University. Kenneth L. Wantz is Professor of Mathematics at Regent University. Collectively the authors have specialized expertise and research publications ranging widely over discrete mathematics and have over fifty semesters of combined experience in teaching this subject.

Introduction to Discrete Mathematics via Logic and Proof
Introduction to Discrete Mathematics via Logic and Proof

Author: Calvin Jongsma

Publisher: Springer Nature

Published: 2019-11-08

Total Pages: 482

ISBN-13: 3030253589

DOWNLOAD EBOOK

This textbook introduces discrete mathematics by emphasizing the importance of reading and writing proofs. Because it begins by carefully establishing a familiarity with mathematical logic and proof, this approach suits not only a discrete mathematics course, but can also function as a transition to proof. Its unique, deductive perspective on mathematical logic provides students with the tools to more deeply understand mathematical methodology—an approach that the author has successfully classroom tested for decades. Chapters are helpfully organized so that, as they escalate in complexity, their underlying connections are easily identifiable. Mathematical logic and proofs are first introduced before moving onto more complex topics in discrete mathematics. Some of these topics include: Mathematical and structural induction Set theory Combinatorics Functions, relations, and ordered sets Boolean algebra and Boolean functions Graph theory Introduction to Discrete Mathematics via Logic and Proof will suit intermediate undergraduates majoring in mathematics, computer science, engineering, and related subjects with no formal prerequisites beyond a background in secondary mathematics.