everything.study
COMP 367

Techniques in Symbolic Computation

3 credits · Undergraduate

Winter 2026

Topics

  • MAPLE basics
  • Divisibility, gcd, lcm and Euclidean algorithms
  • Bézout identities and Diophantine equations
  • Prime factorization and congruences
  • Groups, rings and fields
  • Units and zero divisors
  • Matrices, error-correcting codes and Hill cryptosystems
  • Fermat and Euler theorems
  • RSA cryptography
  • Chinese remainder theorem
  • Polynomial rings, division and factorization
  • Polynomial congruences and quotient rings
  • Primitive roots and finite-field calculations

Readings

  • Listed textbook (requirement not stated): L. N. Childs. A Concrete Introduction to Higher Algebra, 2nd or 3rd edition. https://link.springer.com/book/10.1007/978-0-387-74725-5
    Listed reading
Sources