Primes on Gavin D. Howardhttps://gavinhoward.com/tag/primes/Recent content in Primes on Gavin D. HowardHugoen-usgavin.d.howard@gmail.com (Gavin D. Howard)gavin.d.howard@gmail.com (Gavin D. Howard)Copyright (c) 2018-2023 Gavin D. Howard. All rights reserved.Wed, 27 May 2020 20:46:10 -0600An Interesting Idea About Factoring Integershttps://gavinhoward.com/2020/05/an-interesting-idea-about-factoring-integers/Wed, 27 May 2020 20:46:10 -0600gavin.d.howard@gmail.com (Gavin D. Howard)https://gavinhoward.com/2020/05/an-interesting-idea-about-factoring-integers/I have no clue if this idea is original or not. It may not be.
On Sunday, I had a flash of insight: what if we could use the Greatest Common Divisor (GCD) algorithm to factor an integer N? How could we make it do that?
The answer was clear: make sure all of the possible factors, the primes up to the sqrt(N), are in one of the arguments to the GCD algorithm.