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 permission of the instructor.

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 or 114. It is suggested that MTH 211 be taken before or concurrently with MTH 212.

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 or 114. It is suggested that MTH 211 be taken before or concurrently with MTH 212.

Systems of linear equations, matrices, linear transformations, vector spaces. Applications to be selected from differential equations, foundations of physics, geometry and other topics. Students may not receive credit for both MTH 211 and MTH 210. Prerequisite: MTH 112 or the equivalent, or MTH 111 and MTH 153; MTH 153 is suggested. Enrollment limit of 35 students.

Systems of linear equations, matrices, linear transformations, vector spaces. Applications to be selected from differential equations, foundations of physics, geometry and other topics. Students may not receive credit for both MTH 211 and MTH 210. Prerequisite: MTH 112 or the equivalent, or MTH 111 and MTH 153; MTH 153 is suggested. Enrollment limit of 35 students.

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.

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.

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 the equivalent.

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 the equivalent.

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 the equivalent.