Checking if an int is prime more efficiently

Question

I recently was part of a small java programming competition at my school. My partner and I have just finished our first pure oop class and most of the questions were out of

Answer 1

Using BigInteger.isProbablePrime(certainty) and BigInteger.nextProbablePrime() can significantly cut down the number of cases you need to check quite efficiently