1. **State the problem:** Find the greatest common divisor (GCD) of 96 and 72.
2. **Formula and method:** The GCD of two numbers is the largest positive integer that divides both numbers without leaving a remainder.
3. **Use the Euclidean algorithm:**
- Divide 96 by 72: $$96 = 72 \times 1 + 24$$
- Now find GCD(72, 24)
- Divide 72 by 24: $$72 = 24 \times 3 + 0$$
4. When the remainder is 0, the divisor at that step is the GCD.
5. Therefore, $$\text{GCD}(96, 72) = 24$$.
**Final answer:** The greatest common divisor of 96 and 72 is 24.
Gcd 96 72
Step-by-step solutions with LaTeX - clean, fast, and student-friendly.