Prime Numbers with just a while in Java.

Main.java

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner e = new Scanner(System.in);
        int n = e.nextInt();
        int c = 1;
        int p = 2;
        int divisor = 2;
        while (c <= n) {
            if (p % divisor == 0) {
                if (p == divisor) {
                    System.out.print(p + ", ");
                    c++;
                }
                divisor = 2;
                p++;
            } else {
                divisor++;
            }
        }
    }
}