GCF of 26 and 65
GCF of 26 and 65 is the largest possible number that divides 26 and 65 exactly without any remainder. The factors of 26 and 65 are 1, 2, 13, 26 and 1, 5, 13, 65 respectively. There are 3 commonly used methods to find the GCF of 26 and 65 - long division, prime factorization, and Euclidean algorithm.
1. | GCF of 26 and 65 |
2. | List of Methods |
3. | Solved Examples |
4. | FAQs |
What is GCF of 26 and 65?
Answer: GCF of 26 and 65 is 13.
Explanation:
The GCF of two non-zero integers, x(26) and y(65), is the greatest positive integer m(13) that divides both x(26) and y(65) without any remainder.
Methods to Find GCF of 26 and 65
The methods to find the GCF of 26 and 65 are explained below.
- Prime Factorization Method
- Using Euclid's Algorithm
- Long Division Method
GCF of 26 and 65 by Prime Factorization
Prime factorization of 26 and 65 is (2 × 13) and (5 × 13) respectively. As visible, 26 and 65 have only one common prime factor i.e. 13. Hence, the GCF of 26 and 65 is 13.
GCF of 26 and 65 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 = 65 and Y = 26
- GCF(65, 26) = GCF(26, 65 mod 26) = GCF(26, 13)
- GCF(26, 13) = GCF(13, 26 mod 13) = GCF(13, 0)
- GCF(13, 0) = 13 (∵ GCF(X, 0) = |X|, where X ≠ 0)
Therefore, the value of GCF of 26 and 65 is 13.
GCF of 26 and 65 by Long Division
GCF of 26 and 65 is the divisor that we get when the remainder becomes 0 after doing long division repeatedly.
- Step 1: Divide 65 (larger number) by 26 (smaller number).
- Step 2: Since the remainder ≠ 0, we will divide the divisor of step 1 (26) by the remainder (13).
- Step 3: Repeat this process until the remainder = 0.
The corresponding divisor (13) is the GCF of 26 and 65.
☛ Also Check:
- GCF of 36 and 63 = 9
- GCF of 15 and 20 = 5
- GCF of 30 and 75 = 15
- GCF of 32 and 72 = 8
- GCF of 36 and 42 = 6
- GCF of 4 and 10 = 2
- GCF of 35 and 49 = 7
GCF of 26 and 65 Examples
-
Example 1: The product of two numbers is 1690. If their GCF is 13, what is their LCM?
Solution:
Given: GCF = 13 and product of numbers = 1690
∵ LCM × GCF = product of numbers
⇒ LCM = Product/GCF = 1690/13
Therefore, the LCM is 130. -
Example 2: Find the GCF of 26 and 65, if their LCM is 130.
Solution:
∵ LCM × GCF = 26 × 65
⇒ GCF(26, 65) = (26 × 65)/130 = 13
Therefore, the greatest common factor of 26 and 65 is 13. -
Example 3: Find the greatest number that divides 26 and 65 exactly.
Solution:
The greatest number that divides 26 and 65 exactly is their greatest common factor, i.e. GCF of 26 and 65.
⇒ Factors of 26 and 65:- Factors of 26 = 1, 2, 13, 26
- Factors of 65 = 1, 5, 13, 65
Therefore, the GCF of 26 and 65 is 13.
FAQs on GCF of 26 and 65
What is the GCF of 26 and 65?
The GCF of 26 and 65 is 13. To calculate the GCF (Greatest Common Factor) of 26 and 65, we need to factor each number (factors of 26 = 1, 2, 13, 26; factors of 65 = 1, 5, 13, 65) and choose the greatest factor that exactly divides both 26 and 65, i.e., 13.
How to Find the GCF of 26 and 65 by Long Division Method?
To find the GCF of 26, 65 using long division method, 65 is divided by 26. The corresponding divisor (13) when remainder equals 0 is taken as GCF.
What is the Relation Between LCM and GCF of 26, 65?
The following equation can be used to express the relation between Least Common Multiple (LCM) and GCF of 26 and 65, i.e. GCF × LCM = 26 × 65.
How to Find the GCF of 26 and 65 by Prime Factorization?
To find the GCF of 26 and 65, we will find the prime factorization of the given numbers, i.e. 26 = 2 × 13; 65 = 5 × 13.
⇒ Since 13 is the only common prime factor of 26 and 65. Hence, GCF (26, 65) = 13.
☛ Prime Numbers
What are the Methods to Find GCF of 26 and 65?
There are three commonly used methods to find the GCF of 26 and 65.
- By Prime Factorization
- By Long Division
- By Euclidean Algorithm
If the GCF of 65 and 26 is 13, Find its LCM.
GCF(65, 26) × LCM(65, 26) = 65 × 26
Since the GCF of 65 and 26 = 13
⇒ 13 × LCM(65, 26) = 1690
Therefore, LCM = 130
☛ Greatest Common Factor Calculator
visual curriculum