Prime number finder HP11C?

[Gerson W. Barbosa]

(06-17-2016 07:08 AM)jbhp55 Wrote:  Also, I'm interested in the speed of this program on an 11C. I found somewhere in the forum archive a post with speeds for many different calculators, and there were two results for the 11c; I checked, and mine was two times slower!
For this program, mine takes 38 seconds to find 1009 if I start it at 999.

The faster 11C has been modified for double speed. Yours is an original one.

http://www.hpmuseum.org/cgi-sys/cgiwrap/...read=78272

Speedwise, the HP-15C LE is way better: about 150 time faster, which means it takes no more than one fourth of a second to find 1009 in your example.


01 LBL A
02 MATRIX 1
03 STO 0
04 LBL 7
05 2
06 STO + 1
07 RCL 0
08 RCL / 1
09 FRAC
10 x=0
11 GTO 8
12 LST X
13 RCL 1
14 x<= y
15 GTO 7
16 RCL 0
17 R/S
18 LBL 8
19 2
20 RCL + 0
21 GTO A

999 GSB A --> 1009
R/S --> 1013
R/S --> 1019
R/S --> 1021
...

The HP-15C version might be made even shorter by using Valentin's technique. I learned the MATRIX 1 trick in line 2 from him, BTW.

Regards,

Gerson.