$\gcd(105, 945) = 105$
["Understanding Why gcd(105, 945) Equals 105: A Step-by-Step Explanation", "The greatest common divisor (gcd) is a fundamental concept in number theory and plays a vital role in simplifying fractions, solving Diophantine equations, and understanding number relationships. One classic example is computing gcd(105, 945), which equals 105. But why is this the case? Let’s explore the reasoning behind $\gcd(105, 945) = 105$ with clarity and detail.", "---", "### What Is the GCD?", "The greatest common divisor of two integers is the largest positive integer that divides both numbers without leaving a remainder. It captures the shared factors of both numbers and is essential in fields like cryptography, computer science, and algebra.", "---", "### Step 1: Prime Factorization of 105 and 945", "To compute $\gcd(105, 945)$ accurately, the most reliable method is prime factorization — breaking each number into its prime components.", "Prime factors of 105:\n- 105 is divisible by 5: $105 \div 5 = 21$\n- 21 is divisible by 3: $21 \div 3 = 7$\n- 7 is prime", "So,\n$$\n105 = 3 \ imes 5 \ imes 7\n$$", "Prime factors of 945:\n- 945 is divisible by 5: $945 \div 5 = 189$\n- 189 is divisible by 3: $189 \div 3 = 63$\n- 63 is divisible by 3: $63 \div 3 = 21$\n- 21 is divisible by 3: $21 \div 3 = 7$\n- 7 is prime", "So,\n$$\n945 = 3^3 \ imes 5 \ imes 7\n$$", "---", "### Step 2: Identify Common Prime Factors", "Now compare the two factorizations:", "- $105 = 3^1 \ imes 5^1 \ imes 7^1$\n- $945 = 3^3 \ imes 5^1 \ imes 7^1$", "The common prime factors are $3$, $5$, and $7$. To find the gcd, take each prime factor to the lowest power that appears in both factorizations.", "- For 3: minimum exponent is $1$\n- For 5: minimum exponent is $1$\n- For 7: minimum exponent is $1$", "Thus:\n$$\n\gcd(105, 945) = 3^1 \ imes 5^1 \ imes 7^1 = 3 \ imes 5 \ imes 7 = 105\n$$", "---", "### Why Is This Result Important?", "Knowing that $\gcd(105, 945) = 105$ tells us:", "1. 105 is the largest number that divides both 105 and 945 without a remainder.\n2. This property explains why 105 appears directly in the factorization of 945 — it’s the deepest shared divisor.\n3. It simplifies fractions like $\frac{945}{105} = 9$, showing how gcd reduces ratios to simplest forms.\n4. This concept is foundational for algorithms such as the Euclidean algorithm, which efficiently determines gcds in complex computations.", "---", "### How to Compute GCD Using the Euclidean Algorithm (Quick Overview)", "While prime factorization clearly shows $\gcd(105, 945) = 105$, the Euclidean algorithm provides a fast alternative:", "1. $945 \div 105 = 9$ with remainder $0$\n2. When remainder is 0, the last non-zero remainder (105) is the gcd", "Thus, $\gcd(105, 945) = 105$ confirmed instantly.", "---", "### Summary", "The greatest common divisor of 105 and 945 is 105 because both numbers share exactly the same prime base combination — $3 \ imes 5 \ imes 7$ — with no higher common power than what each provides individually. This highlights the elegance of prime factorization and reinforces why gcd plays a central role in mathematics and applications alike.", "Understanding $\gcd(105, 945) = 105$ is not only a matter of memorization — it’s a window into the deep structure of numbers. Whether for studying math fundamentals or applying number theory in real-world problems, recognizing shared divisors empowers better reasoning and problem-solving.", "---", "Key Takeaways:", "- $\gcd(105, 945) = 105$ because both share prime factors $3, 5, 7$ at least once.\n- Prime factorization simplifies gcd computation by taking the minimum exponent for each prime.\n- The GCD identifies the largest common divisor, enabling fraction simplification and number analysis.\n- The Euclidean algorithm offers a fast method to determine gcds, including for large numbers.", "Start mastering gcd today — it’s one of the most powerful tools in number theory!"]
