Mathematical logic and proof, mathematical induction, counting methods, recurrence relations, algorithms and complexity, graph theory and graph algorithms.
Real numbers, topology of Euclidean spaces, Cauchy sequences, completeness, continuity and compactness, uniform continuity, series of functions, Fourier series
This course develops in the theme of "Arithmetic congruence, and abstract algebraic structures." There will be a very strong emphasis on theory and proofs.
Primes and unique factorization, congruences, Chinese remainder theorem, Diophantine equations, Diophantine approximations, quadratic reciprocity. Applications such as fast multiplication, factorization and encryption.
Problems from the life sciences and the mathematical methods for solving them are presented. The underlying biological and mathematical principles and the interrelationships are emphasized.
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).
A study of the linear programming problem, including the simplex method, duality, and sensitivity analysis with applications to matrix games, integer programming and networks.
Introduction to algebraic methods in topology. Includes homotopy, the fundamental group, covering spaces, simplicial complexes. Applications to fixed point theory and group theory.
