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

@David get the square root of a number and then loop till square root eliminate even numbers and see if it is not divisble