// CSE 142, Autumn 2009, Marty Stepp
// This program sees whether some interesting numbers are prime.
// It uses our FactorsModule "module" class to do this.

public class Primes1 {
    public static void main(String[] args) {
        int[] nums = {1234517, 859501, 53, 142};
        for (int i = 0; i < nums.length; i++) {
            if (FactorsModule.isPrime(nums[i])) {
                System.out.println(nums[i] + " is prime");
            }
        }
    }
}