Greatest Common Divisor (factor) - Least Common Multiple

Solving math problems in a unique way!
Step-by-step by clicking Played automatically Showing all Just the solution What do I need to know?

Greatest Common Factor GCF

Greatest common factor of two integers m and n is:

Eeuclidean algorithm for computing the greates common factor GCF

Example: GCF (246;132)=(246;132)=6

Least Common Multiple LCM

Least common multiple of two integers m and n is:

Connection between the greatest common divisor (GCD) and the least common multiple (LCM)

Example: LCM (246;132)=[246;132]=5412

Relative Primes

Two integers m and n are relatively prime if they share no common positive factors (divisors) except 1. GCF(m;n)=[m;n]=1