MATH 806T
Number Theory and Cryptology for Middle Level Teachers
University of Nebraska-Lincoln · UGRD · Fall 2026
1 section
Catalog 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.
Sections
Current meeting, instructor, credit, and enrollment details
001
Availability not recently verifiedClass #nebraska_lincoln-MATH806TFall 2026UGRD3 credits
- Days & times
- No scheduled meeting time
- Meeting dates
- —
- Location
- —
- Instructor
- Staff
Class numbers and section codes come from the registrar.
Spot missing or incorrect course data?