@@ -0,0 +1,769 @@
+%0Aimport javax.swing.JOptionPane;%0A%0A/**%0A * The prime factors of 13195 are 5, 7, 13 and 29.%0A *%0A * What is the largest prime factor of the number 600851475143?%0A */%0Apublic class Problem_3 implements Runnable %7B%0A%0A    /**%0A     * @param args the command line arguments%0A     */%0A    public static void main(String%5B%5D args) %7B%0A        new Problem_3().run();%0A    %7D%0A%0A    @Override%0A    public void run() %7B%0A        long num = 600851475143L;%0A        int largestPrimeFactor = 0;%0A%0A        for (int i = 1; i %3C Math.sqrt(600851475143L); i++) %7B%0A            if ((num %25 i) == 0) %7B%0A                num /= i;%0A                largestPrimeFactor = i;%0A            %7D%0A        %7D%0A%0A//        System.out.println(largestPrimeFactor);%0A        JOptionPane.showMessageDialog(null, largestPrimeFactor);%0A    %7D%0A%7D%0A

Create Problem_3.java