is an introduction to differential calculus, including algebraic, trigonometric, exponential, logarithmic, inverse trigonometric and hyperbolic functions. Applications include kinematics, related rates problems, curve sketching and optimization.

is an introduction to integral calculus, including Riemann sums, techniques of integration and improper integrals. Applications include exponential growth and decay, area between curves and volumes of solids of revolution.

covers topics which include elementary algebra and functions, sets, elementary probability, matrices, systems of equations, and linear programming.

covers topics which include logic, permutations, combinations, mathematical systems, elementary number theory, and geometry.

is a two-semester course which provides students with the essential prerequisite elements for the study of an introductory course in calculus, at a slower pace than MATH 1090. Topics include algebra, functions and their graphs, exponential and logarithmic functions, trigonometry, polynomials, and rational functions.

provides students with the essential prerequisite elements for the study of an introductory course in calculus. Topics include algebra, functions and their graphs, exponential and logarithmic functions, trigonometry, polynomials, and rational functions.

is an introduction to infinite sequences and series, and to the differential and integral calculus of multivariate functions. Topics include tests for the convergence of infinite series, power series, Taylor and Maclaurin series, complex numbers including Euler's formula, partial differentiation, and double integrals in Cartesian and polar coordinates.

includes the topics of Euclidean n-space, vector operations in 2- and 3-space, complex numbers, linear transformations on n-space, matrices, determinants, and systems of linear equations.

includes the topics of real and complex vector spaces, basis, dimension, change of basis, eigenvectors, inner products, and diagonalization of Hermitian matrices.

covers the following topics: simple and compound interest and discount, forces of interest and discount, equations of value, annuities and perpetuities, amortization schedules and sinking funds, bonds and other securities, contingent payments.

is a project oriented course combining mathematical investigation and technical writing. By using computer programming, graphical and typesetting tools, students will explore mathematical concepts and will produce technical reports of professional quality. The latter will combine elements of writing and graphics to convey technical ideas in a clear and concise manner.

(same as the former MATH 3260) is direction fields, equations of first order and first degree, higher order linear equations, variation of parameters, methods of undetermined coefficients, Laplace transforms, systems of differential equations. Applications include vibratory motion, satellite and rocket motion, pursuit problems, population models and chemical kinetics.

covers basic concepts of mathematical reasoning: logic and quantifiers, methods of proof, sets and set operations, functions and relations, equivalence relations and partial orders, countable and uncountable sets. These concepts will be illustrated through the congruence and divisibility of integers, induction and recursion, principles of counting, permutations and combinations, the Binomial Theorem, and elementary probability.

is an introduction to Euclidean geometry of the plane. It covers the geometry of triangles and circles, including results such as the Euler line, the nine-point circle and Ceva’s theorem. It also includes straight-edge and compass constructions, isometries of the plane, the three reflections theorem, and inversions on circles.

covers descriptive statistics (including histograms, stem-and-leaf plots and box plots), elementary probability, random variables, the binomial distribution, the normal distribution, sampling distribution, estimation and hypothesis testing including both one and two sample tests, paired comparisons, correlation and regression, related applications.

is an introduction to basic statistics methods with an emphasis on applications to the sciences. Material includes descriptive statistics, elementary probability, binomial distribution, Poisson distribution, normal distribution, sampling distribution, estimation and hypothesis testing (both one and two sample cases), chi-square test, one way analysis of variance, correlation and simple linear regression.

covers the structure of the real numbers, sequences and limits, compactness, continuity, uniform continuity, differentiation, and the Mean Value Theorem.

includes a discussion of round-off error, the solution of linear systems, iterative methods for nonlinear equations, interpolation and polynomial approximation, least squares approximation, fast Fourier transform, numerical differentiation and integration, and numerical methods for initial value problems.

deals with functions of several variables. Lagrange multipliers, vector valued functions, directional derivatives, gradient, divergence, curl, transformations, Jacobians, inverse and implicit function theorems, multiple integration including change of variables using polar, cylindrical and spherical co-ordinates, Green’s theorem. Stokes’ theorem, divergence theorem, line integrals, arc length.

examines algorithms and complexity, definitions and basic properties of graphs, Eulerian and Hamiltonian chains, shortest path problems, graph colouring, planarity, trees, network flows, with emphasis on applications including scheduling problems, tournaments, and facilities design.

is an introduction to groups and group homomorphisms including cyclic groups, cosets, Lagrange's theorem, normal subgroups and quotient groups, introduction to rings and ring homomorphisms including ideals, prime and maximal ideals, quotient rings, integral domains and fields.

includes Topics such as distributions, the binomial and multinomial theorems, Stirling numbers, recurrence relations, generating functions and the inclusion-exclusion principle. Emphasis will be on applications.

is perfect numbers and primes, divisibility, Euclidean algorithm, greatest common divisors, primes and the unique factorization theorem, congruences, cryptography (secrecy systems), Euler-Fermat theorems, power residues, primitive roots, arithmetic functions, Diophantine equations, topics above in the setting of the Gaussian integers.

is basic probability concepts, combinatorial analysis, conditional probability, independence, random variable, distribution function, mathematical expectation, Chebyshev's inequality, distribution of two random variables, binomial and related distributions, Poisson, gamma, normal, bivariate normal, t, and F distributions, transformations of variables including the moment-generating function approach.

is an introduction to optimization, analytic methods for functions of one variable and for functions of several variables, classical maxima and minima, necessary and sufficient conditions, constrained optimization, equality and inequality constraints, Kuhn-Tucker conditions, introduction to the calculus of variations, linear programming, simplex algorithm.

covers two point boundary value problems, Fourier series, Sturm-Liouville theory, canonical forms, classification and solution of linear second order partial differential equations in two independent variables, separation of variable, integral transform methods.

is a study of the correctness and complexity of algorithms, with particular focus on algorithms important in mathematics. Topics may include sorting and binary search, string searching, integer multiplication and exponentiation, matrix multiplication, geometric problems such as closest pair of points and convex hull, probabilistic and approximative algorithms. This course discusses polynomial reductions and NP-completeness.

is a variety of topics in Mathematics.

starts with a brief overview of basic set theory, followed by an introduction to propositional and predicate logic and basics of model theory (models, theories, compactness theorem) and computability theory (computable and computably enumerable sets, first order arithmetic).

continues most of the topics started in 3340 with further work on distributions, recurrence relations and generating functions. Generating functions are used to solve recurrence relations in two variables. Also included is a study of Polya's theorem with applications.

(same as the former MATH 4290) includes topics which may be chosen from matchings, factorizations, adjacency matrices, eigenvalues of graphs, strongly regular graphs, independent sets and cliques, cuts and connectivity, graph products, graph homomorphisms, edge colourings, domination, and graph searching.

is a course in which, under the guidance of a faculty member, students conduct a scientific study based upon original research or a critical review of extant data in an appropriate area. Normally the project will have a computational component. Students are required to submit a report and give a presentation.