Georgia Institute of Technology College of Sciences

Hypothesis testing, likelihood ratio tests, nonparametric tests, bivariate and multivariate normal distributions

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.

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.

MATH 3215, MATH 3235, and MATH 3670 are mutually exclusive; students may not hold credit for more than one of these courses. 

Elementary combinatorial techniques and proof methods used in discrete problem solving.

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.

Methods for obtaining numerical and analytic solutions of elementary differential equations. Applications are also discussed with an emphasis on modeling.