Mode:
Duration:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
MODULE PrimeCheck;
IMPORT IO;
VAR nums: ARRAY [0..2] OF INTEGER := [7,10,13];
VAR n, i: INTEGER;
VAR isPrime: BOOLEAN;
BEGIN
FOR n IN nums DO
isPrime := TRUE;
FOR i := 2 TO n-1 DO
IF n MOD i = 0 THEN isPrime := FALSE END;
END;
IO.PutInt(n,0);
IF isPrime THEN IO.PutLn(" is Prime") ELSE IO.PutLn(" is Not Prime") END;
END;
END PrimeCheck.Coding works best on desktop or with an external keyboard.