Skip to content
Primes and unique factorization, congruences, Chinese remainder theorem, Diophantine equations, Diophantine approximations, quadratic reciprocity. Applications such as fast multiplication, factorization and encryption.
Continuation of Abstract Algebra I, with emphasis on Galois theory, modules, polynomial fields, and the theory of linear associative algebra.
This course develops in the theme of "Arithmetic congruence, and abstract algebraic structures." There will be a very strong emphasis on theory and proofs.
The second of a two course sequence of faculty-directed independent research culminating in the writing of a senior thesis and its presentation.
The first of a two course sequence of faculty-directed independent research culminating in the writing of a senior thesis and its presentation.
Combinatorial problem-solving techniques including the use of generating functions, recurrence relations, Polya theory, combinatorial designs, Ramsey theory, matroids, and asymptotic analysis.
This course is a problem oriented introduction to the basic concepts of probability and statistics, providing a foundation for applications and further study.
Elementary combinatorial techniques used in discrete problem solving: counting methods, solving linear recurrences, graph and network models, related algorithms, and combinatorial designs.
Functions, the derivative, applications of the derivative, techniques of differentiation, integration, applications of integration to probability and statistics, multidimensional calculus.
Linear equations, matrices, linear programming, sets and counting, probability and statistics.
Georgia Institute of TechnologyNorth Avenue, Atlanta, GA 30332Phone: 404-894-2000