@@ -0,0 +1,701 @@
+import java.util.Scanner;%0A%0Apublic class FastPrimeChecker %7B%0A    public static void main(String%5B%5D args) %7B%0A        Scanner scanner = new Scanner(System.in);%0A        int n = Integer.parseInt(scanner.nextLine());%0A        %0A        for (int i = 2; i %3C= n; i++) %7B%0A            boolean isPrime = true;%0A            for (int divisor = 2; divisor %3C= Math.sqrt(i); divisor++) %7B%0A                if (i %25 divisor == 0) %7B%0A                    isPrime = false;%0A                    break;%0A                %7D%0A            %7D%0A            if (isPrime) %7B%0A                System.out.printf(%22%25d -%3E True%25n%22, i);%0A            %7D%0A            else %7B%0A                System.out.printf(%22%25d -%3E False%25n%22, i);%0A            %7D%0A        %7D%0A    %7D%0A%7D%0A

Create 15.FastPrimeChecker.java