Matemática Zero 2.0 - Aula 11 - MMC e MDC - (parte 1 de 2)

Introduction

In this tutorial, we will explore the concepts of the Least Common Multiple (MMC) and the Greatest Common Divisor (MDC). Understanding these mathematical principles is essential for solving problems related to fractions, ratios, and more in mathematics. This guide will provide clear, step-by-step instructions to help you master these concepts.

Step 1: Understanding Prime Numbers

• Definition: A prime number is a natural number greater than 1 that cannot be formed by multiplying two smaller natural numbers.
• Examples: The first few prime numbers are 2, 3, 5, 7, 11, and 13.
• Tip: Familiarize yourself with prime numbers, as they are the building blocks for finding MMC and MDC.

Step 2: Identifying Coprime Numbers

• Definition: Two numbers are coprime (or relatively prime) if their greatest common divisor is 1.
• Examples: The numbers 8 and 9 are coprime because they share no common factors other than 1.
• Practical Advice: To check if two numbers are coprime, list their factors and see if they have any common factors.

Step 3: Calculating the Greatest Common Divisor (MDC)

• Method 1: Prime Factorization

  1. Factor each number into its prime factors.
  2. Identify the common prime factors.
  3. Multiply these common factors to find the MDC.

• Method 2: Euclidean Algorithm

  1. Apply the formula: MDC(a, b) = MDC(b, a mod b).
  2. Continue until one number becomes zero.
  3. The last non-zero remainder is the MDC.

• Example: For the numbers 24 and 36:

  • Prime factorization: 24 = 2^3 * 3, 36 = 2^2 * 3^2
  • Common factors: 2^2 * 3 = 12, so MDC is 12.

Step 4: Calculating the Least Common Multiple (MMC)

• Method 1: Prime Factorization

  1. Factor each number into its prime factors.
  2. Take the highest power of each prime factor from both numbers.
  3. Multiply these together to find the MMC.

• Method 2: Relationship with MDC

  • Use the formula: MMC(a, b) = (a * b) / MDC(a, b).

• Example: For the numbers 24 and 36:

  • Prime factorization: 24 = 2^3 * 3, 36 = 2^2 * 3^2
  • Highest powers: 2^3 (from 24) and 3^2 (from 36).
  • MMC = 2^3 * 3^2 = 72.

Conclusion

In this tutorial, we learned how to find the Greatest Common Divisor (MDC) and the Least Common Multiple (MMC) using prime factorization and the Euclidean algorithm. Understanding these concepts is vital for solving various mathematical problems, especially in fractions and ratios. As you practice, try applying these methods to different pairs of numbers to reinforce your learning. For further exploration, consider reviewing additional resources or practicing with exercises related to these topics.