How to Find the GCD and LCD in Mathematics?

  • MHB
  • Thread starter karush
  • Start date
  • Tags
    Gcd Lcd
In summary, the conversation discusses the differences and significance of GCD and LCD, how to find the GCD of two numbers using the Euclidean Algorithm, and the relationship between GCD and LCM. GCD is the largest number that divides evenly into two or more numbers, while LCD is the smallest number that is a multiple of two or more numbers. Finding the GCD and LCD is important in mathematics and computer science, and they are always positive numbers. GCD and LCM are different concepts, with GCD focusing on division and LCM focusing on multiplication.
  • #1
karush
Gold Member
MHB
3,269
5
$$\tiny{g1.1.2 \qquad UHW412}$$
\begin{align*}\displaystyle
S&=gcd(2^4\cdot3^2\cdot 5\cdot 7^2,2\cdot3^3\cdot 7\cdot 11)\\
&=gcd(35280,4158)\\
W|A&=126\\
\end{align*}

ok I tried to find a direct example but the powers and bases are mixed
the answer came from W|A

just interested in what steps are the normal protocol for this
 
Physics news on Phys.org
  • #2
I would look at all factors present, and take the smaller power present in each:

\(\displaystyle 2\cdot3^2\cdot7=126\)
 
  • #3
what about 5 and 11
 
  • #4
karush said:
what about 5 and 11
Only use the primes that are in both. So we ignore the 5 and 11.

-Dan
 

Similar threads

Replies
4
Views
1K
Replies
2
Views
1K
Replies
3
Views
1K
Replies
11
Views
2K
Replies
1
Views
1K
Replies
5
Views
2K
Replies
27
Views
4K
Replies
2
Views
2K
Back
Top