HP Forums

Full Version: Finding prime factors on a "non-programmable" calculator
You're currently viewing a stripped down version of our content. View the full version with proper formatting.

Article describing a new approach to finding prime factors on the "non-programmable" HP-17bii.

Thanks Don!

I am continuously learning more about the power of the 17b solver!



Hey, how long does it take to do the same example (6,469,693,230) for each of the factors for which the time in minutes was given for the non optimized version?

Here are the timings, in seconds, for the old version from the Tech. Applications manual, and my version:

factor old version new version
2 2 2
3 2 2
5 2 2
7 2 2
11 105 2
13 33 2
17 10 2
19 4 2
23 2 2
29 2 2

After posting the article, I had to make a change. I thought I could adjust variable TF (beginning trial factor) to the current factor and avoid going back to trial factor 3 each time, but I forgot that the Technical Applications manual states on page 25:

Any attempt to alter the values of the (loop control variables) using the LET function causes the solver to create separate variables of the same name.

Therefore, the loop to find factors must always start at 3, the beginning value of the loop control value cannot be adjusted when a factor is found.

Actually, the original version does work because what you can't do is modify any of the loop control variables from within the loop in an attempt to end the loop early, because the real loop control values are inaccessible to the user while within the loop. But the modified version of the program is preferable because (a) you don't have to press INIT before each execution, and (b) starting the loop for trial factors at 3 each time does not significantly increase the run time since n (and, therefore, (n)) is adjusted whenever a factor is found.

Thanks for the cool article.. You're amazing with the 17b solver!