Finding prime factors on a "nonprogrammable" calculator  Printable Version + HP Forums (https://archived.hpcalc.org/museumforum) + Forum: HP Museum Forums (https://archived.hpcalc.org/museumforum/forum1.html) + Forum: Old HP Forum Archives (https://archived.hpcalc.org/museumforum/forum2.html) + Thread: Finding prime factors on a "nonprogrammable" calculator (/thread193216.html) 
Finding prime factors on a "nonprogrammable" calculator  Don Shepherd  09042011 Article describing a new approach to finding prime factors on the "nonprogrammable" HP17bii.
Re: Finding prime factors on a "nonprogrammable" calculator  M. Joury  09042011 Thanks Don! I am continuously learning more about the power of the 17b solver! Cheers,
Marwan
Re: Finding prime factors on a "nonprogrammable" calculator  Lode  09042011 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?
Re: Finding prime factors on a "nonprogrammable" calculator  Don Shepherd  09042011 Here are the timings, in seconds, for the old version from the Tech. Applications manual, and my version:
Re: Finding prime factors on a "nonprogrammable" calculator  Don Shepherd  09042011 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:
Quote:
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.
Re: Finding prime factors on a "nonprogrammable" calculator  Don Shepherd  09052011 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.
Re: Finding prime factors on a "nonprogrammable" calculator  Allen  09052011 Thanks for the cool article.. You're amazing with the 17b solver!
