/*
    CheckForPrime2.java
    David G. Klick
    September 28, 2007
    CIS 111
 
    Demonstrates nested loops used to check for primes.
*/ 

public class CheckForPrime2 extends CIS111App {
    public static void main(String[] args) {
        int i, n;

        println("\nThis program checks numbers to see if they are prime\n");
      
        n = getInt("Enter a positive integer to be checked for primality ('0' to quit): ");
        while (n != 0) {
            if (n < 0) {
                println("Invalid integer entered");
            } else {
                boolean prime = true;
                i = n / 2;
                while ((prime==true) && (i > 1)) {
                    if (n % i == 0) {
                        prime = false;
                    }
                    i = i - 1;
                }
                if (prime) {
                    println(n + " is prime");
                } else {
                    println(n + " is not prime");
                }
            }
            n = getInt("Enter a positive integer to be checked for primality ('0' to quit): ");
        }
    }
}