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

GCF of 2 and 9

GCF of 2 and 9 is the largest possible number that divides 2 and 9 exactly without any remainder. The factors of 2 and 9 are 1, 2 and 1, 3, 9 respectively. There are 3 commonly used methods to find the GCF of 2 and 9 - long division, prime factorization, and Euclidean algorithm.

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

What is GCF of 2 and 9?

Answer: GCF of 2 and 9 is 1.

Explanation:

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

Methods to Find GCF of 2 and 9

Let's look at the different methods for finding the GCF of 2 and 9.

Using Euclid's Algorithm
Listing Common Factors
Long Division Method

GCF of 2 and 9 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 = 9 and Y = 2

GCF(9, 2) = GCF(2, 9 mod 2) = GCF(2, 1)
GCF(2, 1) = GCF(1, 2 mod 1) = GCF(1, 0)
GCF(1, 0) = 1 (∵ GCF(X, 0) = |X|, where X ≠ 0)

Therefore, the value of GCF of 2 and 9 is 1.

GCF of 2 and 9 by Listing Common Factors

Factors of 2: 1, 2
Factors of 9: 1, 3, 9

Since, 1 is the only common factor between 2 and 9. The Greatest Common Factor of 2 and 9 is 1.

GCF of 2 and 9 by Long Division

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

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

The corresponding divisor (1) is the GCF of 2 and 9.

☛ Also Check:

GCF of 2 and 9 Examples

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

Solution:

Given: GCF (z, 9) = 1 and LCM (z, 9) = 18
∵ GCF × LCM = 9 × (z)
⇒ z = (GCF × LCM)/9
⇒ z = (1 × 18)/9
⇒ z = 2
Therefore, the other number is 2.
Example 2: Find the greatest number that divides 2 and 9 exactly.

Solution:

The greatest number that divides 2 and 9 exactly is their greatest common factor, i.e. GCF of 2 and 9.
⇒ Factors of 2 and 9:
- Factors of 2 = 1, 2
- Factors of 9 = 1, 3, 9
Therefore, the GCF of 2 and 9 is 1.
Example 3: Find the GCF of 2 and 9, if their LCM is 18.

Solution:

∵ LCM × GCF = 2 × 9
⇒ GCF(2, 9) = (2 × 9)/18 = 1
Therefore, the greatest common factor of 2 and 9 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 2 and 9

What is the GCF of 2 and 9?

The GCF of 2 and 9 is 1. To calculate the greatest common factor of 2 and 9, we need to factor each number (factors of 2 = 1, 2; factors of 9 = 1, 3, 9) and choose the greatest factor that exactly divides both 2 and 9, i.e., 1.

How to Find the GCF of 2 and 9 by Long Division Method?

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

What is the Relation Between LCM and GCF of 2, 9?

The following equation can be used to express the relation between Least Common Multiple (LCM) and GCF of 2 and 9, i.e. GCF × LCM = 2 × 9.

How to Find the GCF of 2 and 9 by Prime Factorization?

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

If the GCF of 9 and 2 is 1, Find its LCM.

GCF(9, 2) × LCM(9, 2) = 9 × 2
Since the GCF of 9 and 2 = 1
⇒ 1 × LCM(9, 2) = 18
Therefore, LCM = 18
☛ GCF Calculator

What are the Methods to Find GCF of 2 and 9?

There are three commonly used methods to find the GCF of 2 and 9.

By Prime Factorization
By Euclidean Algorithm
By Long Division

Download FREE Study Materials

GCF and LCM

Math worksheets and
visual curriculum