Prime Factors in the ALPHA REG.
|
12-10-2015, 06:25 PM
Post: #18
|
|||
|
|||
RE: Prime Factors in the ALPHA REG.
(12-10-2015 05:43 PM)fhub Wrote:(12-10-2015 05:24 PM)Dieter Wrote: BTW, is there a special reason why in this thread noone ever mentioned the NEXTP function to obtain the next divisor? Instead the programs simply test all odd divisors. #-)I remember that long time ago a member here mentioned, that NEXTP (which is still in my original version in the WP34s library) would be MUCH slower (on a real calc) than simply using INC, so I've changed this for the current version. Ok, I've now checked both versions with the emulator, I've used the biggest 12-digit primenumber 999999999989: the new version (with INC X, EVEN?, INC X) needs about 5 secs and the old version (with NEXTP) needs about 50 secs, i.e. it is 10-times slower! (I don't think this would be much different on a real WP34s) Franz |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 1 Guest(s)