Mathematical logic and proof, mathematical induction, counting methods, recurrence relations, algorithms and complexity, graph theory and graph algorithms.
An introduction to proofs in advanced mathematics, intended as a transition to upper division courses including MATH 4107, 4150 and 4317. Fundamentals of mathematical abstraction including sets, logic, equivalence relations, and functions. Thorough development of the basic proof techniques: direct, contrapositive, existence, contradiction, and induction. Introduction to proofs in analysis and algebra.
Introduction to numerical algorithms for some basic problems in computational mathematics. Discussion of both implementation issues and error analysis. Crosslisted with CX 4640 (formerly CS 4642).
Real numbers, topology of Euclidean spaces, Cauchy sequences, completeness, continuity and compactness, uniform continuity, series of functions, Fourier series
Linear algebra in R^n, standard Euclidean inner product in R^n, general linear spaces, general inner product spaces, least squares, determinants, eigenvalues and eigenvectors, symmetric matrices.
The measurement and quantification of information. These ideas are applied to the probabilistic analysis of the transmission of information over a channel along which random distortion of the message occurs.