06-13-2016, 07:15 PM
I'm sure I am 30 odd years too late with this topic, but I am curious to know if it is possible to write a shorter program for the 11C which finds the next prime number. I only recently bought an 11C, and I like it very much. I'd like to know if any of the many features can improve my prime finding program.
The conditions are: start with odd number in x, start program (say A). The first prime number equal or greater than the entered number is displayed (after some time, of course). Push R/S and the next number is shown.
The program steps count. A final RTN may be omitted. No entry of any registers before execution should be necessary.
I have discovered that the 11C is very much slower than a 48G (no surprise), but my last program was 10% faster than the previous.
The conditions are: start with odd number in x, start program (say A). The first prime number equal or greater than the entered number is displayed (after some time, of course). Push R/S and the next number is shown.
The program steps count. A final RTN may be omitted. No entry of any registers before execution should be necessary.
I have discovered that the 11C is very much slower than a 48G (no surprise), but my last program was 10% faster than the previous.