Discrete mathematics
This book gives an introduction to discrete mathematics for beginning undergraduates and starts with a chapter on the rules of mathematical reasoning. This book begins with a presentation of the rules of logic as used in mathematics where many examples of formal and informal proofs are given. Wit...
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
New York, NY :
Springer New York
[20..].
Cham : Springer Nature |
| Édition: | 1st ed. 2011. |
| Collection: | Universitext
|
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Description d'après consultation du 11 mai 2012 Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Discrete mathematics, Jean Gallier, New York, Springer, 2011, 1 vol. (XIII-465), Universitext, 978-1-441-98046-5 • Discrete mathematics, Jean Gallier, New York, Springer, 2011, 1 vol. (XIII-465), Universitext, 978-1-441-98046-5 • Discrete Mathematics, Texte imprimé, 9781441980489 • Discrete Mathematics, Texte imprimé, 9781493999859 |
| Résumé: | This book gives an introduction to discrete mathematics for beginning undergraduates and starts with a chapter on the rules of mathematical reasoning. This 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. The 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. |
|---|---|
| Description: | Description d'après consultation du 11 mai 2012 Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Bibliographie: | Bibliogr. p. 447 Index p. 449-465 |
| ISBN: | 9781441980472 |
| ISSN: | 2191-6675 |
| Accès: | Accès en ligne pour les établissements français bénéficiaires des licences nationales Accès soumis à abonnement pour tout autre établissement Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 |