Make a java program to enter a two-digit integer and determine if both digits are prime

Package com.java2novice.algos; public class MyPrimeNumCheck {     public boolean isPrimeNumber(int number){                 for(int i=2; i<=number/2; i++){            if(number % i == 0){                return false;            }        }        return true;    }         public static void main(String a[]){        MyPrimeNumCheck mpc = new MyPrimeNumCheck();        System.out.println("Is 17 prime number? "+mpc.isPrimeNumber(17));        System.out.println("Is 19 prime number? "+mpc.isPrimeNumber(19));        System.out.println("Is 15 prime number? "+mpc.isPrimeNumber(15));    }

You can find this code at
http://www.java2novice.com/java-interview-programs/is-prime-number/

A. newton 's fourth law a liquid in a confined space is not compressed.