@@ -0,0 +1,716 @@
+package melisProjectEuler;%0A%0Aimport java.util.ArrayList;%0Aimport java.util.List;%0A%0A/*%0A * Question 3:%0A * The prime factors of 13195 are 5, 7, 13 and 29.%0A * What is the largest prime factor of the number 600851475143 ?%0A */%0Apublic class LargestPrimeFactor %7B%0A%0A%09private static long NUMBER = 600851475143L;%0A%09private static List%3CInteger%3E primes = new ArrayList%3CInteger%3E();%0A%0A%09private static void findPrimes() %7B%0A%0A%09%09for (int div = 2; div %3C= NUMBER; div++) %7B%0A%09%09%09if (NUMBER %25 div == 0) %7B%0A%09%09%09%09primes.add(div);%0A%09%09%09%09NUMBER = NUMBER / div;%0A%09%09%09%7D%0A%09%09%7D%0A%09%7D%0A%09%0A%09public static void result ()%7B%0A%09%09findPrimes();%0A%09%09System.out.println(%22Max prime: %22+primes.get(primes.size()-1));%0A%09%09System.out.println(%22total number of primes: %22+primes.size());%0A%09%7D%0A%7D%0A

Create LargestPrimeFactor.java