Repeated Squaring & Euclid’s Algorithm| Computational Number Theory

This video discusses the repeated squaring algorithm (for computing high powers modulo a prime) and Euclid’s Algorithm (for computing the gcd of two numbers). #greatestcommonfactor #euclidsalgorithm #repeatedsquaring #numbertheory