GCF of 78 and 95 = 1 (Coprime)
Quick Answer
GCF(78 and 95) = 1. 78 and 95 are coprime (share only the divisor 1).
Common divisors: 1. Related LCM: 7410.
GCF Calculator
Step-by-Step: Euclidean Algorithm
The Euclidean algorithm finds the GCF by repeated division: divide the larger by the smaller, replace with the remainder, repeat until the remainder is 0. The last non-zero divisor is the GCF.
| Step | Dividend ÷ Divisor | Quotient | Remainder |
|---|---|---|---|
| 1 | 95 ÷ 78 | 1 | 17 |
| 2 | 78 ÷ 17 | 4 | 10 |
| 3 | 17 ÷ 10 | 1 | 7 |
| 4 | 10 ÷ 7 | 1 | 3 |
| 5 | 7 ÷ 3 | 2 | 1 |
| 6 | 3 ÷ 1 | 3 | 0 |
GCF(78 and 95) = 1
Common Divisors of 78 and 95
Since 78 and 95 are coprime, the only common divisor is 1.
78 and 95 Are Coprime
Two (or more) integers are coprime (also called relatively prime) when their GCF equals 1 — they share no common divisors other than 1. 78 and 95 qualify.
Note: coprime numbers do not need to be prime individually. For example, 8 and 15 are coprime (GCF = 1), but neither is prime — 8 = 2³ and 15 = 3 × 5 share no prime factors.
Related: LCM of 78 and 95
LCM(78, 95) = 7410
Derived from the identity LCM(a, b) × GCF(a, b) = a × b:
LCM = (78 × 95) ÷ GCF = 7410 ÷ 1 = 7410
See the dedicated LCM of 78 and 95 page for the full common-multiples list and step-by-step derivation.
Explore Each Number Individually
How to Find the Greatest Common Factor
The Greatest Common Factor (GCF) of two or more numbers is the largest positive integer that divides each of the numbers without leaving a remainder.
Method 1: Euclidean Algorithm (used above)
- Divide the larger number by the smaller. Note the remainder.
- Replace the pair (larger, smaller) with (smaller, remainder).
- Repeat until the remainder is 0. The last non-zero divisor is the GCF.
Method 2: Listing Factors
- List all factors of each number
- Identify the factors that appear in all lists (common factors)
- Select the largest common factor — this is the GCF
Method 3: Prime Factorization
- Find the prime factorization of each number
- Identify which prime factors appear in all factorizations
- For each common prime factor, take the lowest exponent
- Multiply these prime factors raised to their lowest exponents
GCF = product of (common prime factors)lowest exponent
Example: GCF(12, 18) using prime factorization
- 12 = 2² × 3¹
- 18 = 2¹ × 3²
- Common primes: 2 and 3 — take the lowest exponent of each
- GCF = 2¹ × 3¹ = 6
Nearby GCF Examples
| Pair | GCF |
|---|---|
| 75 and 100 | 25 |
| 72 and 96 | 24 |
| 60 and 90 | 30 |
| 45 and 60 | 15 |
| 100 and 150 | 50 |
| 36 and 48 | 12 |
Frequently Asked Questions
What is the GCF of 78 and 95?
GCF(78 and 95) = 1. This is the largest integer that divides each of the inputs without remainder.
How do you find the GCF of 78 and 95?
Apply the Euclidean algorithm (see the step-by-step table above). For 3 numbers, reduce pairwise: GCF(a, b, c) = GCF(GCF(a, b), c).
Are 78 and 95 coprime?
Yes. 78 and 95 are coprime (relatively prime) because their GCF is 1 — they share no common divisor other than 1.
What are coprime numbers?
Two or more numbers are coprime (or relatively prime) if their GCF is 1. Example: GCF(8, 15) = 1.
What are other names for GCF?
The GCF is also known as GCD (Greatest Common Divisor, math) and HCF (Highest Common Factor, British education). All three terms are equivalent.
Related Calculators
- LCM of 78 and 95 = 7410
- Prime Factorization Calculator
- Divisors of a Number
- Multiples of a Number
- Fraction Calculator
- Fraction Simplifier (uses GCF to reduce fractions)
GCF Calculator
Popular GCF Calculations
Top greatest common factor calculations: