Calculating Primes

Prime.java

 /**************************************************
 *  Basic program to check for primes (no optimisation)
 *
 *  @author   James Drew    <j.drew1303@gmail.com>
 *  @version  1.0
 *  @since    10-11-2012
 *************************************************/
class Prime
{
  public static void main (String[] args)
  {
    int number = 1000000;
    //Prints all primes between 2 and 100
    // 3, 5, 7, 9,....,97
    for(int i = 3; i <= number; i++)
    {
      if (isPrime(i))
      {
        System.out.println(i);
      }
    }
  }

 /**************************************************
 *  Method to check for primes
 *
 *  @param  int number  Takes an integer number as input
 *  @return boolean     Returns a boolean that indicates if the numeber is prime
 **************************************************/
  //Is prime function
  public static boolean isPrime(int number)
  {
    int i = 2;

    if (number == 2)
    {
      return true;
    }
    while (i < number)
    {
      if ((number % i) == 0)
      {
        return false;
      }
      i++;
    }
    return true;
  }
}