IsPrime

gistfile1.txt

/**
 * Checks if input is a prime number.
 * 
 * Jake Landaiche 
 * 1.0.0 
 */
import java.util.*;
public class isPrime
{
    Scanner sc = new Scanner(System.in);
    public isPrime()
    {
        System.out.println("Enter an Integer: ");
        int x = 1;
        // initialise instance variables
        while(x<100){
            
            boolean y = isAPrime(x);
            if(y == true)
            System.out.println(x);
            x++;
        }
    }

    public boolean isAPrime(int y)
    {
        int counter = 2;

        while(counter<=y){
            if(y==2 || y==1){ 
                //System.out.println("This is a prime number!");
                return true;
            }else if(y%counter == 0 && y != 2){
                //counter = 2;
                //System.out.println("This is not a prime number");
                return false;
            } else {
                counter++;
                if(counter == y){
                    //System.out.println("This is a prime number!");
                    return true;
                }
            }
        }
        return false;
    }
}