کتاب مقدمه‌ای بر ریاضیات گسسته

کتاب مقدمه ای بر ریاضیات گسسته

Discrete Mathematics: An Open Introduction

• ناشر : Independently published
• تاریخ انتشار : 2018
• نسخه : 3
• زبان : انگلیسی
• تعداد صفحات: 414
• نوع فایل: PDF

لینک‌هایی که باید ببینید:

• جهت مشاهده سایر کتاب‌ها کلیک کنید
• برای مشاوره رایگان کنکور (در تلگرام) پیام بدهید.
• .برای مشاهده ویدئو‌های آموزش و نکته و تست کنکور کامپیوتر کلیک کنید

خلاصه کتاب مقدمه ای بر ریاضیات گسسته:

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.

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 –
This third edition brings improved exposition, a new section on trees, and a bunch of new and improved exercises. For a complete list of changes, and to view the free electronic version of the text, visit the book’s website at discrete.openmathbooks.org

سرفصل‌ها:

Introduction and Preliminaries 
What is Discrete Mathematics?
Mathematical Statements
Sets
 Counting
Additive and Multiplicative Principles
Binomial Coefficients
Combinations and Permutations
Combinatorial Proofs
Stars and Bars
Advanced Counting Using PIE
Chapter Summary
Sequences
Definitions
Arithmetic and Geometric Sequences
Polynomial Fitting
Solving Recurrence Relations
Induction
Chapter Summary
Symbolic Logic and Proofs
Propositional Logic
Proofs
Chapter Summary
 Graph Theory
Definitions
Trees
Planar Graphs
Coloring
Euler Paths and Circuits
Matching in Bipartite Graphs
Chapter Summary
 Additional Topics
Generating Functions
Introduction to Number Theory