Greatest Common Factor Examples in Math

Start with the recap, study the fully worked examples, then use the practice problems to check your understanding of Greatest Common Factor.

This page combines explanation, solved examples, and follow-up practice so you can move from recognition to confident problem-solving in Math.

Concept Recap

The greatest common factor (GCF) of two or more numbers is the largest positive integer that divides each of them evenly, with no remainder. It is also called the greatest common divisor (GCD).

The biggest 'piece' size that fits evenly into two numbersβ€”like the largest tile that covers both a 12-unit and 18-unit floor.

Read the full concept explanation β†’

How to Use These Examples

  • Read the first worked example with the solution open so the structure is clear.
  • Try the practice problems before revealing each solution.
  • Use the related concepts and background knowledge badges if you feel stuck.

What to Focus On

Core idea: The GCF is the largest whole number that divides every given number evenly.

Common stuck point: The procedure for greatest common factor is the easy part; the trap is picking the LCM by mistake. Asking "Am I looking for the largest number that divides every given value with no remainder?" first is what keeps a correct-looking calculation from being attached to the wrong concept.

Sense of Study hint: Ask: Am I looking for the largest number that divides every given value with no remainder?

Worked Examples

Example 1

easy
Find the GCF of 4848 and 3636.

Answer

1212

First step

1
Prime-factor each number: 48=24Γ—348 = 2^4 \times 3 and 36=22Γ—3236 = 2^2 \times 3^2.

Full solution

  1. 2
    Identify the common prime factors and keep the smaller exponent for each: 222^2 and 313^1.
  2. 3
    Multiply those shared factors: 22Γ—3=4Γ—3=122^2 \times 3 = 4 \times 3 = 12, so the GCF is 1212.
The GCF is the product of shared prime factors, each raised to the lowest power appearing in either factorization. The GCF is useful for simplifying fractions.

Example 2

medium
Find the GCF of 8484, 126126, and 210210.

Example 3

easy
Find the GCF of 4040 and 100100 by prime factorization.

Example 4

medium
Use the Euclidean algorithm to find gcd⁑(108,60)\gcd(108, 60).

Example 5

medium
Use gcd⁑(a,b)Γ—lcm(a,b)=aΓ—b\gcd(a,b) \times \text{lcm}(a,b) = a \times b to find gcd⁑(15,20)\gcd(15, 20) given lcm(15,20)=60\text{lcm}(15, 20) = 60.

Example 6

medium
Find the GCF of 8484 and 9090 using the Euclidean algorithm.

Example 7

hard
Use the Euclidean algorithm to find gcd⁑(252,198)\gcd(252, 198).

Example 8

hard
A rectangular floor of 2424 ft by 3636 ft is to be tiled with identical square tiles, no cutting. Find the largest tile side length.

Example 9

hard
Find gcd⁑(45,75,90)\gcd(45, 75, 90).

Example 10

challenge
Find integers x,yx, y such that gcd⁑(56,15)=56x+15y\gcd(56, 15) = 56x + 15y.

Practice Problems

Try these problems on your own first, then open the solution to compare your method.

Example 1

easy
Find the GCF of 6060 and 4545.

Example 2

easy
A teacher has ribbons of lengths 2424 cm and 3636 cm. She wants to cut them into the longest equal pieces with no leftover. How long should each piece be?

Example 3

easy
Find the GCF of 88 and 1212.

Example 4

easy
Find the GCF of 99 and 66.

Example 5

easy
Find the GCF of 55 and 77.

Example 6

easy
Find the GCF of 1010 and 2020.

Example 7

easy
Find the GCF of 1414 and 2121.

Example 8

easy
Find the GCF of 1616 and 2424.

Example 9

easy
What is the GCF of any number nn and itself?

Example 10

easy
Find the GCF of 1818 and 2424.

Example 11

medium
Use prime factorization to find the GCF of 1212 and 1818.

Example 12

medium
Find the GCF of 4848 and 3636 using prime factorization.

Example 13

medium
Find the GCF of 2424, 3636, and 6060.

Example 14

medium
Reduce 4256\frac{42}{56} using the GCF.

Example 15

medium
Two ribbons are 18 cm and 30 cm. What is the longest equal piece length that divides both with no waste?

Example 16

medium
If gcd⁑(a,b)=1\gcd(a,b)=1, what does that tell you about aa and bb?

Example 17

medium
Find the GCF of 72β‹…117^2\cdot11 and 7β‹…1127\cdot11^2.

Example 18

challenge
Given gcd⁑(a,b)=6\gcd(a,b)=6 and lcm(a,b)=72\mathrm{lcm}(a,b)=72, find aΓ—ba\times b.

Example 19

challenge
Use the Euclidean algorithm to find gcd⁑(48,18)\gcd(48,18).

Example 20

challenge
Find the largest positive integer nn that divides both n+12n+12 and n+20n+20.

Example 21

medium
Find the GCF of 3030 and 4545 using prime factorization.

Example 22

medium
Reduce 3648\frac{36}{48} using the GCF.

Example 23

easy
Find the GCF of 1212 and 1818.

Example 24

easy
Find the GCF of 2525 and 3535.

Example 25

easy
Find the GCF of 3030 and 5050.

Example 26

easy
Find the GCF of 3232 and 4848.

Example 27

medium
Find the GCF of 7272 and 9696.

Example 28

medium
Find the GCF of 144144 and 216216.

Example 29

medium
A florist has 5454 roses and 4242 tulips. What is the greatest number of identical bouquets she can make using all the flowers?

Example 30

medium
Simplify 7296\dfrac{72}{96} to lowest terms.

Example 31

medium
Find the GCF of 2020, 3030, and 5050.

Example 32

hard
If gcd⁑(a,b)=8\gcd(a, b) = 8 and aβ‹…b=384a \cdot b = 384, find lcm(a,b)\text{lcm}(a, b).

Example 33

hard
Find gcd⁑(26Γ—34Γ—5, 24Γ—35Γ—7)\gcd(2^6 \times 3^4 \times 5, \, 2^4 \times 3^5 \times 7).

Example 34

hard
A box of 8484 pens and a box of 112112 pencils are split among children with each child getting the same number of pens and the same number of pencils, none left over. What is the largest possible number of children?

Example 35

challenge
For positive integers aa and bb with gcd⁑(a,b)=g\gcd(a,b)=g and lcm(a,b)=β„“\text{lcm}(a,b)=\ell, find a+ba+b given g=6g=6 and β„“=180\ell=180 and aβ‰₯ba \ge b.

Background Knowledge

These ideas may be useful before you work through the harder examples.

factorsdivisibility intuition