Part 0a: Prime Checker

A key challenge when writing large programs like Breakout is how best to decompose our solutions into manageable and effectively-implemented methods. In order to practice this skill, you’ll begin this assignment by writing a short method that takes in a positive integer greater than 1 as an input and returns a boolean indicating whether or not that integer is prime. As a reminder, a prime number is a number whose factors are 1 and itself. In PrimeChecker.java, we provide a run method that tests whether or not a series of numbers is prime. Your job is to implement the isPrime method to check whether or not the number is prime.

To run the program, right click on the PrimeChecker class in IntelliJ and click on Run PrimeChecker.main()