This course covers computational problems upon the Euclidean algorithm, continued fractions, modular exponentiation, identifying primes p either probabilistically or analytically, identifying generators for Z_p, constructing irreducible polynomials and f(This course covers computational problems upon the Euclidean algorithm, continued fractions, modular exponentiation, identifying primes p either probabilistically or analytically, identifying generators for Z_p, constructing irreducible polynomials and f)