fastest way to find gcf
Answer Wiki. The Euclidean Algorithm is the fastest way to find the GCD (greatest common divisor, also called the highest common factor) of two numbers. Then to get the least common multiple, divide that GCD into one of the two numbers and multiply the result by the other.