Find a university to explore its courses and reviews.
Covers primes, greatest common divisors, Euclidean Algorithm, congruences, Fermat's Little Theorem, primality testing with applications in cryptography and pseudorandom numbers.
No one has reviewed this course yet. Share your experience and help future students know what to expect.
Takes about 2 minutes. Every review is anonymous — no account needed.