home *** CD-ROM | disk | FTP | other *** search
- REM PRIME NUMBER FINDER II (PRIME2.BAS)
- CLS
- N = 1
- DO UNTIL N = 0
- PRINT
- INPUT "Enter a positive interger, 0 to exit"; N
- FOR I = 2 TO N - 1
- IF N MOD I = 0 THEN
- PRINT N; "is not a prime"
- PRINT " because it's divisible by"; I
- EXIT FOR
- ELSEIF I = N - 1 THEN PRINT N; "is a prime"
- END IF
- NEXT I
- IF N = 2 THEN PRINT N; "is a prime"
- LOOP
- END
-
-