Check if a number is prime:
Example:

int num = 29;
int i = 2;
boolean isPrime = true;
while (i <= num / 2) {
 if (num % i == 0) {
 isPrime = false;
 break;
 }
 i++;
}
System.out.println(isPrime ? "Prime" : "Not Prime");