Mathematics (BA)

Limits, continuity, the derivative and applications, transcendental functions, L'Hopital's Rule, and development of the Riemann integral.

Prerequisites: Satisfy Placement Table in this section, MATH 115 or both MATH 112 and MATH 113 with “C” (2.0) or better.

Goal Areas: GE-04

Logic, proof techniques, set theory, relations, functions, cardinality, operations, and an introduction to mathematical structures and number theory.

Prerequisites: MATH 122 with “C” (2.0) or better or consent.

Goal Areas: GE-02

Techniques of integration, applications of integration, improper integrals, numerical integration, the calculus of parametric curves, and infinite series and sequences.

Prerequisites: MATH 121 with “C” (2.0) or better or consent

Students will learn the rudiments of algorithmic processes such as iteration and recursion and implement simple mathematical algorithms in a commonly used mathematical software package. Applications may include graphing, equation solving, numerical approximation, recurrence relations, and generation of mathematical objects such as sets, lists, permutations and trees.

Prerequisites: MATH 121

Surfaces, vector-valued functions, partial differentiation, multiple integration, and vector calculus.

Prerequisites: MATH 122 with “C” (2.0) or better, or consent

Matrices, determinants, systems of linear equations, vector spaces, linear transformations, and characteristic value problems.

Prerequisites: MATH 122 with “C” (2.0) or better or consent

Limits, sequences, continuity, and differentiation of a real valued function of a real variable.

Prerequisites: MATH 223 and MATH 290 with “C” (2.0) or better or consent

An introduction to the theory of groups and rings; including polynomial rings, homomorphisms, isomorphisms, and concepts of normal subgroups, ideals, quotient groups, and quotient rings.

Prerequisites: MATH 290 with “C” (2.0) or better or consent

MATH 375 Introduction to Discrete Mathematics (4 credits)An introduction to the concepts fundamental to the analysis of algorithms and their realization. Topics will include combinatorics, generating functions, recurrence relations, graph theory, and networks.

Prerequisites: MATH 247 and MATH 290 with grade of “C” (2.0) or higher.

This course is designed to allow undergraduate students an opportunity to integrate their undergraduate mathematics experiences by engaging each student in working on a problem in applied or theoretical mathematics. In doing so, students will see connections between the various topics found in the undergraduate mathematics curriculum. Content will vary by semester. An important component of this course will be the preparation and presentation of a research paper describing the student's progress toward a solution of the problem under consideration. Problems will arise from the course content and materials as presented by the instructor. Because of the breadth of mathematical topics needed for successful completion of the course, students need to have senior standing.

Prerequisites: Two of the following: MATH 316, MATH 321, MATH 345, MATH 375 and senior standing (or permission of the instructor). Course can also be taken independent study with permission of a cooperating faculty member. 

This course presents the theory, computations, and applications of first and second order differential equations and two-dimensional systems.

Prerequisites: MATH 122 with “C” (2.0) or better or consent

This course covers several geometric systems including Euclidean, non-Euclidean, transformational and projective. Other topics studied are topological properties and the relationship between coordinate and synthetic geometry.

Prerequisites: MATH 290 with “C” (2.0) or better or consent

A calculus based introduction to probability and statistics. Topics include probability, random variables, probability distributions (discrete and continuous), joint probability distributions (discrete and continuous), statistical inference (both estimation and hypothesis testing), confidence intervals for distribution of parameters and their functions, sample size determinations, analysis of variance, regression, and correlation. This course meets the needs of the practitioner and the person who plans further study in statistics.

Prerequisites: MATH 122 with “C” (2.0) or better or consent

An introduction to topological spaces and their fundamental properties such as compactness, connectedness, separation properties and countability properties. Continuous functions between topological spaces and common examples of topological spaces are also discussed.

Prerequisites: MATH 290 with grade of “C” (2.0) or higher. 

Algebra and geometry of complex numbers, analytic functions, power series, Cauchy's theorem and residue theorem.

Prerequisites: MATH 223 and MATH 290 with “C” (2.0) or better or consent

The topology of Euclidean spaces, compact and connectedness, properties of continuous functions, differentiation, basic theory of Riemann-Stieltjes integration and the fundamental theorem of Calculus.

Prerequisites: MATH 223 and MATH 290 with “C” (2.0) or better or consent 

A continuation of Math 417. The course may include topics from metric spaces, Riemann-Stieltjes integration, differentiation in Euclidean space, sequences and series of functions, approximation theorems, implicit and inverse function theorems, equicontinuity, and mapping theorems.

Prerequisites: MATH 417 with “C” (2.0) or better or consent

This course presents the theory, computations, and applications of partial differential equations and Fourier series.

Prerequisites: MATH 223 and MATH 321 with “C” (2.0) or better or consent

This course presents topics from mathematical analysis of both discrete and continuous models taken from problems in the natural sciences, economics and resource management.

Prerequisites: MATH 223 and MATH 247 with “C” (2.0) or better or consent

Simplex method and its variants, duality, sensitivity analysis, interior-point methods, quadratic programming and linear complementarity problems. Applications such as classification problems and game theory with linear optimization software.

Prerequisites: MATH 122, MATH 247

Geometry of spaces including Euclidean and non-Euclidean and applications of contemporary geometry.

Prerequisites: MATH 247 and MATH 290 with grade of "C" (2.0) or higher or consent.

Euclidean algorithm, primes, composites, number theoretic functions, congruencies, Diophantine equations, Euler and Fermat theorems, algebraic number fields.

Prerequisites: MATH 345 with “C” (2.0) or better or consent

A continuation of MATH 345. The course will include topics from groups, rings, and fields.

Prerequisites: MATH 345 with “C” (2.0) or better or consent

An in-depth study of linear operators and their related spaces, dimension, rank, matrix representation of linear operators, special matrices, determinants, eigenvectors and eigenvalues.

Prerequisites: MATH 345 with “C” (2.0) or better or consent

A mathematical approach to statistics with derivation of theoretical results and of basic techniques used in applications. Includes probability, continuous probability distributions, multivariate distributions, functions of random variables, central limit theorem and statistical inference. Same as STAT 455.

Prerequisites: MATH 223 with “C” (2.0) or better or consent

A mathematical approach to statistics with derivation of theoretical results and of basic techniques used in applications, including sufficient statistics, additional statistical inference, theory of statistical tests, inferences about normal models and nonparametric methods. Same as STAT 456.

Prerequisites: MATH 455 / STAT 455 with “C” (2.0) or better or consent

This course applies probabilistic methods to problems encountered in actuarial science that prepares students for the Society of Actuaries Exam P/1.

Prerequisites: (MATH 354, STATS 354, MATH 455 or STAT 455) and MATH 223

This course covers the theory of interest portion of Exam FM/2 of the Society of Actuaries. Topics include time value of money, measurement of interest, annuities certain, arithmetic and geometric annuities, amortization schedules and sinking fund, bonds and other securities, yield rates, and interest rate immunization.

Prerequisites: MATH 122 with C (2.0) or better or consent.

This course provides an introduction to techniques and analysis involved with solving mathematical problems using technology. Topics included are errors in computation, solutions of linear and nonlinear equations, numerical differentiation and integration, and interpolation.

Prerequisites: MATH 122, MATH 247 with “C” (2.0) or better or consent

This course is a continuation of MATH 470. Topics included are the algebraic eigenvalue problem, least squares approximation, solutions of systems of nonlinear equations, numerical solutions of ordinary differential equations.

Prerequisites: MATH 470 and MATH 223 with “C” (2.0) or better or consent

Students will learn fundamental concepts of computer programming and write software to implement a variety of mathematical algorithms, manipulate large amounts of data, test conjectures, and make abstract mathematical concepts concrete. Programming concepts include input versus output, data structures, local and global variables, switch state- ments, iteration, recursion, halting conditions, modularity, debugging, and algorithm analysis. Programming projects may vary with instructor, but could include topics from enumerative combinatorics, graph theory, group theory, linear algebra, and number theory.

Prerequisites: Math 345 and Math 375 with a "C" (2.0) or better, and senior standing or consent.

The development of selected topics from before the Hellenistic time period to the late twentieth century. Familiarity with the content of HIST 180 is beneficial.

Prerequisites: MATH 345 with “C” (2.0) or better or consent