Math on Gavin D. Howardhttps://gavinhoward.com/category/math/Recent content in Math 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.Mon, 24 Apr 2023 21:13:38 -0600The Most Annoying Math Problemhttps://gavinhoward.com/2023/04/the-most-annoying-math-problem/Mon, 24 Apr 2023 21:13:38 -0600gavin.d.howard@gmail.com (Gavin D. Howard)https://gavinhoward.com/2023/04/the-most-annoying-math-problem/Assumed Audience: Hackers, mathematicians, and cryptographers. Discuss on Hacker News.
Epistemic Status: About as confident as a lone gazelle on the savannah.
When I attended university, there was one class that defied all of my expectations: Theory of Computation.
First of all, it did not have much theory. Second, it had a lot of applied math. Third, I expected it to be useless, but I came out of that class with two fantastically important things.An 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.