PRIME NUMBER 

1.  REM PRIME NUMBER 
2.  PRINT "TYPE IN AN INTEGER:"
3.  INPUT X
4.  DIVIDE X BY 2 TO OBTAIN A QUOTIENT, Q
5.  PRINT Q
6.  IF DIVISIBLE BY 2, GO TO STEP 7
7.  PRINT "NUMBER IS NOT PRIME"
8.  IF NOT DIVISIBLE BY 2, GO TO STEP 9
9.  START WITH D=3 AS A DIVISOR
10. DIVIDE X BY D TO OBTAIN A QUOTIENT, Q
11. IF Q IS AN INTEGER, THEN THE ORIGINAL NUMBER X IS NOT PRIME
12. INCREASE D BY ADDING 2 TO IT
13. DIVIDE X BY D TO OBTAIN A QUOTIENT, Q
14. IF Q IS AN INTEGER, THEN THE ORIGINAL NUMBER X IS NOT PRIME
15. REPEAT STEPS 12, 13 AND 14 UNTIL X IS NOT DIVISIBLE BY AN ODD NUMBER SMALLER THAN ITSELF
16. IF YOU GET THIS FAR WITHOUT FINDING AN INTEGER QUOTIENT IN STEP 11, THEN X IS PRIME
17. PRINT "NUMBER IS PRIME", GO TO 18
18. END