Evo koda:
import java.util.Scanner;
public class PronalazacProstihBrojeva
{
public static void main(String[] args)
{
System.out.println("Koji prost broj zelite?");
Scanner ulaz = new Scanner(System.in);
int x = ulaz.nextInt();
int[] niz = new int[x];
for (int i = 0; i < x; i++)
{
if (i == 0)
{
niz[i] = 1;
continue;
}
for (int j = i; j < Integer.MAX_VALUE; j++)
{
if (jesteProst(j))
{
niz[i] = j;
if (niz[i] > niz[i - 1])
break;
else
continue;
}
else
continue;
}
}
System.out.println(x + ". prost broj je: " + niz[x - 1]);
}
public static boolean jesteProst(int n)
{
if (n == 2)
return true;
if (n % 2 == 0)
return false;
for (int i = 3; i <= Math.sqrt(n); i += 2)
{
if (n % i == 0)
return false;
}
return true;
}
}