$142.182,00
10% de descuento pagando con Transferencia
Ver más detalles
Descripcion
Indice
Autores
Muestra
Ficha Técnica
Descripción

Discrete Mathematics provides key concepts and a solid, rigorous foundation in mathematical reasoning. Appropriate for undergraduate as well as a starting point for more advanced class, the resource offers a logical progression through key topics without assuming any background in algebra or computational skills and without duplicating what they will learn in higher level courses. The book is designed as an accessible introduction for students in mathematics or computer science as it explores questions that test the understanding of proof strategies, such as mathematical induction.

For students interested to dive into this subject, the text offers a rigorous introduction to mathematical thought through useful examples and exercises.

  • Provides a class-tested reference used on multiple years
  • Includes many exercises and helpful guided solutions to aid student comprehension and practice
  • Appropriate for undergraduate courses and for students with no background in algebra or computational skills

1. Title of Book - p. i 2. Cover image - p. i 3. Title page - p. ii 4. Table of Contents - p. iii 5. Copyright - p. iii 6. Dedication - p. pageiv 7. Preface - p. xi 8. Chapter 1. Discreteness - p. 1 9. Chapter 2. Basic set theory - p. 27 10. Chapter 3. Working with finite sets - p. 51 11. Chapter 4. Formal logic - p. 73 12. Chapter 5. Induction - p. 93 13. Chapter 6. Set structures - p. 115 14. Chapter 7. Elementary number theory - p. 143 15. Chapter 8. Codes and cyphers - p. 163 16. Chapter 9. Graphs and trees - p. 181 17. Selected answers and solutions - p. 213 18. Index - p. 221

Descripcion
Descripción

Discrete Mathematics provides key concepts and a solid, rigorous foundation in mathematical reasoning. Appropriate for undergraduate as well as a starting point for more advanced class, the resource offers a logical progression through key topics without assuming any background in algebra or computational skills and without duplicating what they will learn in higher level courses. The book is designed as an accessible introduction for students in mathematics or computer science as it explores questions that test the understanding of proof strategies, such as mathematical induction.

For students interested to dive into this subject, the text offers a rigorous introduction to mathematical thought through useful examples and exercises.

  • Provides a class-tested reference used on multiple years
  • Includes many exercises and helpful guided solutions to aid student comprehension and practice
  • Appropriate for undergraduate courses and for students with no background in algebra or computational skills

1. Title of Book - p. i 2. Cover image - p. i 3. Title page - p. ii 4. Table of Contents - p. iii 5. Copyright - p. iii 6. Dedication - p. pageiv 7. Preface - p. xi 8. Chapter 1. Discreteness - p. 1 9. Chapter 2. Basic set theory - p. 27 10. Chapter 3. Working with finite sets - p. 51 11. Chapter 4. Formal logic - p. 73 12. Chapter 5. Induction - p. 93 13. Chapter 6. Set structures - p. 115 14. Chapter 7. Elementary number theory - p. 143 15. Chapter 8. Codes and cyphers - p. 163 16. Chapter 9. Graphs and trees - p. 181 17. Selected answers and solutions - p. 213 18. Index - p. 221

Indice
Autores
Muestra
Ficha Técnica