A day full of math games & activities. Find one near you.

GCF of 35 and 72

GCF of 35 and 72 is the largest possible number that divides 35 and 72 exactly without any remainder. The factors of 35 and 72 are 1, 5, 7, 35 and 1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72 respectively. There are 3 commonly used methods to find the GCF of 35 and 72 - long division, prime factorization, and Euclidean algorithm.

1.	GCF of 35 and 72
2.	List of Methods
3.	Solved Examples
4.	FAQs

What is GCF of 35 and 72?

Answer: GCF of 35 and 72 is 1.

Explanation:

The GCF of two non-zero integers, x(35) and y(72), is the greatest positive integer m(1) that divides both x(35) and y(72) without any remainder.

Methods to Find GCF of 35 and 72

Let's look at the different methods for finding the GCF of 35 and 72.

Prime Factorization Method
Using Euclid's Algorithm
Long Division Method

GCF of 35 and 72 by Prime Factorization

Prime factorization of 35 and 72 is (5 × 7) and (2 × 2 × 2 × 3 × 3) respectively. As visible, there are no common prime factors between 35 and 72, i.e. they are co-prime. Hence, the GCF of 35 and 72 will be 1.

GCF of 35 and 72 by Euclidean Algorithm

As per the Euclidean Algorithm, GCF(X, Y) = GCF(Y, X mod Y)
where X > Y and mod is the modulo operator.

Here X = 72 and Y = 35

GCF(72, 35) = GCF(35, 72 mod 35) = GCF(35, 2)
GCF(35, 2) = GCF(2, 35 mod 2) = GCF(2, 1)
GCF(2, 1) = 1 (∵ GCF(X, 1) = 1)

Therefore, the value of GCF of 35 and 72 is 1.

GCF of 35 and 72 by Long Division

GCF of 35 and 72 is the divisor that we get when the remainder becomes 0 after doing long division repeatedly.

Step 1: Divide 72 (larger number) by 35 (smaller number).
Step 2: Since the remainder ≠ 0, we will divide the divisor of step 1 (35) by the remainder (2).
Step 3: Repeat this process until the remainder = 0.

The corresponding divisor (1) is the GCF of 35 and 72.

☛ Also Check:

GCF of 35 and 72 Examples

Example 1: For two numbers, GCF = 1 and LCM = 2520. If one number is 72, find the other number.

Solution:

Given: GCF (y, 72) = 1 and LCM (y, 72) = 2520
∵ GCF × LCM = 72 × (y)
⇒ y = (GCF × LCM)/72
⇒ y = (1 × 2520)/72
⇒ y = 35
Therefore, the other number is 35.
Example 2: The product of two numbers is 2520. If their GCF is 1, what is their LCM?

Solution:

Given: GCF = 1 and product of numbers = 2520
∵ LCM × GCF = product of numbers
⇒ LCM = Product/GCF = 2520/1
Therefore, the LCM is 2520.
Example 3: Find the greatest number that divides 35 and 72 exactly.

Solution:

The greatest number that divides 35 and 72 exactly is their greatest common factor, i.e. GCF of 35 and 72.
⇒ Factors of 35 and 72:
- Factors of 35 = 1, 5, 7, 35
- Factors of 72 = 1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72
Therefore, the GCF of 35 and 72 is 1.

go to slide go to slide go to slide

Ready to see the world through math’s eyes?

Math is at the core of everything we do. Enjoy solving real-world math problems in live classes and become an expert at everything.

Book a Free Trial Class

FAQs on GCF of 35 and 72

What is the GCF of 35 and 72?

The GCF of 35 and 72 is 1. To calculate the greatest common factor (GCF) of 35 and 72, we need to factor each number (factors of 35 = 1, 5, 7, 35; factors of 72 = 1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72) and choose the greatest factor that exactly divides both 35 and 72, i.e., 1.

If the GCF of 72 and 35 is 1, Find its LCM.

GCF(72, 35) × LCM(72, 35) = 72 × 35
Since the GCF of 72 and 35 = 1
⇒ 1 × LCM(72, 35) = 2520
Therefore, LCM = 2520
☛ GCF Calculator

What is the Relation Between LCM and GCF of 35, 72?

The following equation can be used to express the relation between LCM and GCF of 35 and 72, i.e. GCF × LCM = 35 × 72.

How to Find the GCF of 35 and 72 by Prime Factorization?

To find the GCF of 35 and 72, we will find the prime factorization of the given numbers, i.e. 35 = 5 × 7; 72 = 2 × 2 × 2 × 3 × 3.
⇒ There is no common prime factor for 35 and 72. Hence, GCF (35, 72) = 1.
☛ What are Prime Numbers?

How to Find the GCF of 35 and 72 by Long Division Method?

To find the GCF of 35, 72 using long division method, 72 is divided by 35. The corresponding divisor (1) when remainder equals 0 is taken as GCF.

What are the Methods to Find GCF of 35 and 72?

There are three commonly used methods to find the GCF of 35 and 72.

By Prime Factorization
By Euclidean Algorithm
By Long Division

Download FREE Study Materials

GCF and LCM

Math worksheets and
visual curriculum