Skip to content
Real numbers, topology of Euclidean spaces, Cauchy sequences, completeness, continuity and compactness, uniform continuity, series of functions, Fourier series
Sampling distributions, Normal, t, chi-square and F distributions. Moment generating function methods, Bayesian estimation and introduction to hypothesis testing
Simple random walk and the theory of discrete time Markov chains
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.
The fundamentals of graph theory: trees, connectivity, Euler torus, Hamilton cycles, matchings, colorings and Ramsey theory.
The topics covered parallel those of MATH 3215, with a more rigorous and intensive treatment. Credit is not allowed for both MATH 3215 and 3225.
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.
Georgia Institute of TechnologyNorth Avenue, Atlanta, GA 30332Phone: 404-894-2000