Check if a Number Is Prime

Create a class named PrimeChecker with a public static method IsPrime that takes one integer n and returns a bool telling whether n is a prime number. A prime is a whole number greater than 1 that has no divisors other than 1 and itself. Numbers less than 2 are not prime. Combine a loop with a divisibility check: if any value between 2 and n divides n evenly, it is not prime. For example, IsPrime(7) returns true and IsPrime(10) returns false.