\(\frac{12}{18}\)
Simplifying fractions: Reducing a fraction to its lowest terms by dividing both numerator and denominator by their Greatest Common Divisor (GCD)
- Find the factors of the numerator
- Find the factors of the denominator
- Identify the Greatest Common Divisor (GCD)
- Divide both numerator and denominator by the GCD
Factors of 12: 1, 2, 3, 4, 6, 12
Factors of 18: 1, 2, 3, 6, 9, 18
Common factors: 1, 2, 3, 6
Greatest Common Divisor: 6
\(\frac{12}{18} = \frac{12 ÷ 6}{18 ÷ 6} = \frac{2}{3}\)
\(\frac{12}{18} = \frac{2}{3}\)
• GCD Method: Divide both numerator and denominator by their greatest common divisor
• Equivalence: The value of the fraction remains unchanged
• Lowest Terms: A fraction is in lowest terms when GCD of numerator and denominator is 1
\(\frac{24}{36}\)
Prime factorization: Breaking down numbers into their prime factors to identify common factors
\(24 = 2 × 2 × 2 × 3 = 2^3 × 3\)
\(36 = 2 × 2 × 3 × 3 = 2^2 × 3^2\)
\(\frac{2^3 × 3}{2^2 × 3^2} = \frac{2^{3-2} × 3^{1-1}}{3^{2-1}} = \frac{2^1 × 1}{3^1} = \frac{2}{3}\)
\(\frac{2}{3}\) cannot be simplified further since GCD(2,3) = 1
\(\frac{24}{36} = \frac{2}{3}\)
• Prime Factorization: Express numbers as products of prime factors
• Canceling Common Factors: Remove identical factors from numerator and denominator
• Lowest Terms: Result is in lowest terms when no common factors remain
\(\frac{48}{72}\)
Euclidean Algorithm: An efficient method to find GCD of large numbers by repeated division
\(72 ÷ 48 = 1\) remainder \(24\)
\(48 ÷ 24 = 2\) remainder \(0\)
So GCD(48,72) = 24
\(\frac{48}{72} = \frac{48 ÷ 24}{72 ÷ 24} = \frac{2}{3}\)
\(2 × 36 = 72\) and \(3 × 24 = 72\), so cross products are equal
GCD(2,3) = 1, so \(\frac{2}{3}\) is in lowest terms
\(\frac{48}{72} = \frac{2}{3}\)
• Euclidean Algorithm: Efficient GCD calculation for large numbers
• Cross Multiplication: Verification method for equivalent fractions
• Lowest Terms Verification: GCD of numerator and denominator equals 1
Numerator: Top number in a fraction (the dividend)
Denominator: Bottom number in a fraction (the divisor)
Greatest Common Divisor (GCD): Largest number that divides both numerator and denominator evenly
Equivalent Fractions: Fractions that represent the same value but have different numerators and denominators
- Identify the fraction: Recognize the numerator and denominator
- Find GCD: Use factor listing, prime factorization, or Euclidean algorithm
- Divide both parts: Divide numerator and denominator by GCD
- Verify result: Check that GCD of new numerator and denominator is 1
• Basic Simplification: \(\frac{a}{b} = \frac{a ÷ \gcd(a,b)}{b ÷ \gcd(a,b)}\)
• Verification: Two fractions \(\frac{a}{b}\) and \(\frac{c}{d}\) are equivalent if \(a×d = b×c\)
• Lowest Terms: A fraction \(\frac{a}{b}\) is in lowest terms if \(\gcd(a,b) = 1\)
• Prime Factorization: Cancel identical prime factors from numerator and denominator
Fraction Simplification Infographic
Represents 12 parts out of 18 total parts
GCD of numerator and denominator = 1
\(\gcd(2,3) = 1\)
Therefore \(\frac{2}{3}\) is in lowest terms
- Only dividing the numerator
- Not checking if result is in lowest terms
- Missing common factors
- Arithmetic errors in division
\(\frac{60}{84}\)
Multiple simplification steps: Some fractions require multiple rounds of division before reaching lowest terms
Both 60 and 84 are divisible by 2
\(\frac{60}{84} = \frac{60 ÷ 2}{84 ÷ 2} = \frac{30}{42}\)
Both 30 and 42 are divisible by 6
\(\frac{30}{42} = \frac{30 ÷ 6}{42 ÷ 6} = \frac{5}{7}\)
Factors of 5: 1, 5
Factors of 7: 1, 7
Common factor: 1, so \(\frac{5}{7}\) is in lowest terms
GCD(60,84) = 12
\(\frac{60}{84} = \frac{60 ÷ 12}{84 ÷ 12} = \frac{5}{7}\)
\(\frac{60}{84} = \frac{5}{7}\)
• Progressive Simplification: Multiple division steps if needed
• Direct GCD Method: Single-step approach using greatest common divisor
• Verification: Confirm final fraction has GCD of 1
Real-world fractions: Represent ratios of quantities in practical scenarios
Students who passed = 27
Total students = 45
Fraction = \(\frac{27}{45}\)
Factors of 27: 1, 3, 9, 27
Factors of 45: 1, 3, 5, 9, 15, 45
GCD = 9
\(\frac{27}{45} = \frac{27 ÷ 9}{45 ÷ 9} = \frac{3}{5}\)
\(\frac{3}{5}\) of the class passed the math test
This means 3 out of every 5 students passed
\(\frac{3}{5}\) of the class passed the math test
• Fraction Setup: Numerator = part, Denominator = whole
• Real-world Context: Interpret mathematical results in practical terms
• Simplification: Always reduce to lowest terms for clarity
Equivalent Fractions: Different fractions that represent the same value (e.g., \(\frac{1}{2} = \frac{2}{4} = \frac{3}{6}\))
Lowest Terms: A fraction where the numerator and denominator share no common factors other than 1
Greatest Common Divisor (GCD): The largest positive integer that divides both numbers without remainder
Prime Number: A number greater than 1 that has exactly two factors: 1 and itself
- Identify Components: Determine numerator and denominator
- Calculate GCD: Use one of the available methods
- Perform Division: Divide both numerator and denominator by GCD
- Verify Result: Ensure new fraction is in lowest terms
- Check Work: Cross-multiply to verify equivalence
• Basic Simplification: \(\frac{a}{b} = \frac{a ÷ \gcd(a,b)}{b ÷ \gcd(a,b)}\)
• Equivalence Check: \(\frac{a}{b} = \frac{c}{d}\) if and only if \(a×d = b×c\)
• Lowest Terms Condition: \(\frac{a}{b}\) is in lowest terms if \(\gcd(a,b) = 1\)
• Prime Factorization Method: Cancel identical prime factors from top and bottom
• Euclidean Algorithm: For finding GCD of large numbers efficiently