/*
* Prime Checker
* Kenneth Powers
*
* check() accepts a long integer and returns true or false as a boolean
*/
public class prime
{
boolean prime;

public boolean check(long n)
{
for(int i = 2; i < Math.sqrt((double)n); i++)
{
// set check to true for the first go
if(n==2)
{
prime = true;
}

// test for primeness
if(n%i==0)
{
prime = false;
break;
}
}
//Return The Result
if(prime == true)
{
return true;
} else {
return false;
}
}
}

/*
* This program will find all prime numbers between 2 given long integers
*/

//Import Scanner
import java.util.Scanner;
public class main
{

/**
* @param args
*/
public static void main(String[] args)
{
//Set up scanner
Scanner sc = new Scanner(System.in);

//Set up prime checker
prime p = new prime();

//Declare variables
long firstNumber, secondNumber;

//Get numbers from user
System.out.print("Enter the first number: ");
firstNumber = sc.nextLong();
System.out.print("Enter the second number: ");
secondNumber = sc.nextLong();

//Start crunching (alright! (borat))
System.out.println("It's HAMMER TIME!");
for(long i = firstNumber; i < secondNumber; i++)
{
if(p.check(i))
{
System.out.println("Prime Number: " + i);
}
}
System.out.println("Done!");

}

}

Enter the first number: 1
Enter the second number: 10
It's HAMMER TIME!
Done!

/*
* Prime Checker
* Kenneth Powers
*
* check() accepts a long integer and returns true or false as a boolean
*/
public class prime
{
    /* No need for boolean prime; explained later */
    public boolean check(long n)
    {
        for(int i = 2; i < Math.sqrt((double)n); i++)
        {
            /* No need to check for n==2 as (2 < sqrt(2)) is always false */
            // test for primeness
            if(n%i==0)
            {
                /* Since 'n' isn't prime, just return, no need to take a break */
                return false;
            }
        }

        /* Provided 'prime' was still around, we could return it at this point.
           But since it isn't, and we know the number is prime, return true. */
        return true;
    }
}