HCF of 9 and 11
HCF of 9 and 11 is the largest possible number that divides 9 and 11 exactly without any remainder. The factors of 9 and 11 are 1, 3, 9 and 1, 11 respectively. There are 3 commonly used methods to find the HCF of 9 and 11 - prime factorization, long division, and Euclidean algorithm.
1. | HCF of 9 and 11 |
2. | List of Methods |
3. | Solved Examples |
4. | FAQs |
What is HCF of 9 and 11?
Answer: HCF of 9 and 11 is 1.
Explanation:
The HCF of two non-zero integers, x(9) and y(11), is the highest positive integer m(1) that divides both x(9) and y(11) without any remainder.
Methods to Find HCF of 9 and 11
Let's look at the different methods for finding the HCF of 9 and 11.
- Prime Factorization Method
- Using Euclid's Algorithm
- Long Division Method
HCF of 9 and 11 by Prime Factorization
Prime factorization of 9 and 11 is (3 × 3) and (11) respectively. As visible, there are no common prime factors between 9 and 11, i.e. they are co-prime. Hence, the HCF of 9 and 11 will be 1.
HCF of 9 and 11 by Euclidean Algorithm
As per the Euclidean Algorithm, HCF(X, Y) = HCF(Y, X mod Y)
where X > Y and mod is the modulo operator.
Here X = 11 and Y = 9
- HCF(11, 9) = HCF(9, 11 mod 9) = HCF(9, 2)
- HCF(9, 2) = HCF(2, 9 mod 2) = HCF(2, 1)
- HCF(2, 1) = 1 (∵ HCF(X, 1) = 1)
Therefore, the value of HCF of 9 and 11 is 1.
HCF of 9 and 11 by Long Division
HCF of 9 and 11 is the divisor that we get when the remainder becomes 0 after doing long division repeatedly.
- Step 1: Divide 11 (larger number) by 9 (smaller number).
- Step 2: Since the remainder ≠ 0, we will divide the divisor of step 1 (9) by the remainder (2).
- Step 3: Repeat this process until the remainder = 0.
The corresponding divisor (1) is the HCF of 9 and 11.
☛ Also Check:
- HCF of 40, 42 and 45 = 1
- HCF of 506 and 1155 = 11
- HCF of 513, 1134 and 1215 = 27
- HCF of 25 and 36 = 1
- HCF of 34 and 85 = 17
- HCF of 70, 105 and 175 = 35
- HCF of 72, 126 and 168 = 6
HCF of 9 and 11 Examples
-
Example 1: For two numbers, HCF = 1 and LCM = 99. If one number is 9, find the other number.
Solution:
Given: HCF (y, 9) = 1 and LCM (y, 9) = 99
∵ HCF × LCM = 9 × (y)
⇒ y = (HCF × LCM)/9
⇒ y = (1 × 99)/9
⇒ y = 11
Therefore, the other number is 11. -
Example 2: The product of two numbers is 99. If their HCF is 1, what is their LCM?
Solution:
Given: HCF = 1 and product of numbers = 99
∵ LCM × HCF = product of numbers
⇒ LCM = Product/HCF = 99/1
Therefore, the LCM is 99. -
Example 3: Find the HCF of 9 and 11, if their LCM is 99.
Solution:
∵ LCM × HCF = 9 × 11
⇒ HCF(9, 11) = (9 × 11)/99 = 1
Therefore, the highest common factor of 9 and 11 is 1.
FAQs on HCF of 9 and 11
What is the HCF of 9 and 11?
The HCF of 9 and 11 is 1. To calculate the HCF (Highest Common Factor) of 9 and 11, we need to factor each number (factors of 9 = 1, 3, 9; factors of 11 = 1, 11) and choose the highest factor that exactly divides both 9 and 11, i.e., 1.
How to Find the HCF of 9 and 11 by Long Division Method?
To find the HCF of 9, 11 using long division method, 11 is divided by 9. The corresponding divisor (1) when remainder equals 0 is taken as HCF.
What are the Methods to Find HCF of 9 and 11?
There are three commonly used methods to find the HCF of 9 and 11.
- By Long Division
- By Listing Common Factors
- By Prime Factorization
How to Find the HCF of 9 and 11 by Prime Factorization?
To find the HCF of 9 and 11, we will find the prime factorization of the given numbers, i.e. 9 = 3 × 3; 11 = 11.
⇒ There is no common prime factor for 9 and 11. Hence, HCF (9, 11) = 1.
☛ Prime Number
If the HCF of 11 and 9 is 1, Find its LCM.
HCF(11, 9) × LCM(11, 9) = 11 × 9
Since the HCF of 11 and 9 = 1
⇒ 1 × LCM(11, 9) = 99
Therefore, LCM = 99
☛ Highest Common Factor Calculator
What is the Relation Between LCM and HCF of 9, 11?
The following equation can be used to express the relation between LCM and HCF of 9 and 11, i.e. HCF × LCM = 9 × 11.
visual curriculum