103 courses with the subject MTH, each shown exactly as we captured it from the college's catalog, with every element we hold. Where the wording looks broken, that is our reading of the catalog, not the college's text.
A review of the essentials of algebra and trigonometry in a guided laboratory setting. Admission by permission only. Not to be counted towards any major or minor offered by the department. Pass/Fail only.
A review of the essentials of algebra and trigonometry. Admission by permission only (generally, a student must have taken fewer than three years of high school mathematics to be eligible for admission). Not to be counted towards any major or minor offered by the department.
A review of the essentials of algebra and trigonometry in a guided laboratory setting. Admission by permission only. Not to be counted towards any major or minor offered by the department. Pass/Fail only. C-MTH 111.
Fall semester of a 2-semester sequence. Functions, limits, continuity, derivatives and their applications. Additional topics may vary by instructor. Calculus placement exam and permission of instructor are required. Intended for first-year students seeking additional support in precalculus integrated with calculus topics in preparation for majors/ minors in Div. IV, Div. V, pre-health, or business. Course to be followed by MTH 111 in the spring. Course does not include credit toward a major in the department. P - Prerequisite override required. (QR)
An introduction to mathematical reasoning and problem solving. Topics vary by instructor and may include one or more of the following: knot theory, Euclidean and non-Euclidean geometry, set theory, cryptography, discrete models, number theory, discrete mathematics, chaos theory, probability, and MAPLE programming. Lab. (D, QR)
Functions of a real variable, trigonometric, exponential and logarithmic functions, limits, continuity, differentiation, applications of derivatives, indeterminate forms, introduction to integration, the fundamental theorem of calculus. Lab. (D, QR)
Techniques of integration, applications of integration, improper integrals, sequences, Taylor's formula, and infinite series, including power series. Lab. P-MTH 111 or prerequisite override required. (D, QR)
The calculus of vector functions, including geometry of Euclidean space, differentiation, extrema, line integrals, multiple integrals, and Green's, Stokes', and divergence theorems. Lab. P-MTH 112 or prerequisite override required. (D, QR)
Introduction to various topics in discrete mathematics applicable to computer science including sets, relations, Boolean algebra, propositional logic, functions, computability, proof techniques, graph theory, and elementary combinatorics. Lab. (D, QR)
Vectors, linear transformations and matrices, the invertible matrix theorem, determinants, eigenvalues and eigenvectors, and orthogonal projections. Credit not allowed for both MTH 121 and 205. (D, QR)
Weekly seminar designed for students who wish to participate in mathematical competition such as the annual Putnam examination. Not to be counted toward any major or minor offered by the department. May be repeated for credit. Pass/Fail only.
A survey of how mathematical tools relate to various social justice issues. Topics include fairly drawing electoral districts, determining income subsidies to combat evictions, and assessing the impacts of industrial agriculture. Also explores how certain applications reinforce existing systems of oppression and present new ethical dilemmas. Not to be counted toward any major or minor offered by the department. Pass/Fail only.
A course for first- and second-year students interested in an early research experience in mathematics. Students will participate in introductory research projects while developing skills for success. Not to be counted toward any major or minor offered by the department. Pass/ Fail only. P - Prerequisite override required.
Specific topics covered include: vector algebra, solving linear systems of equations, rank, vector spaces, determinants, eigenvalues, linear transformations, first order differential equations, second order linear ordinary differential equations, and power series solutions to differential equations. Credit not allowed for both MTH 205 and MTH 251 or for both MTH 205 and MTH 121. For the purpose of grade replacement, a student may either retake MTH 205 or may take the combination of MTH 121 and MTH 251. P-MTH 112 or prerequisite override required. (D)
Functions between Euclidean spaces, multivariable limits, differentiation, change of variables, line and surface integrals, vector fields, integration theorems for vector fields, Implicit & Inverse Function Theorems, Contraction Mapping Theorem, applications, other selected topics from analysis in multiple dimensions. P-MTH 113, and MTH 121 or MTH 205.
The development of set theory, geometry, point set topology or other mathematical system from either an axiomatic or inquiry-based learning perspective. Problem solving, mathematical logic, and rigorous proof writing are emphasized. With prior departmental permission, this course may be repeated when topics differ substantially. P- MTH 117 or prerequisite override required. (QR)
A continuation of the study of linear algebra and its applications over the real and complex numbers to include vector spaces, the spectral theorem, and the singular value decomposition. Additional topics may include quadratic forms, Gershgorin's circle theorem, analytic functions of matrices, pseudoinverses, and other topics chosen by the instructor. P- MTH 112 and (MTH 121 or MTH 205) or prerequisite override required. C-
Essential concepts in coding theory and cryptography. Congruences, cryptosystems, public key, Huffman codes, information theory, and other coding methods. P - MTH 117 or prerequisite override required.
degree may be counted toward only one major.
Mathematical models and optimization techniques. Studies in linear programming, simplex method, duality, sensitivity analysis, and other selected topics. P-(MTH 111 or MTH 112 or MTH 113) and (MTH 121 or
Unconstrained and constrained optimization problems; Lagrange multiplier methods; second-order sufficient conditions; inequality constraints; and Karush-Kuhn-Tucker conditions. P-MTH 113 and (MTH 121 or MTH 205) or prerequisite override required.
Topics in mathematics not considered in regular courses or which continue study begun in regular courses. Content varies. May be repeated for credit if topic varies.
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. Students are advised, but not required, to take at least one proof-oriented course beyond MTH 117 before taking MTH 311. P-MTH 113 and MTH 117 or prerequisite override required.
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. P-MTH 311 or prerequisite override required.
Analytic functions, Cauchy's theorem and its consequences, power series, and residue calculus. P-MTH 113 and MTH 117 or prerequisite override required.
Introduction to modern abstract algebra through the study of groups, rings, integral domains, and fields. Students are advised, but not required, to take at least one proof-oriented course beyond MTH 117 before taking MTH 321. P-MTH 117 and (MTH 121 or MTH 205) or prerequisite override required.
A continuation of modern abstract algebra through the study of additional properties of groups, rings, and fields. P-MTH 321 or prerequisite override required.
Thorough treatment of vector spaces and linear transformations over an arbitrary field, canonical forms, inner product spaces, and linear groups. P-MTH 321 or prerequisite override required.
Numerical methods for solving matrix and related problems in science and engineering using a high-level matrix-oriented language such as MATLAB. Topics will include systems of linear equations, least squares methods, and eigenvalue computations. Special emphasis given to applications. Credit not allowed for both MTH 326 and CSC 352. P-MTH 112 and MTH 121 or 205, or prerequisite override required.
An introduction to axiomatic geometry including a comparison of Euclidean and non-Euclidean geometries. P - MTH 117 or prerequisite override required.
Topics vary and may include knot theory, topological spaces, homeomorphisms, classification of surfaces, manifolds, Euler characteristic, and the fundamental group. P - MTH 117 or prerequisite override required.
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 or prerequisite override required.
Properties of integers, congruences, and prime numbers, with additional topics chosen from arithmetic functions, primitive roots, quadratic residues, Pythagorean triples, and sums of squares. P-MTH 117. (D)
A selection of number theory topics of recent interest. Some examples include elliptic curves, partitions, modular forms, the Riemann zeta function, and algebraic number theory. P-MTH 117.
Paths, circuits, trees, planar graphs, spanning trees, graph coloring, perfect graphs, Ramsey theory, directed graphs, enumeration of graphs, and graph theoretic algorithms. P-MTH 117 or prerequisite override required.
Enumeration techniques, generating functions, recurrence formulas, the principle of inclusion and exclusion, Polya theory, graph theory, combinatorial algorithms, partially ordered sets, designs, Ramsey theory, symmetric functions, and Schur functions. P-MTH 117 or prerequisite override required.
Enumeration techniques, generating functions, recurrence formulas, the principle of inclusion and exclusion, Polya theory, graph theory, combinatorial algorithms, partially ordered sets, designs, Ramsey theory, symmetric functions, and Schur functions. P-MTH 117 or prerequisite override required.
Introduction to the mathematical modeling, analysis and simulation of continuous processes using MATLAB, Mathematica or Maple. Topics include dimensional analysis, stability analysis, bifurcation theory, one-dimensional flows, phase plane analysis, index theory, limit cycles, chaotic dynamics, hyperbolic conservation laws and traveling waves. P-(MTH 121 and 251) or MTH 205 or prerequisite override required.
A detailed study of partial differential equations, including the heat, wave, and Laplace equations, using methods such as separation of variables, characteristics, Green's functions, and the maximum principle. P-MTH 113 and (MTH 205 or MTH 251) or prerequisite override required. Combined Bulletin 2026-2027 231
Introduction to probability models, Markov chains, Poisson processes and Markov decision processes. Applications will emphasize problems in business and management science. P-MTH 111 and MTH 121 or 205, or prerequisite override required.
Introduction to the theory of discrete dynamical systems as applied to disciplines such as biology and economics. Includes methods for finding explicit solutions, equilibrium and stability analysis, phase plane analysis, analysis of Markov chains, and bifurcation theory. P-MTH 112 and 121 or prerequisite override required.
Numerical computations on modern computer architectures; floating point arithmetic and round-off error. Programming in a scientific/ engineering language such as MATLAB, C, or FORTRAN. Algorithms and computer techniques for the solution of problems such as roots of functions, approximation, integration, systems of linear equations and least squares methods. Credit not allowed for both MTH 355 and CSC 355. P-MTH 112, MTH 121 or 205 or 206, or prerequisite override required.
Distributions of discrete and continuous random variables, sampling distributions. Covers much of the material on the syllabus for the first actuarial exam. Also listed as STA 310. P-MTH 112 or prerequisite override required.
A course in fundamental network theory concepts, including measures of network structure, community detection, clustering, and network modelling and inference. Topics also draw from recent advances in the analysis of networks and network data, as well as applications in economics, sociology, biology, computer science, and other areas. Also listed as STA 352. P-MTH 117 or MTH 121 or MTH 205, and one course in STA at the 200 level or above.
A survey of mathematical and statistical applications arising from problems in politics, social justice, or racial justice; and/or an examination of instances, present and historical, where mathematics and statistics function as a tool promoting inclusion or exclusion; and/or an exploration of mathematics and statistics as human endeavors and contributions from diverse populations. Topics vary by instructor. May not be counted toward any major or minor offered in the department. May be repeatable for credit with prior approval of the department. Pass/Fail only.
A course of independent study directed by a faculty advisor. By prearrangement. May be repeated for credit when covering new material. P-Prerequisite override required.
Topics in mathematics not considered in regular courses or which continue study begun in regular courses. Content varies. May be repeated for credit when covering new material.
Independent study or research directed by a faculty advisor by prearrangement with the advisor. P-Prerequisite override required.
Preparation of a paper, followed by a one-hour oral presentation based upon work in MTH 391.
Specific topics covered include: vector algebra, solving linear systems of equations, rank, vector spaces, determinants, eigenvalues, linear transformations, first order differential equations, second order linear ordinary differential equations, and power series solutions to differential equations. May not be used toward any graduate degree offered by the department.
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.
Analytic functions, Caughy's theorem and its consequences, power series, and residue calculus.
A thorough treatment of vector spaces and linear transformations over an arbitrary field, canonical forms. inner product spaces, and linear groups.
An introduction to numerical methods for solving matrix and related problems in science and engineering using a high-level matrix-oriented language such as MATLAB. Topics include systems of linear equations, least squares methods, and eigenvalue computations. Special emphasis is given to applications.
An introduction to axiomatic geometry including a comparison of Euclidean and non-Euclidean geometries.
Introduction to the theory of curves and surfaces in two and three dimensional space including such topics as curvature, geodesics, and minimal surfaces.
Course topics include properties of integers, congruences, and prime numbers, with additional topics chosen from arithmetic functions, primitive roots, quadratic residues, Pythagorean triples, and sums of squares.
Course topics include a selection of number-theory topics of recent interest. Some examples include elliptic curves, partitions, modular forms, the Riemann zeta function, and algebraic number theory.
Paths, circuits, trees, planar graphs, spanning trees, graph coloring, perfect graphs, Ramsey theory, directed graphs, enumeration of graphs and graph theoretic algorithms.
Enumeration techniques, generating functions, recurrence formulas, the principle of inclusion and exclusion, Polya theory, graph theory, combinatorial algorithms, partially ordered sets, designs, Ramsey theory, symmetric functions, and Schur functions.
Enumeration techniques, generating functions, recurrence formulas, the principle of inclusion and exclusion, Polya theory, graph theory, combinatorial algorithms, partially ordered sets, designs, Ramsey theory, symmetric functions, and Schur functions.
Introduction to the mathematical modeling, analysis and simulation of continuous processes using MATLAB, Mathematica or Maple. Topics include dimensional analysis, stability analysis, bifurcation theory, one-dimensional flows, phase plane analysis, index theory, limit cycles, chaotic dynamics, hyperbolic conservation laws and traveling waves.
A detailed study of partial differential equations, including the heat, wave, and Laplace equations, using methods such as separation of variables, characteristics, Green's functions, and the maximum principle.
Introduction to the theory of discrete dynamical systems as applied to disciplines such as biology and economics. Includes methods for finding explicit solutions, equilibrium and stability analysis, phase plane analysi analysis of Markov chains and bifurcation theory.
An introduction to numerical computations on modern computer architectures; floating point arithmetic and round-off error including programming in a scientific/engineering language such as MATLAB, Cor Fortran. Topics include algorithms and computer techniques for the solution of problems such as roots of functions, approximations, integration, systems of linear equations and least squares methods. Also listed as CSC 655.
Distributions of discrete and continuous random variables, sampling distributions. Covers much of the material on the syllabus for the first actuarial exam. This course is cross-listed as STA 610.
This course will cover derivation of point estimators, hypothesis testing, and confidence intervals using both maximum likelihood and Bayesian approaches. P-MTH 657 or POI.
A course of independent study directed by a faculty advisor. By prearrangement. May be repeated for credit.
Reading in mathematical topics to provide a foundational basis for more advanced study in a particular area. May not be used to satisfy any requirement in the MS degree with thesis. No more than three hours may be applied to the requirements for the MS degree without thesis. May be repeated for credit for a total of 3 hours.
Topics in mathematics that are not considered in regular courses. Content varies.
Students will participate in introductory research projects while developing skills for success. May not be used towards any degree offered by the department. Pass/Fail only. POI only.
An introduction to analysis on metric spaces and to calculus on Banach spaces with applications.
Measure and integration theory, elementary functional analysis, selected advanced topics in analysis.
Banach and Hilbert spaces, best approximations, linear operators and adjoints, Frechet derivatives and nonlinear optimization, fixed points and iterative methods. Applications to control theory, mathematical programming, and numerical analysis. e, MTH 718. Topics in Analysis. (3 h) Selected topics from functional analysis or analytic function theory.
Selected topics from functional analysis or analytic function theory.
Groups, rings, fields, extensions, Euclidean domains, polynomials, vector spaces, Galois theory.
s, Groups, rings, fields, extensions, Euclidean domains, polynomials, vector spaces, Galois theory.
Topics vary and may include algebraic coding theory, algebraic number theory, matrix theory, representation theory, non-commutative ring theory.
Point-set topology including topological spaces, continuity, connectedness, compactness, and metric spaces. Additional topics in topology may include classification of surface, algebraic topology, and knot theory.
Topics vary and may include knot theory, algebraic topology, differential topology, manifolds, and Riemannian geometry. May be repeated for credit. P - 731 or POI.
Topics vary and may include knot theory, non-Euclidean geometry, combinatorial topology, differential topology, minimal surfaces and algebraic topology.
Topics vary and are chosen from the areas of analytic, algebraic, and elementary number theory. Topics may include Farey fractions, the theory of paritions, Waring's problem, prime number theorem, and Dirichlet's problem.
Topics vary and may include enumerative combinatorics, graph theory, algebraic combinatorics, combinatorial optimization, coding theory, experimental designs, Ramsey theory, Polya theory, representational theory, set theory and mathematical logic.
Introduction to modern theory of dynamical systems. Linear and nonlinear autonomous differential equations, invariant sets, closed orbits, Poincare maps, structural stability, center manifolds, normal forms, local bifurcations of equilibria, linear and non-linear maps, hyperbolic sets, attractors, symbolic representation, fractal dimensions. P-MTH 611.
Topics vary and may include computational methods in differential equations, optimization methods, approximation techniques, eigenvalue problems. May be repeated for credit.
The problem of finding global minimums of functions is addressed in the context of problems in which many local minima exist. Numerical techniques are emphasized, including gradient descent and quasi- Newton methods. Current literature is examined and a comparison made of various techniques for both unconstrained and constrained optimization problems. Also listed as CSC 753.
Numerical techniques for solving partial differential equations (including elliptic, parabolic, and hyperbolic) are studied along with applications to science and engineering. Theoretical foundations are described and emphasis is placed on algorithm design and implementation using either C, FORTRAN, or MATLAB. Credit not allowed for both MTH 754 and CSC 754. P-MTH 655 or CSC 655.
This course includes the axiomatic foundations of probability theory and an introduction to stochastic processes. Applications may include Markov chains, Markov Chain Monte Carlo with Metropolis-Hastings, Gibb sampling, Brownian motion, and related topics, with an emphasis on modern developments. This course is cross-listed as STA 710. P-MTH 657 or STA 610 and MTH 611 or POI.
May be repeated for credit. Satisfactory/Unsatisfactory.
May be repeated for credit. Satisfactory/Unsatisfactory.
Source: Wake Forest University's catalog, linked per course · table learning_unit · CourseShelf publish 61
