Discrete Mathematics An Open Introduction

Discrete Mathematics: An Open Introduction is a free, open source textbook appropriate for a first or second year undergraduate course for math and computer science majors. The book is especially well-suited for courses that incorporate inquiry-based learning. Since Spring 2013, the book has been us...

Cijeli opis

Spremljeno u:
Bibliografski detalji
Glavni autor: Levin, Oscar (Autor)
Format: Elektronički e-knjiga
Jezik:engleski
Izdano: Greeley, CO Oscar Levin [2024]
Izdanje:4th Edition
Serija:Open textbook library.
Teme:
Online pristup:Access online version
Oznake: Dodaj oznaku
Bez oznaka, Budi prvi tko označuje ovaj zapis!

MARC

LEADER 00000nam a2200000 i 4500
001 OTLid0000394
003 MnU
005 20260518120351.0
006 m o d s
007 cr
008 180907s2024 mnu o 0 0 eng d
020 |a 1534970746 
040 |a MnU  |b eng  |c MnU 
050 4 |a QA37.3 
050 4 |a QA1 
100 1 |a Levin, Oscar  |e author 
245 0 0 |a Discrete Mathematics  |b An Open Introduction  |c Oscar Levin 
250 |a 4th Edition 
264 2 |a Minneapolis, MN  |b Open Textbook Library 
264 1 |a Greeley, CO  |b Oscar Levin  |c [2024] 
264 4 |c ©2024. 
300 |a 1 online resource 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
341 0 |a textual  |b unknown  |2 sapdv 
490 0 |a Open textbook library. 
505 0 |a 0 Introduction and Preliminaries 1 -- 0.1 What is Discrete Mathematics? -- 0.2 Mathematical Statements -- 0.3 Sets -- 1 Counting -- 1.1 Additive and Multiplicative Principles -- 1.2 Binomial Coefficients -- 1.3 Combinations and Permutations -- 1.4 Combinatorial Proofs -- 1.5 Stars and Bars -- 1.6 Advanced Counting Using PIE -- 1.7 Chapter Summary -- 2 Sequences -- 2.1 Definitions -- 2.2 Arithmetic and Geometric Sequences -- 2.3 Polynomial Fitting -- 2.4 Solving Recurrence Relations -- 2.5 Induction -- 2.6 Chapter Summary -- 3 Symbolic Logic and Proofs -- 3.1 Propositional Logic -- 3.2 Proofs -- 3.3 Chapter Summary -- 4 Graph Theory -- 4.1 Definitions -- 4.2 Trees -- 4.3 Planar Graphs -- 4.4 Coloring -- 4.5 Euler Paths and Circuits -- 4.6 Matching in Bipartite Graphs -- 4.7 Chapter Summary -- 5 Additional Topics -- 5.1 Generating Functions -- 5.2 Introduction to Number Theory 
520 0 |a Discrete Mathematics: An Open Introduction is a free, open source textbook appropriate for a first or second year undergraduate course for math and computer science majors. The book is especially well-suited for courses that incorporate inquiry-based learning. Since Spring 2013, the book has been used as the primary textbook or a supplemental resource at more than 200 colleges and universities around the world (see the partial adoptions list). After many years of development, I am pleased to announce that the 4th edition of Discrete Mathematics: an Open Introduction is now available, here and on Runestone Academy. The new edition brings many improvements and a new organization of content. In particular, the book now starts with logic and proofs, then practices those proofs with graph theory. The second half of the book contains material on counting (with a new "application to probability" section) and sequences. Over the last few years, I have found that students have more success with this arrangement. There is also a stronger emphasis on discrete structures, which should make the book more useful for students in computer science, while still focusing on understanding mathematical concepts essential for math majors and future math teachers. 
542 1 |f Attribution-NonCommercial-ShareAlike 
546 |a In English. 
588 0 |a Description based on print resource 
650 0 |a Mathematics  |v Textbooks 
710 2 |a Open Textbook Library  |e distributor 
856 4 0 |u https://open.umn.edu/opentextbooks/textbooks/394  |z Access online version