Cantitate/Preț
Produs
Total produse
Vezi coșul
Discrete Mathematics: An Open Introduction de Oscar Levin

Discrete Mathematics: An Open Introduction: Discrete Mathematics and Its Applications

Autor Oscar Levin
en Limba Engleză Paperback – 4 mar 2025
Discrete Mathematics: An Open Introduction, Fourth Edition aims to provide an introduction to select topics in discrete mathematics at a level appropriate for first or second year undergraduate math and computer science majors, especially those who intend to teach middle and high school mathematics. 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.

Features
  • Uses problem-oriented and inquiry-based methods to teach the concepts.
  • Suitable for undergraduates in mathematics and computer science.

New to the 4th edition
  • Large scale restructuring.
  • Contains more than 750 exercises and examples.
  • New sections on probability, relations, and discrete structures and their proofs.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 10074 lei  6-8 săpt.
  12th Media Services – 16 aug 2016 10074 lei  6-8 săpt.
  – 15148 lei  6-8 săpt.

Din seria Discrete Mathematics and Its Applications

Preț: 31398 lei

Preț vechi: 39081 lei
-20% Nou

Puncte Express: 471
Preț estimativ în valută:
6011€ • 6185$ • 5067£

Carte nepublicată încă


Wish list
Gift list
Am citit!
Adaugă în listă
Doresc să fiu notificat când acest titlu va fi disponibil:
Trimite
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781032966168
ISBN-10: 1032966165
Pagini: 480
Ilustrații: 394
Dimensiuni: 178 x 254 mm
Ediția:4
Editura: CRC Press
Colecția Chapman and Hall/CRC
Seria Discrete Mathematics and Its Applications

Public țintă

Undergraduate Advanced and Undergraduate Core

Cuprins

0. Introduction and Preliminaries. 0.1. What is Discrete Mathematics?. 0.2. Discrete Structures. 1. Logic and Proofs. 1.1. Mathematical Statements. 1.2. Implications. 1.3. Rules of Logic. 1.4. Proofs. 1.5. Proofs about Discrete Structures. 1.6. Chapter Summary. 2. Graph Theory. 2.1. Problems and Definitions. 2.2. Trees. 2.3. Planar Graphs. 2.4. Euler Trails and Circuits. 2.5. Coloring. 2.6. Relations and Graphs. 2.7. Matching in Bipartite Graphs. 2.8. Chapter Summary. 3. Counting. 3.1. Pascal’s Arithmetical Triangle. 3.2. Combining Outcomes. 3.3. Non-Disjoint Outcomes. 3.4. Combinations and Permutations. 3.5. Counting Multisets. 3.6. Combinatorial Proofs. 3.7. Applications to Probability. 3.8. Advanced Counting Using PIE. 3.9. Chapter Summary. 4. Sequences. 4.1. Describing Sequences. 4.2. Rate of Growth. 4.3. Polynomial Sequences. 4.4. Exponential Sequences. 4.5. Proof by Induction. 4.6. Strong Induction. 4.7. Chapter Summary. 5. Discrete Structures Revisited. 5.1. Sets. 5.2. Functions. 6. Additional Topics. 6.1.  Generating Functions. 6.2. Introduction to Number Theory. 

Notă biografică

Oscar Levin is a professor at the University of Northern Colorado. He has taught mathematics and computer science at the college level for over 15 years and has won multiple teaching awards. His research studies the interaction between logic and graph theory, and he is an active developer on the PreTeXt project, an open-source authoring system for writing accessible scholarly documents.  He earned his Ph.D. in mathematical logic from the University of Connecticut in 2009.
Outside of the classroom, Oscar enjoys entertaining his two brilliant daughters with jaw-dropping magic tricks and hilarious Dad jokes, hiking with his amazing wife, and coming in second-to-last in local pinball tournaments. 

Descriere

This book aims to provide an introduction to select topics in discrete mathematics at a level appropriate for first or second year undergraduate math and computer science majors. This course serves both as a survey of the topics in discrete math and as the “bridge” course for math majors.