prime finder

0 rem Update mar 17: Program now runs about 5% faster. Yes i know this is useless.

10 text : home : ?"Prime numbers":?" "; : onerr goto 50

20 for N = 5 to 1321 step 2 : SN = N^0.5 : for P = 3 to SN step 2
30 if int(N/P) = N/P then next N
40 next P : print N;" "; : next N
50 end