RosettaCodeData/Task/Primality-by-trial-division/True-BASIC/primality-by-trial-division.basic
2023-07-01 13:44:08 -04:00

20 lines
419 B
Text

FUNCTION isPrime (n)
IF n = 2 THEN
LET isPrime = 1
ELSEIF n <= 1 OR REMAINDER(n, 2) = 0 THEN
LET isPrime = 0
ELSE
LET isPrime = 1
FOR i = 3 TO INT(SQR(n)) STEP 2
IF REMAINDER(n, i) = 0 THEN
LET isPrime = 0
EXIT FUNCTION
END IF
NEXT i
END IF
END FUNCTION
FOR n = 1 TO 50
IF isPrime(n) = 1 THEN PRINT n;
NEXT n
END