Topics to be covered include properties of the integers, prime numbers, congruences, various Diophantine problems, arithmetical functions and cryptography. Prerequisite: MTH 153 and MTH 211, or equivalent.

Theory and applications of limits, derivatives and integrals of functions of one, two and three variables. Curves in two-and three-dimensional space, vector functions, double and triple integrals, polar, cylindrical, spherical coordinates. Path integration and Green’s Theorem. Prerequisites: MTH 112. MTH 211 suggested (may be concurrent). Enrollment limited to 30.

Theory and applications of limits, derivatives and integrals of functions of one, two and three variables. Curves in two-and three-dimensional space, vector functions, double and triple integrals, polar, cylindrical, spherical coordinates. Path integration and Green’s Theorem. Prerequisites: MTH 112. MTH 211 suggested (may be concurrent). Enrollment limited to 30.

Systems of linear equations, matrices, linear transformations, vector spaces. Applications to be selected from differential equations, foundations of physics, geometry and other topics. Not open to students who have taken MTH 210. Prerequisite: MTH 112 or equivalent, or MTH 111 and MTH 153; MTH 153 is suggested. Enrollment limited to 35.

Systems of linear equations, matrices, linear transformations, vector spaces. Applications to be selected from differential equations, foundations of physics, geometry and other topics. Not open to students who have taken MTH 210. Prerequisite: MTH 112 or equivalent, or MTH 111 and MTH 153; MTH 153 is suggested. Enrollment limited to 35.

An introduction to discrete (finite) mathematics with emphasis on the study of algorithms and on applications to mathematical modeling and computer science. Topics include sets, logic, graph theory, induction, recursion, counting and combinatorics. Enrollment limited to 25.

An introduction to discrete (finite) mathematics with emphasis on the study of algorithms and on applications to mathematical modeling and computer science. Topics include sets, logic, graph theory, induction, recursion, counting and combinatorics. Enrollment limited to 25.

An introduction to discrete (finite) mathematics with emphasis on the study of algorithms and on applications to mathematical modeling and computer science. Topics include sets, logic, graph theory, induction, recursion, counting and combinatorics. Enrollment limited to 25.

An introduction to discrete (finite) mathematics with emphasis on the study of algorithms and on applications to mathematical modeling and computer science. Topics include sets, logic, graph theory, induction, recursion, counting and combinatorics. Enrollment limited to 25.

Techniques of integration, geometric applications of the integral, differential equations and modeling, infinite series and approximation of functions. Written communication and applications to other sciences and social sciences motivate course content. Prerequisite: MTH 111 or equivalent. Enrollment limited to 25.