HP 41C Pollard Brent Integer Factorization

[Gerald H]

(07-07-2014 12:02 PM)Joe Horn Wrote:  

(07-07-2014 06:04 AM)Jim Horn Wrote:  A modulo 210 brute force factoring on the HP-67 took 0.1042*sqrt(x) seconds in 1979. The HP-41 averaged 3 times that speed. So your example would take around 58 minutes. (CF "Finding Factors Faster", PPC Journal, mid-Cretaceous epoch, by some old phart)

Cool. Oh yeah, I forgot that it only needs to go up to the square root of the input, not the whole way. So instead of NP taking 38 years, it should take about 3 hours 20 minutes. Quite a difference!

So 3 hrs 20 mins versus 37 mins with a bad seed choice.

Is the NP programme written in a lower level language?

Where can I find documentation on "Finding Factors Faster"?

If you're interested, have a look at the performance of POBR on the WP 34S.