|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Limits and continuity in metric spaces, sequences and series, differentiation and Riemann-Stieltjes integration, uniform convergence, power series and Fourier series, differentiation of vector functions, implicit and inverse function theorems. Credit not allowed for both 211 and 311. (D)
-
3.00 Credits
Analytic functions, Cauchy's theorem and its consequences, power series, and residue calculus. Credit not allowed for both 303 and 317. P-MTH 113. (D)
-
3.00 Credits
Introduction to modern abstract algebra through the study of groups, rings, integral domains, and fields. P-MTH 121. (D)
-
3.00 Credits
Continuation of modern abstract algebra through the study of additional properties of groups, rings, and fields. P-MTH 321. (D)
-
3.00 Credits
Thorough treatment of vector spaces and linear transformations over an arbitrary field, canonical forms, inner product spaces, and linear groups. P-MTH 121 and 321. (D)
-
3.00 Credits
Numerical methods for solving matrix and related problems in science and engineering. Topics include systems of linear equations, least squares methods, and eigenvalue computations. Beginning knowledge of a high-level programming language is required. Credit not allowed for both 326 and CSC 352. P-MTH 112 and MTH 121 or 205. (D)
-
3.00 Credits
Introduction to axiomatic geometry including a comparison of Euclidean and non-Euclidean geometries. (D)
-
3.00 Credits
Introduction to the theory of curves and surfaces in two and three dimensional space, including such topics as curvature, geodesics, and minimal surfaces. P-MTH 113. (D)
-
3.00 Credits
Properties of integers, including congruences, primitive roots, quadratic residues, perfect numbers, Pythagorean triples, sums of squares, continued fractions, Fermat's Last Theorem, and the Prime Number Theorem. (D)
-
3.00 Credits
Paths, circuits, trees, planar graphs, spanning trees, graph coloring, perfect graphs, Ramsey theory, directed graphs, enumeration of graphs, and graph theoretic algorithms. (D)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|