Prime Number Search

[Allen]

(07-19-2024 01:40 PM)SlideRule Wrote:  ...it is quicker to search for the numbers that are NOT PRIME....

for \( n > 2^{32} \) this is less true.

Far more interesting rabbit hole than S.o.E on a calculator: https://github.com/bbuhrow/yafu

I think

Code:


100 FOR 1=1 TO 1000
110 IF A(I)=0 THEN PRINT I;
120 NEXT I

should be

Code:


100 FOR I=1 TO 1000         # <----   change int 1 to variable "I"
110 IF A(I)=0 THEN PRINT I;
120 NEXT I