RPL second impressions (HP 28)

[Thomas Klemm]

(06-30-2018 03:32 PM)Gerson W. Barbosa Wrote:  All previous ones don’t work either when n<4.

There's a problem with the FOR-loop in that it gets executed at least once even when the upper limit is smaller than the start value.

Try this line:

Quote:3 1 FOR i i END

This leaves the value 3 on the stack.
I'd prefer if the stack was left unchanged instead.

Now you can either handle that special case beforehand or then just call it a day.
How often will you use that program to check that 3 is a prime?

Cheers
Thomas