FindNPrimes

    // Sieve of erosthenes
	public static void primes(int n){
		Boolean[] prime = new Boolean[n+1];
		
		for(int i=2;i<=n;i++){
			prime[i] = true;
		}
		
		for(int div=2;div*div<=n;div++){
			if(prime[div] == true){
				for(int i=2*div;i<=n;i=i+div){
					prime[i] = false;
				}
			}
		}
		
		for(int i=2;i<=n;i++){
			if(prime[i]){
				System.out.print(i+ " ");
			}
		}
		
	}