The $\gcd$ is the product of the smallest powers of common primes: $3^1 \times 5^1 = 15$.

["The Greatest Common Divisor (GCD): Understanding Why It’s the Product of Smallest Powers of Common Prime Factors", "When exploring number theory, one of the most foundational concepts is the greatest common divisor (GCD). The GCD of two or more integers is the largest positive integer that divides each of them without leaving a remainder. While the Euclidean algorithm offers an efficient way to compute GCDs, a deeper insight lies in the prime factorization approach: the GCD is the product of the smallest powers of all common prime factors. A classic example is:", "[\n\gcd(9, 15) = 3^1 \ imes 5^1 = 15\n]", "This formula reveals a powerful principle: the GCD is determined not merely by listing divisors, but by examining the prime building blocks of the numbers involved.", "---", "### Why Prime Factorization Matters in Computing GCD", "Every integer greater than 1 can be uniquely expressed as a product of prime powers — this is the Fundamental Theorem of Arithmetic. For example:", "- (9 = 3^2)\n- (15 = 3^1 \ imes 5^1)", "To find the GCD, we identify which prime factors appear in both numbers and take the lowest exponent shared across them.", "In the pair 9 and 15, only the prime (3) is common. It appears with exponent 2 in 9 and exponent 1 in 15. The smallest such exponent is (1). The prime (5) appears only in 15 and not at all in 9, so it’s excluded. Therefore:", "[\n\gcd(9, 15) = 3^1 = 3\n]", "However, the original example simplifies to (3^1 \ imes 5^1 = 15) — a clarification reveals the deeper truth: the GCD includes only the common primes, raised to their minimum powers, not simply multiplying all primes. When you see (3^1 \ imes 5^1), it emphasizes that only shared prime bases contribute, and their powers reflect the stricter requirements.", "Wait — is the product inclusive of all common primes with minimal exponents? In the case of ( \gcd(9, 15) ), that would be (3^1), not (3^1 \ imes 5^1 = 15), unless 5 is also a shared prime, which it is not.", "Thus, a more accurate interpretation: The GCD is the product of every prime that divides both numbers, each raised to the minimum power with which it appears in their combined factorizations. For (9) and (15), only (3^1) qualifies — even though (5^1) divides 15, it’s not common, so it’s excluded.", "But suppose we examine a clearer, instructive example: (\gcd(18, 45))", "- (18 = 2 \ imes 3^2)\n- (45 = 3^2 \ imes 5)", "Common prime: only (3), with exponent 2 in both. So:", "[\n\gcd(18, 45) = 3^2 = 9\n]", "This confirms the principle: GCD = product of common prime factors, each raised to the lowest exponent among them.", "Yet, returning to ( \gcd(9, 15) = 3^1 ): even though (5^1) appears in one number, it’s not shared, so excluded. But if we incorrectly multiply all primes: (3^1 \ imes 5^1 = 15), it falsely implies 5 divides both — which it doesn’t.", "Hence, the correct teaching insight is:", "> The GCD is defined as the product of all primes common to both numbers, each raised to the minimal power with which they appear in both factorizations.", "So why does (3^1 \ imes 5^1 = 15) appear in explanation? It serves as a note on correct factorization, but only if both numbers have that prime. A better ejemplo:", "(\gcd(45, 75))", "- (45 = 3^2 \ imes 5^1)\n- (75 = 3^1 \ imes 5^2)", "Common primes: (3) and (5). Minimum exponents: (3^1), (5^1). So:", "[\n\gcd(45, 75) = 3^1 \ imes 5^1 = 15\n]", "This illustrates that combining smallest powers of only common primes gives the GCD — never arbitrary products, even if numerically correct in trivial cases. The example (3^1 \ imes 5^1 = 15) caters to intuition, but only when emphasizing exclusivity of common factors.", "---", "### Practical Implications", "Understanding the GCD as a product of smallest powers of shared primes empowers problem-solving in:", "- Simplifying fractions: To reduce (\frac{45}{75}), divide numerator and denominator by (\gcd = 15), yielding (\frac{3}{5}). Knowing (3^1 \ imes 5^1 = 15) enables quick cancellation.", "- Algebraic number theory: Extending GCD to polynomials follows the same logic — identifiers are irreducible polynomials, and their GCD depends on shared low-powered factors.", "- Cryptography: Algorithms like RSA rely on prime factorization and GCD computations, where efficient comprehension of prime decomposition ensures secure key generation.", "---", "### Final Thoughts", "The GCD is far more than a label — it’s a window into the multiplicative structure of integers. By expressing numbers as products of primes and isolating shared bases with minimal exponents, we uncover a clear, scalable method to compute divisibility limits. The formula (\gcd(a, b) = \prod_p p^{\min(e_p(a), e_p(b))}) — where (p) ranges over primes common to (a) and (b), and (e_p(n)) is the exponent of (p) in (n)'s factorization — encapsulates this elegance.", "Remember: GCD = product of common primes raised to their smallest shared exponents. And in (3^1 \ imes 5^1 = 15), this principle becomes tangible—when applied correctly.", "---", "Key Takeaways:\n- Factorize both numbers into primes.\n- Identify primes common to both.\n- Take each shared prime with exponent equal to the smallest found.\n- Multiply these primes — only the common ones, each min-exponent-wise.", "This method ensures mathematical accuracy and empowers deeper exploration in number theory and beyond.", "---", "Keywords: GCD definition, greatest common divisor, prime factorization, common prime factors, minimal exponents, number theory basics, GCD computation, Euclidean algorithm alternative, mathematical insight, prime decomposition."]