alternate prime? solution

Was it your first instinct to create an array of all the divisors and compare it to [1, self], or did you do it that way for a certain reason? I never would've thought of that...

I don't like that my answer checks if self is 1 every time, but isn't it still more efficient to only check divisors up to the square root, and return false as soon as a factor is found?