public class Prime_while
{
    public static void main(String args[]) 
    {
        final int MAX=100;
        int j,k,n;
        System.out.println("All primes in 2.."+MAX+" are: ");
        System.out.print("2");
        n=1;                             //素數(shù)個數(shù)
        k=3;                  //從最小奇數(shù)開始測試,所有偶數(shù)不需測試
        do
        {
            j=3;
            while ((j<k) && (k % j!=0))
                j=j+2;
            if (j>=k)
            {
                System.out.print("\t"+k);
                n++;
                if (n%10==0)  System.out.println();
            }
            k=k+2;                       //測試下一個奇數(shù)是否是素數(shù)
        }  while(k<MAX);
        System.out.println("\nn="+n);
    }
}