Primality Algoritm, Multiple languages

PrimeCheck.hs

prime :: Int -> Bool
prime x
    | x == 1 = False
    | x == 2 = True
    | x == 3 = True
    | x `mod` 2 == 0 = False
    | x `mod` 3 == 0 = False
    | otherwise = all (\y -> x `mod` y /= 0) $ dividends x
    where
        dividends z =
            takeWhile (<= (floor . sqrt . fromIntegral $ z))
                      $ concatMap (\x -> [x, x+2]) [6 * x - 1 | x <- [1..]]

PrimeCheck.js

function isPrime(number) {
  if ((number == 2) || (number == 3))
    return true;
  if ((number % 2 === 0) || (number % 3 === 0))
    return false;

  var maxDivisor = Math.sqrt(number);
  var dividendIndex = 1;
  var dividend = 5;
  while (dividend < maxDivisor) {
    if (number % dividend === 0)
      return false;

    dividend = dividend + 2;

    if (dividend > maxDivisor)
      break;

    if (number % dividend === 0)
      return false;

    dividendIndex++;
    dividend = 6 * dividendIndex - 1;
  }

  return true;
}