PRIME NUMBER ALGORITHM


1.   PICK A NUMBER 
2.   DIVIDE THAT NUMBER BY 2
3.   IF THE NUMBER IS EVENLY DIVISIBLE BY 2, 
     WRITE"NOT A PRIME NUMBER, DIVISIBLE BY 2" AND GO TO STEP #12, OTHERWISE,CONTINUE.
4.   DIVIDE THE NUMBER BY 3
5.   IF THE NUMBER IS EVENLY DIVISIBLE BY 3, 
     WRITE  "NOT A PRIME NUMBER, DIVISIBLE BY 3" AND GO TO STEP #12,OTHERWISE,CONTINUE.
6.   DIVIDE THE NUMBER BY 5
7.   IF THE NUMBER IS EVENLY DIVISIBLE BY 5, 
     WRITE "NOT A PRIME NUMBER, DIVISIBLE BY 5" AND GO TO STEP #12, OTHERWISE,CONTINUE.
8.   DIVIDE THE NUMBER BY THE NEXT ODD NUMBER
9.   IF THE NUMBER IS EVENLY DIVISIBLE BY THE NEXT ODD NUMBER, WRITE: "NOT
     A PRIME NUMBER, DIVISIBLE BY "(PUTTING IN THE NUMBER THAT YOU
     DIVIDED BY).
10.  KEEP DIVIDING UNTIL YOUR DIVIDING NUMBER IS EQUAL TO, OR GREATER THAN, 
     YOUR TEST  NUMBER.
11.  IF YOUR TEST NUMBER IS NOT DIVISIBLE BY ANY OF THESE NUMBERS, THEN WRITE: 
     "(TEST NUMBER) IS A PRIME NUMBER", FILLING IN THE WORDS "TEST NUMBER" WITH
     THE NUMBER YOU CHOSE IN THE FIRST STEP.
12.  cHOOSE ANOTHER NUMBER OR END.