Greatest Common Divisor and Least Common Multiple (with Euclidean Algorithm)
Factorization has brought us to this: the Greatest Common Divisor and the Least Common Multiple. These values can be used to work out all sorts of solutions in computing. Let's take a look at the methods we use to compute them including the Euclidean Algorithm.
Timestamps
00:00 | Intro
00:15 | Another Factorization Demonstration
05:00 | Introduction to Greatest Common Divisor/Factor
06:08 | Simple Calculation of GCD(30,18)
07:42 | Explanation of the Euclidean Algorithm
10:57 | Calculation of GCD(30,18) using Euclidean Algorithm
12:33 | Calculation of GCD(2100,4312) using Factorization
14:12 | Calculation of GCD(2100,4312) using Euclidean Algorithm
16:25 | Introduction to Least/Lowest Common Multiple
17:40 | Simple Calculation of LCM(30,18) using Factorization
20:19 | Calculation of LCM(2100,4312) using Factorization
22:23 | Calculation of LCM(2100,4312) using a·b = GCD(a,b)·LCM(a,b)
Hashtags
#factor #gcd #lcm