MATH 806T - Number Theory And Cryptology For Middle Level Teachers

Description
Basic number theory results and the RSA cryptography algorithm. Primes, properties of congruences, divisibility tests, linear Diophantine equations, linear congruences, the Chinese Remainder Theorem, Wilson's Theorem, Fermat's Little Theorem, Euler's Theorem, and Euler's phi-function. Mathematical reasoning and integers' connections to the middle school curriculum. Enrollment Requirements: Admission to the MAT or MScT program in mathematics or to a graduate program in the College of Education and Human Sciences.
Credits
3
Recent Professors
Open Seat Checker
Schedule Planner
Recent Semesters
Fall 2017
Avg. Class Size
35
Avg. Sections
1