# Slow factoring algorithm II

I was considering the algorithm described in the parent post, and realized suddenly that the possible ‘clever method’ to speed up the algorithm is complete nonsense. In particular, this simply reduces to trial division (except slightly obscured, so still slower). But the partition thing is still pretty cool, I think.

But I’ve suddenty become interested in different factoring algorithms again, and I think that I’ll make a series on factoring methods out there.

This entry was posted in Expository, Math.NT, Math.REC, Mathematics. Bookmark the permalink.