Java Recursion - find a number is prime or not

public class TestPrime {

/**
* @param args
*/
public static void main(String[] args) {
int i = 101;
System.out.println("integer:" + i + " is prime:" + isPrime(i, i/2));

}

private static boolean isPrime(int n, int div) {
if (div == 1)
return true;
else if (n%div==0)
return false;
else
return isPrime(n, div - 1);
}

}