GCD/HCFFREEWorksheet Generator(Grades 4-6)
GCD/HCF worksheets with step-by-step answer keys. Generate unlimited unique practice sheets with fresh problems for Grades 4โ6.
Explore Interactive Tools for GCD/HCF Worksheets
Master this math concept across all PanMaths learning verticals:
Why Mastering the GCD is Essential for Fraction Mastery
The Greatest Common Divisor (GCD) is the foundational engine of fraction simplification. To reduce any fraction a/b to its lowest terms in a single step, divide both the numerator and denominator by GCD(a, b).
Our free printable GCD worksheets provide dual solution proofs on every answer sheet: the Prime Factorization Tree and the Euclidean Remainder Algorithm, giving students deep conceptual and algorithmic insight.
Worked Example: Find GCD(24, 36)
- List Prime Factors:
24 = 2 ร 2 ร 2 ร 3 = 2ยณ ร 3ยน36 = 2 ร 2 ร 3 ร 3 = 2ยฒ ร 3ยฒ
- Take Lowest Power of Shared Primes:
2ยฒ ร 3ยน = 4 ร 3 = 12. - Result: GCD(24, 36) = 12.
GCD vs. LCM: Know the Difference
- GCD (Greatest Common Divisor): The largest shared factor (≤ smaller number). Used for simplifying fractions.
- LCM (Least Common Multiple): The smallest shared multiple (≥ larger number). Used for finding common denominators.
- Golden Formula:
GCD(a, b) ร LCM(a, b) = a ร b.
๐ก 1. What is the GCD (HCF)?
The Greatest Common Divisor (also called Highest Common Factor / HCF) is the largest integer that divides both numbers evenly without a remainder.
๐ก 2. Method 1: Prime Factorization
Find the prime factors of both numbers. Multiply the common prime factors: 12 = 2 ร 2 ร 3 and 18 = 2 ร 3 ร 3. Common: 2 ร 3 = 6.
๐ก 3. Method 2: The Euclidean Algorithm (Fastest for Big Numbers)
Divide the larger number by the smaller: 75 mod 45 = 30, then 45 mod 30 = 15, then 30 mod 15 = 0. The last non-zero remainder is 15!
Worksheet Facts by Grade Level
| Grade Level | Divisor & Factor Goal | Target Pairs |
|---|---|---|
| Grade 4 | Find all factor pairs for a whole number in the range 1-100 | Pairs within 24 (e.g. 12, 18) |
| Grade 5 | Use common factors to simplify fraction answers | Pairs within 60 (e.g. 36, 48) |
| Grade 6 | Find the greatest common factor of whole numbers $le 100$ (CCSS.6.NS.B.4) | Pairs up to 150 (e.g. 72, 120) |
Why Mastering the GCD is Essential for Fraction Mastery
The Greatest Common Divisor (GCD) is the foundational engine of fraction simplification. To reduce any fraction a/b to its lowest terms in a single step, divide both the numerator and denominator by GCD(a, b).
Our free printable GCD worksheets provide dual solution proofs on every answer sheet: the Prime Factorization Tree and the Euclidean Remainder Algorithm, giving students deep conceptual and algorithmic insight.
Worked Example: Find GCD(24, 36)
- List Prime Factors:
24 = 2 ร 2 ร 2 ร 3 = 2ยณ ร 3ยน36 = 2 ร 2 ร 3 ร 3 = 2ยฒ ร 3ยฒ
- Take Lowest Power of Shared Primes:
2ยฒ ร 3ยน = 4 ร 3 = 12. - Result: GCD(24, 36) = 12.
GCD vs. LCM: Know the Difference
- GCD (Greatest Common Divisor): The largest shared factor (≤ smaller number). Used for simplifying fractions.
- LCM (Least Common Multiple): The smallest shared multiple (≥ larger number). Used for finding common denominators.
- Golden Formula:
GCD(a, b) ร LCM(a, b) = a ร b.
Benefits of Mastery
๐ Instant Fraction Simplification
Enables 1-step reduction of any rational fraction to irreducible lowest terms.
๐ณ Prime Factorization Mastery
Builds automaticity with factor trees, exponents, and prime numbers.
๐๏ธ Classical Euclidean Algorithm
Introduces one of the oldest and most elegant algorithms in human mathematics.
๐ Standardized Test Alignment
Directly targets Grade 6 Common Core and middle-school competition math.