Yeah, I’m not even close!! More like the movie Groundhog Day.
So far the journey has been really rewarding though. I’ve recently been focusing my efforts on remainders and decision paths.
The most invaluable lessons learned have been my understanding of the complexity of simplicity.
I’ve written some insanely complicated, convoluted and frankly weird ass code throughout all this.
For example: bignum math libraries, modified Euclidean geometry, imaginary number libs, fractal factoring, Russian peasant multiplication, 3D volumetric fluids to triangle area fitting. Multiple geometric shape fitting libraries, Gallois fields and lots and lots of weird what-if code that popped up in my head.
I’d always been good at algorithms, but straightforward head-first attacks of the problem always ends in failure.
Now I’ve learned to build analysis, statistics and proofs by necessity. It’s completely changed my mindset on design. (Obviously I studied far my comp-sci than mathematics.)
Other than sieving and brute force, I think the only other general solution to be a sort of ‘halving’ problem.
The relation between factors and q is essential sum or area. You can subdivide either into n buckets and remainders building a tree of nodes iteratively. At many nodes I have found some interesting patterns. I find nodes after some iterations that sum up to a factor. So now my question is finding the path every time.
Anyway, best of luck on your journey and enjoy the ride! Maybe in another few years somebody will finally slay this beast.