1Confusing the GCD with the LCM
The greatest common divisor is answered with a common multiple, usually the least common multiple or the product of the two numbers. Both names contain "common", and both are found from the same two numbers.
Wrong turnError here12 and 18 both go into 36, so gcd(12,18)=36.
Right pathThe GCD must divide both numbers. The factors of 12 are {1,2,3,4,6,12} and the factors of 18 are {1,2,3,6,9,18}. The common factors are {1,2,3,6}, so gcd(12,18)=6. The number 36 is lcm(12,18). Why it happens"greatest" suggests a large answer, and "common" is read as a number both lead to rather than a number that goes into both.
How to checkThe GCD can never exceed the smaller number, so gcd(12,18)≤12. Both divisions must also come out whole: 12÷6=2 and 18÷6=3. 2Taking the larger exponent
In the prime factorization method, each shared prime is raised to the larger of its two exponents. That is the rule for the least common multiple, not for the GCD.
Start40=23⋅5 and 60=22⋅3⋅5. Wrong turnError hereThe larger exponents give 23⋅5=40.
Right pathTake the smaller exponent of each shared prime, min(3,2)=2 for the prime 2 and min(1,1)=1 for the prime 5. The prime 3 is not shared. So gcd(40,60)=22⋅5=20, and indeed 40=20⋅2 and 60=20⋅3. Why it happensThe GCD and the LCM are read from the same two factorizations and differ only in minimum against maximum, and the word "greatest" pulls toward the larger exponent.
How to checkDivide both numbers by the result. 60÷40=1.5 is not whole, so 40 is not a common divisor at all. 3Keeping the larger number
After the first division of the Euclidean algorithm, the next division keeps the original larger number and divides it by the remainder, instead of dividing the previous divisor.
StartFor gcd(252,105), 252=105⋅2+42, Wrong turnError hereThen 252=42⋅6+0, so the GCD is 42.
Right pathThe pair moves along, (252,105)→(105,42)→(42,21). The steps are 105=42⋅2+21 and 42=21⋅2+0, so gcd(252,105)=21. Why it happensThe larger number feels like the number being worked on, while the rule (a,b)→(b,amodb) drops it after the first step. How to checkThe result must divide both original numbers. 105÷42=2.5, so 42 fails; 252÷21=12 and 105÷21=5. 4Taking coprime to mean prime
"Relatively prime" is read as a property of each number on its own, so a pair is called coprime only when both numbers are prime.
Wrong turnError hereNeither 8 nor 15 is prime, so 8 and 15 are not coprime.
Right pathThe factors of 8 are {1,2,4,8} and the factors of 15 are {1,3,5,15}. The only common factor is 1, so gcd(8,15)=1 and the two numbers are coprime. Why it happensThe word "prime" inside "relatively prime" suggests that the numbers themselves must be prime.
How to checkCompute the GCD. Two numbers are coprime exactly when their GCD is 1, whether or not either of them is prime. 5Stopping at a smaller common factor
A fraction is divided by a common factor that is not the greatest one, and the result is taken to be in lowest terms.
Wrong turnError here18 and 24 are both even, so 2418=129, and the fraction is simplified.
Right path9 and 12 still share the factor 3, so 129=43. In one step, gcd(18,24)=6 and 24÷618÷6=43. Why it happensThe first common factor that is spotted, often 2, is cancelled, the result looks simpler, and the check that nothing else is shared is skipped. How to checkFind the GCD of the new numerator and denominator. gcd(9,12)=3 means the fraction is not finished; gcd(3,4)=1 means it is.