In the previous posts, I have shared to you an alternative algorithm for multiplication and division. In this post, I am going to share with you a different algorithm for performing subtraction. This algorithm does not involve “borrowing” from a higher place value but subtracts individual digits. To illustrate this algorithm, let’s consider some examples. […]

Continue reading…

# High School Number Theory

## 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…

## The Mystery of the Four Consecutive Numbers in the Fibonacci Sequence

The Fibonacci Sequence The Fibonacci sequence is the sequence of integers 0, 1, 1, 2, 3, 5, 8, 13, 21,… or 1, 1, 2, 3, 5, 8, 13, 21, … It is a sequence of numbers that starts with 0 (or 1) and each number is the sum of the previous two. The sequence first appeared in Liber […]

Continue reading…