@@ -0,0 +1,1035 @@
+/*%0A * 10001st prime%0A * %0A * Problem 7%0A * %0A * By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.%0A *%0A * What is the 10 001st prime number?%0A * %0A * Expected result: 104743%0A */%0Apublic class Euler7 %7B%0A%0A    public static void main(String%5B%5D args) %7B%0A%0A        int count = 0;%0A        for (int n=1; n%3E0; n++) %7B%0A            if (primo(n) == true)%7B           // chama a fun%C3%A7%C3%A3o que verifica se %C3%A9 primo e em caso positivo continua..%0A                count++;%0A                if (count-1 == 10001)%7B   %09%09// para quando chegar no 10001%C2%BA primo%0A                    System.out.println(n);%0A                    break;%0A                %7D                          %0A            %7D        %0A        %7D %0A    %7D%0A%0A    public static boolean primo(int n) %7B%0A%0A        boolean eprimo = true;%0A        int i = 2;%0A        while ((eprimo == true) && (i %3C= (Math.sqrt(n)))) %7B%0A            if ((n %25 i) == 0)%7B  %0A                eprimo = false;%0A            %7D%0A            else%7B i++;%0A            %7D%0A        %7D%0A        return (eprimo); %0A    %7D%0A%7D

add Euler7.java