60577 Pheredhel package sieb; public class Sieb { public static void printNonPrimes(int max){ boolean nonprime[] =new boolean[max+1]; for (int i = 2; i <= max;++i){ nonprime[i] = false; } int i = 2; while (i*i <= max){ if ( !nonprime[i]){ for (int j = i*i; j <= max;j+=i){ nonprime[j] = true; } } ++i; } for (int j = 2; j<=max;++j){ if (nonprime[j]){ System.out.println(j); } } } public static void main(String args[]){ printNonPrimes(100); } } 3419495059 None Java TRUE