The Geometric Representation of Greatest Common Factor

A factor is an integer that divides another integer. The number 6 is a factor of 12 since 6 divides 12. It is easy to see that 1, 2, 3, 4, and 12 are also factors of 12. Looking at the numbers in the tables below, we can see that some numbers have only 2 factors, […]
Continue reading…

 

Euclidean Algorithm Explained for Elementary School

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 […]
Continue reading…

Related Posts Plugin for WordPress, Blogger...