Discrete mathematics. Elementary and beyond
✍ Scribed by LaМЃszloМЃ LovaМЃsz; J PelikaМЃn; K Vsztergombi
- Publisher
- Springer
- Year
- 2003
- Tongue
- English
- Leaves
- 301
- Series
- Undergraduate texts in mathematics
- Category
- Library
No coin nor oath required. For personal study only.
✦ Synopsis
Presents a novel design that allows for a great deal of customization, which many current methods fail to include; Details a flexible, comprehensive design that can be easily extended when necessary; Proven results: the versatility of the design has been effectively tested in implementations ranging from microcontrollers to supercomputers 1. Let's count -- 2. Combinatorial tools -- 3. Binomial coefficients and Pascal's triangle -- 4. Fibonacci numbers -- 5. Combinatorial probability -- 6. Integers, divisors, and primes -- 7. Graphs -- 8. Trees -- 9. Finding the optimum -- 10. Matchings in graphs -- 11. Combinatorics in geometry -- 12. Euler's formula -- 13. Coloring maps and graphs -- 14. Finite geometries, codes, Latin squares, and other pretty creatures -- 15. A glimpse of complexity and cryptography -- 16. Answers to exercises
📜 SIMILAR VOLUMES
Aimed at undergraduate mathematics and computer science students, this book is an excellent introduction to a lot of problems of discrete mathematics. It discusses a number of selected results and methods, mostly from areas of combinatorics and graph theory, and it uses proofs and problem solving to
Aimed at undergraduate mathematics and computer science students, this book is an excellent introduction to a lot of problems of discrete mathematics. It discusses a number of selected results and methods, mostly from areas of combinatorics and graph theory, and it uses proofs and problem solving to
Aimed at undergraduate mathematics and computer science students, this book is an excellent introduction to a lot of problems of discrete mathematics. It discusses a number of selected results and methods, mostly from areas of combinatorics and graph theory, and it uses proofs and problem solving to