Quote:
Originally Posted by chris2be8
What process have you found? And why are you not satisfied with it?
Chris

The process is basically developing successive iterations of general solutions of a polynomial.
The paths taken within the successive general solutions found and the number of iterations required to obtain a specific factorization are more easily calculated by
randomizing which general solution tree to traverse. A GPUcentric environment works for these kinds of computations but what I am looking for is that single thread that
will work every time for every factorization. The polynomial form that I have considered is always composite and will never consist of a single prime.