{"product_id":"discrete-mathematics-paperback","title":"Discrete Mathematics - Paperback","description":"\u003cp\u003eby \u003cb\u003eJean Gallier\u003c\/b\u003e (Author)\u003c\/p\u003e\u003cp\u003eThis books gives an introduction to discrete mathematics for beginning undergraduates. One of original features of this book is that it begins with a presentation of the rules of logic as used in mathematics. Many examples of formal and informal proofs are given. With this logical framework firmly in place, the book describes the major axioms of set theory and introduces the natural numbers. The rest of the book is more standard. It deals with functions and relations, directed and undirected graphs, and an introduction to combinatorics. There is a section on public key cryptography and RSA, with complete proofs of Fermat's little theorem and the correctness of the RSA scheme, as well as explicit algorithms to perform modular arithmetic. The last chapter provides more graph theory. Eulerian and Hamiltonian cycles are discussed. Then, we study flows and tensions and state and prove the max flow min-cut theorem. We also discuss matchings, covering, bipartite graphs.\u003c\/p\u003e\u003ch3\u003eBack Jacket\u003c\/h3\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003eThis book gives an introduction to discrete mathematics for beginning undergraduates and starts with a chapter on the rules of mathematical reasoning. \u003c\/p\u003e\u003cp\u003e \u003c\/p\u003e\u003cp\u003eThis book begins with a presentation of the rules of logic as used in mathematics where many examples of formal and informal proofs are given. With this logical framework firmly in place, the book describes the major axioms of set theory and introduces the natural numbers. The rest of the book deals with functions and relations, directed and undirected graphs and an introduction to combinatorics, partial orders and complete induction. There is a section on public key cryptography and RSA, with complete proofs of Fermat's little theorem and the correctness of the RSA scheme, as well as explicit algorithms to perform modular arithmetic. The last chapter provides more graph theory where Eulerian and Hamiltonian cycles are discussed. This book also includes network flows, matchings, covering, bipartite graphs, planar graphs and state the graph minor theorem of Seymour and Robertson. \u003c\/p\u003e\u003cp\u003e \u003c\/p\u003e\u003cp\u003eThe book is highly illustrated and each chapter ends with a list of problems of varying difficulty. Undergraduates in mathematics and computer science will find this book useful. \u003c\/p\u003e\u003cp\u003e \u003c\/p\u003e\u003ch3\u003eAuthor Biography\u003c\/h3\u003e\u003cp\u003eJean Gallier is a Professor in the Computer and Information Science Department, School of Engineering and Applied Science at the University of Pennsylvania.\u003c\/p\u003e\u003cdiv\u003e\n\u003cstrong\u003eNumber of Pages:\u003c\/strong\u003e 466\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003eDimensions:\u003c\/strong\u003e 1.1 x 9 x 6.1 IN\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003eIllustrated:\u003c\/strong\u003e Yes\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003ePublication Date:\u003c\/strong\u003e January 25, 2011\u003c\/div\u003e","brand":"Books by splitShops","offers":[{"title":"Default Title","offer_id":42717918265407,"sku":"9781441980465","price":129.58,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0105\/8226\/1823\/files\/ed5377b87769f9f43e7047d8cb0d0796.webp?v=1765080092","url":"https:\/\/dhl-adrianne.myshopify.com\/products\/discrete-mathematics-paperback","provider":"BBB","version":"1.0","type":"link"}