GCF of 48 and 60
GCF of 48 and 60 is the largest possible number that divides 48 and 60 exactly without any remainder. The factors of 48 and 60 are 1, 2, 3, 4, 6, 8, 12, 16, 24, 48 and 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60 respectively. There are 3 commonly used methods to find the GCF of 48 and 60 - Euclidean algorithm, long division, and prime factorization.
1. | GCF of 48 and 60 |
2. | List of Methods |
3. | Solved Examples |
4. | FAQs |
What is GCF of 48 and 60?
Answer: GCF of 48 and 60 is 12.
Explanation:
The GCF of two non-zero integers, x(48) and y(60), is the greatest positive integer m(12) that divides both x(48) and y(60) without any remainder.
Methods to Find GCF of 48 and 60
The methods to find the GCF of 48 and 60 are explained below.
- Prime Factorization Method
- Listing Common Factors
- Long Division Method
GCF of 48 and 60 by Prime Factorization
Prime factorization of 48 and 60 is (2 × 2 × 2 × 2 × 3) and (2 × 2 × 3 × 5) respectively. As visible, 48 and 60 have common prime factors. Hence, the GCF of 48 and 60 is 2 × 2 × 3 = 12.
GCF of 48 and 60 by Listing Common Factors
- Factors of 48: 1, 2, 3, 4, 6, 8, 12, 16, 24, 48
- Factors of 60: 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60
There are 6 common factors of 48 and 60, that are 1, 2, 3, 4, 6, and 12. Therefore, the greatest common factor of 48 and 60 is 12.
GCF of 48 and 60 by Long Division
GCF of 48 and 60 is the divisor that we get when the remainder becomes 0 after doing long division repeatedly.
- Step 1: Divide 60 (larger number) by 48 (smaller number).
- Step 2: Since the remainder ≠ 0, we will divide the divisor of step 1 (48) by the remainder (12).
- Step 3: Repeat this process until the remainder = 0.
The corresponding divisor (12) is the GCF of 48 and 60.
☛ Also Check:
- GCF of 24 and 32 = 8
- GCF of 10 and 14 = 2
- GCF of 68 and 102 = 34
- GCF of 15 and 24 = 3
- GCF of 32 and 36 = 4
- GCF of 15 and 27 = 3
- GCF of 36 and 42 = 6
GCF of 48 and 60 Examples
-
Example 1: Find the GCF of 48 and 60, if their LCM is 240.
Solution:
∵ LCM × GCF = 48 × 60
⇒ GCF(48, 60) = (48 × 60)/240 = 12
Therefore, the greatest common factor of 48 and 60 is 12. -
Example 2: Find the greatest number that divides 48 and 60 exactly.
Solution:
The greatest number that divides 48 and 60 exactly is their greatest common factor, i.e. GCF of 48 and 60.
⇒ Factors of 48 and 60:- Factors of 48 = 1, 2, 3, 4, 6, 8, 12, 16, 24, 48
- Factors of 60 = 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60
Therefore, the GCF of 48 and 60 is 12.
-
Example 3: The product of two numbers is 2880. If their GCF is 12, what is their LCM?
Solution:
Given: GCF = 12 and product of numbers = 2880
∵ LCM × GCF = product of numbers
⇒ LCM = Product/GCF = 2880/12
Therefore, the LCM is 240.
FAQs on GCF of 48 and 60
What is the GCF of 48 and 60?
The GCF of 48 and 60 is 12. To calculate the GCF (Greatest Common Factor) of 48 and 60, we need to factor each number (factors of 48 = 1, 2, 3, 4, 6, 8, 12, 16, 24, 48; factors of 60 = 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60) and choose the greatest factor that exactly divides both 48 and 60, i.e., 12.
What is the Relation Between LCM and GCF of 48, 60?
The following equation can be used to express the relation between LCM and GCF of 48 and 60, i.e. GCF × LCM = 48 × 60.
How to Find the GCF of 48 and 60 by Prime Factorization?
To find the GCF of 48 and 60, we will find the prime factorization of the given numbers, i.e. 48 = 2 × 2 × 2 × 2 × 3; 60 = 2 × 2 × 3 × 5.
⇒ Since 2, 2, 3 are common terms in the prime factorization of 48 and 60. Hence, GCF(48, 60) = 2 × 2 × 3 = 12
☛ What is a Prime Number?
How to Find the GCF of 48 and 60 by Long Division Method?
To find the GCF of 48, 60 using long division method, 60 is divided by 48. The corresponding divisor (12) when remainder equals 0 is taken as GCF.
If the GCF of 60 and 48 is 12, Find its LCM.
GCF(60, 48) × LCM(60, 48) = 60 × 48
Since the GCF of 60 and 48 = 12
⇒ 12 × LCM(60, 48) = 2880
Therefore, LCM = 240
☛ Greatest Common Factor Calculator
What are the Methods to Find GCF of 48 and 60?
There are three commonly used methods to find the GCF of 48 and 60.
- By Euclidean Algorithm
- By Prime Factorization
- By Long Division
visual curriculum