My java code that creates prime tables...seems to be working...but not sure..

/**

 * skynare

 * Prime Testing..

 * Jan 4 2005

 */

import java.io.*;

public class Prime {

    public static boolean isPrime( long p ) {

        //long bound = Math.round( Math.sqrt(p) )++;//ceiling of p^(1/2)

        //boolean found = false;

        for( long i=2; i<=Math.sqrt(p); i++ ) {//starting from the smallest prime

        //to the square root of p.

            if( p%i == 0 ) {//found divisor of p [2, p^(1/2)]

                return false;//so, p is not a prime

            }//if

        }//for

        //not found a divisor of p in [2, p^(1/2)]

        return true;//so, p is a prime.

    }//isPrime



    public static void main ( String args[] ) throws IOException {

        String fileName = "primetable.txt";

        long bound = Math.round( Math.pow(2, 63) ) - 1;

        //long bound = 7919;

        PrintWriter output = new PrintWriter( new OutputStreamWriter(

                            new FileOutputStream(fileName)) );

        int count = 0;

        for( long i=2; i<=bound; i++ ) {

            if( isPrime(i) ) {

                output.print(i+"\t");

                count++;

            }//if

            if( count == 10 ) {

                output.println();

                count = 0;

            }//if

        }//for

        output.close();

    }//main

}//Prime