@@ -0,0 +1,961 @@
+package amery.logic;%0A%0Aimport org.junit.Test;%0A%0Apublic class PrimeTest %7B%0A%0A    @Test%0A    public void testNextPrice() %7B%0A        findNextPrime(-5);%0A        findNextPrime(20);%0A        findNextPrime(3001);%0A        findNextPrime(8888);%0A        findNextPrime(88888);%0A    %7D%0A%0A    static int findNextPrime(int input) %7B%0A        int i, j, minPrime;%0A        j = minPrime = 2;%0A%0A        if (input %3C= minPrime) %7B%0A            System.out.println(minPrime);%0A            return minPrime;%0A        %7D%0A        for (i = input + 1; i %3C input + 2; i ++) %7B%0A            for (j = minPrime; j %3C= i; j ++) %7B%0A                if (i %25 j == 0) %7B%0A                    break;%0A                %7D%0A            %7D%0A            if (j %3E i / minPrime) %7B%0A                System.out.println(j);%0A                return j;%0A            %7D%0A        %7D%0A        if (j == minPrime %7C%7C j %3C= input) %7B%0A            return findNextPrime(input + 1);%0A        %7D%0A        System.out.println(minPrime);%0A        return minPrime;%0A    %7D%0A%7D%0A

add next prime test