300
Develops the structural concepts that characterize abstract algebra. Topics in this course will be selected from the following: elementary number theory, groups, rings, integral domain, fields, and vector spaces. There is an emphasis on the oral and written communication of mathematical ideas. Students will frequently work in groups on special projects.
Covers both the theory and applications of linear programming, one of the leading methods for large-scale optimization. The simplex method will be studied in detail. Applications include product mix, diet, transportation, and network flow problems. Integer programming will be touched on briefly. Computer tools such as spreadsheet solvers will be introduced and used.
Covers the fundamental algorithms used in both private key and public key cryptography. Algorithms covered will include DES, AES, Diffie-Hellman, and RSA. Traditional encryption methods such as Vigenere ciphers and their cryptanalysis will be briefly described. The number theory needed to understand primality testing and RSA encryption will be developed in detail. Several programming projects aimed at implementing some of the material will be given throughout the semester.
Is a course in finite dimensional vector spaces and linear transformations, including inner product spaces, determinants, eigenvalues, and eigenvectors.
Is designed to teach mathematical science majors the skills necessary to learn mathematics on their own and communicate their knowledge to others in oral and written form. All students will attend presentations made by senior mathematics students. Students will be required to write a short, independently-researched paper and present it to the other students in the junior seminar.
Covers the topics of vector field theory, Fourier series, and partial differential equations.