In number theory, the **Euclidean algorithm** is a method for getting the greatest common factor (GCF) or highest common factor (HCF) of two positive integers. It is usually used for larger numbers since prime factorization can be used to get the greatest common factor of small numbers. Many students are confused with this method, but if you look at it closely, even elementary students can actually do it.

Let us start with an example. Note that in the discussion below, we will use the terms **dividend** and **divisor**. In the division *a* ÷ *b*, *a* is the dividend and* b* is the divisor. Continue reading