# From hint: any number less than 2 is not prime
if x is less than 2:
  return x is not prime

# This loop is where we put our number to the test and return False
# so the function exits immediately if x isn’t prime
for n from 2 to x:
  if x is evenly divisible by n:
    return x is not prime

# If we made it here, our number must be prime because none
# of the other return statements were executed!
return x is prime