Calcolatore del Massimo Comune Divisore — Formula

## How to Find the Greatest Common Factor

### Methods

**Method 1: Prime Factorization**
1. Find the prime factors of each number
2. Identify the common prime factors
3. Multiply the common factors together

**Method 2: Euclidean Algorithm**
1. Divide the larger number by the smaller
2. Replace the larger number with the remainder
3. Repeat until the remainder is 0
4. The last non-zero remainder is the GCF

### Useful Identity

**GCF(a, b) × LCM(a, b) = a × b**