@@ -0,0 +1,790 @@
+/*%0A * Summation of primes%0A * %0A * Problem 10%0A * %0A * The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.%0A * Find the sum of all the primes below two million.%0A * %0A * Expected result: 142913828922%0A */%0Apublic class Euler10 %7B%0A%0A    public static void main(String%5B%5D args) %7B%0A   %0A        long count = 0;%0A        for (int n=2; n%3C2000000; n++) %7B%0A            if (primo(n) == true)%7B           %0A                count = count + n;%0A            %7D%0A                              %0A        %7D%0A        System.out.println(count);%0A    %7D%0A    %0A    public static boolean primo(int n) %7B%0A        boolean eprimo = true;%0A        int i = 2;%0A        while ((eprimo == true) && (i %3C= (Math.sqrt(n)))) %7B%0A            if ((n %25 i) == 0)%0A                eprimo = false;%0A            else i++;%0A    %7D%0A        return (eprimo); %0A  %7D%0A%7D

add Euler10.java