Finished a couple of tests on the products of some random 9 digit prime numbers. Stopped testing a bit "early" as I didn't see any benefit in the code running for days.
Output posted at pastebin.com/Y0tvNJHu and the summary is in the attached pic.
The performance is pretty close to n/2. And it works.
>Breaking the problem down.
>First by roots.
>Then by triangular numbers.
Thank you for this.
I don't believe removing the higher end of the remainder portion or the u/2 parse tree >>5299 are going to get us the required efficiencies.
So back to trying to integrate the factor tree.