Hoho, what is your discrete math like? Approximation methods galore?
it’s fairly straightforward stuff, I don’t think we’ve done any approximation methods. Mostly just like, general math things that are familiar (like high school stuff) but in much more depth and actual mathy terminology. Let’s see… going through my notes, so far it’s:
- sets
- process of mathematical induction
- divisibility
- definition of functions (onto, bijections, inverses)
- directed graphs and properties (partial order, total order, equivalence classes)
- algebraic structures (semigroups, monoids, groups)
- euclidean algorithm for gcd and related things (invertibility etc)
- Euler’s theorem
- Chinese remainder theorem
- pseudorandom numbers
- boolean algebras
- stuff related to digital logic design i.e. disjunctive normal form, logic gates, etc