Prime number finder HP11C?

[jbhp55]

Hi Valentin,

thank you for your very instructive post. This is a useful technique, especially for more complex programs. Thank you for teaching me!

If there are more programs in memory, one extra GTO would be required, which would still leave the program one step shorter than the original.

I wonder if anyone can make a shorter program which satisfies the conditions.

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.

Best regards,

Jaap.