today’s codewars

Today’s Codewars kata was Is a Number Prime?, which was a basic test to determine if a given int was a prime number. // ignoring 0, 1, and 2for (int i = 5; i <= num/2; i++)  if (num % i == 0) return false;return true; But it cautioned against brute forcing the answer by building…