· Sets, functions; propositional logic, predicate logic, rules
of inference, proof techniques.
· Pigeonhole principle, basic and generalized permutations and
combinations, binomial coefficients, inclusion-exclusion principle.
· Probability theory, Bayes theorem, expectation, variance,
random variables.
· Modular arithmetic, Euclid’s division theorem,
multiplicative inverse, divisibility, RSA cryptosystem, Chinese remainder
theorem.
· Mathematical induction, strong induction and well-ordering
property, recursion, recurrence relations.
· Graph representation, isomorphism, connectivity, Euler paths,
Hamilton paths, planarity,.
· Groups, rings, integral domains, division rings, fields and
Galois fields.
· COMP 2711
· MATH 2343
· Gade A- or above in
MATH 1014 (Calculus II); or MATH 1020 (Accelerated Calculus); or MATH 1024
(Honors Calculus II)