@@ -0,0 +1,719 @@
+//Anthony Carpenetti%0D%0A//When executed, Euler7 calculates and prints the 10'001st prime.%0D%0A%0D%0Apublic class Euler7%0D%0A%7B%0D%0A%09public static void main(String%5B%5D args)%0D%0A%09%7B%0D%0A      int lastPrime = 3;%0D%0A%09%09for(int i = 2;i %3C 10002;i++) //from the index i 2 to 10001%0D%0A%09%09%7B%0D%0A         int j = lastPrime + 2;%0D%0A         while(!isPrime(j))%0D%0A         %7B%0D%0A            j += 2;%0D%0A         %7D%0D%0A         lastPrime = j;%0D%0A%09%09%7D%0D%0A      System.out.println(lastPrime);%0D%0A%09%7D%0D%0A%09%0D%0A%09public static boolean isPrime(int n) //returns true if n is prime; returns false if n is not prime%0D%0A%09%7B%0D%0A%09%09if(n %3C= 1)%0D%0A%09%09%7B%0D%0A%09%09%09return false;%0D%0A%09%09%7D%0D%0A%09%09else%0D%0A%09%09%7B%0D%0A%09%09%09for(int i = 2;i %3C n;i++)%0D%0A%09%09%09%7B%0D%0A%09%09%09%09if(n %25 i == 0)%0D%0A%09%09%09%09%7B%0D%0A%09%09%09%09%09return false;%0D%0A%09%09%09%09%7D%0D%0A%09%09%09%7D%0D%0A%09%09%09return true;%0D%0A%09%09%7D%0D%0A%09%7D%0D%0A%7D%0D%0A

Add Euler7 (#7)