In this blog post, we describe a factorization method that possibly has not been discussed before. It is best to show via an example:

Factor :

We first start by putting here:

We then place a to the left of .

We define an operation as adding from the left and removing from the right. So after one operation, we have:

After every operation, we check for coprimality (defined as if the two numbers are coprime). If they are coprime, we continue until they are no longer coprime. Here, another operation takes us here.

Here, the GCF is 2, which implies a common factor. We place 2 on a list and divide the two numbers by 2:

Prime factors

We continue:

Prime factors
Prime factors
Prime factors
Prime factors
Prime factors

We keep on going, and find out that even at 18 operations, the numbers are still coprime:

Prime factors

To this, we say that the left number is a prime factor of , and we end by removing the temporary storage we used to store the two numbers.

Prime factors

From here, we get the prime factorization of : .

This factorization method is truly unique.