Discrete mathematics forms the theoretical foundation for much of today's advanced technology in computer systems communications, digital signal processing, neural networks, control systems, and information theory. This course studies combinatorics and graph theory. It analyzes algorithms, logic, circuits, number bases, and proofs. Graphing calculator is required. An overview of the use of computer-based technology in mathematics educational environments.
Students compare generic or textbook software versus the process of writing programs.
Discusses the impact of fast computations and graphics on the choice of topics in the mathematics curriculum. Addresses equity issues related to usage of computers and labs. Access to National University computer lab is required. An examination of fundamental concepts of numbers, including divisibility, congruences, the distribution of primes, Pythagorean triples, the Euclidean Algorithm, the Fundamental Theorem of Arithmetic, Diophantine equations, and Goldbach's conjecture and other unsolved problems of number theory. Emphasizes active student involvement in posing and testing conjectures, formulating counter examples, logical arguments and proofs.