EulerProblem3.java

    //This method checks if a number is prime
    public static boolean check(int num) {

            int stop = (int) Math.sqrt(num) + 1;
                System.out.println("Number: " + num);
                System.out.println("Stop: " + stop); // Prints square root
                int r = 1;
            boolean b = true;

            for (int n = 3; n <= stop; n += 2) {
                r = num % n;
                if (r == 0) b = false;
                System.out.println(num + " / " + n + " = " + r);
            }
        System.out.println("-----------");
        return b;


    }