โ Discrete Mathematics learning pathDiscrete Mathematics ยท Module 10 of 10
Algebraic structures and number theory
Groups, modular arithmetic and their uses.
๐ Key ideas
- Modular arithmetic: a mod n is the remainder; clocks are arithmetic mod 12.
- GCD by Euclid's algorithm: gcd(a, b) = gcd(b, a mod b).
- A group has closure, associativity, identity and inverses; examples: integers under addition.
- Primes and modular exponentiation underpin RSA encryption.
- Boolean algebra and lattices connect discrete maths to digital logic.
๐ก Real-life example: Modular arithmetic is clock arithmetic: 9 o'clock plus 5 hours is 2 o'clock, because 14 mod 12 = 2.
ModuloRemainder after division
Euclid's algorithmEfficient method for the GCD
GroupSet with an operation satisfying four axioms
RSAPublic-key cryptosystem based on primes