The greatest common divisor of a set of integers is the largest number that divides each integer in the set. We denote the greatest common divisor by gcd(a,b,…). We can attempt to find this value by listing all divisors of the integers and finding the largest divisor. However, such a procedure can get tedious.
If the prime factorizations of a and b are
ab=p1α1p2α2…pkαk,=p1β1p2β2…pkβk,
then the GCD of the numbers is equal to
gcd(a,b)=p1min(α1,β1)p2min(α2,β2)…pkmin(αk,βk).
For example: gcd(12,18)=gcd(22⋅3,2⋅32)=2⋅3=6.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
There are no comments in this discussion.