Mathematics
Discrete Mathematics
The mathematics of computing, from logic and proof to counting, graphs and machines
AI generated by Nikhil Kumar Rajput
14 chapters
Contents¶
Front matter
Part I · Logic and proof
Chapter 1: Propositional Logic
Chapter 3: Methods of Proof
Part II · Structures
Part III · Counting
Part IV · Number theory
Chapter 10: Number Theory and Cryptography
- 10.1 Divisibility
- 10.2 Primes
- 10.3 Greatest common divisors and Euclid's algorithm
- 10.4 Bézout's identity and unique factorisation
- 10.5 Modular arithmetic
- 10.6 Inverses, linear congruences and the Chinese remainder theorem
- 10.7 Fermat's little theorem
- 10.8 The RSA cryptosystem
- 10.9 Summary
- 10.10 Exercises
- 10.11 Quiz
Part V · Graphs
Chapter 11: Graphs
Part VI · Computation
Back matter
About this book¶
A first course in discrete mathematics for students of computing and mathematics: propositional and predicate logic, methods of proof, sets, functions and relations, induction and recursion, counting, discrete probability, recurrences and generating functions, number theory with RSA, graphs and trees, Boolean algebra and logic circuits, and finite automata. Every chapter has definitions, theorems with proofs, worked examples, exercises with answers and a quiz.