(34S) Prime Factors

[Thomas Klemm]

(05-30-2014 03:54 AM)Dave Britten Wrote:  

(05-30-2014 03:30 AM)Thomas Klemm Wrote:  You could use NEXTP to find the next prime.

Cheers
Thomas

Now that's interesting. I just replaced the MOD 30 loop with NEXTP to get the next candidate factor, and it took about 10 times as long to factor 167,699,497 - about 20 seconds. Knowing the amount of work NEXTP probably has to do with each call, I guess that's not a huge surprise.

After a 2nd thought: that was maybe a bad idea.
Well, it depends on how NEXTP is implemented.
But then have a look at the code of PF: I was not the first one to come up with this idea.
Just tested 167,699,497 on the iPhone with PF and it was reasonably fast: maybe a second to find the factor 3,851. Is the iPhone so much faster than the original WP-34s?

Cheers
Thomas