primes

Benchmark created on


Test runner

Ready to run.

Testing in
TestOps/sec
isprimegpt
function isPrimeChatGPT() {
    if (number <= 1) {
      return false; // Numbers less than or equal to 1 are not prime
    }
    
    if (number <= 3) {
      return true; // 2 and 3 are prime numbers
    }
    
    if (number % 2 === 0 || number % 3 === 0) {
      return false; // Numbers divisible by 2 or 3 are not prime
    }
    
    // Check divisibility for numbers of the form 6k ± 1, where k is an integer
    for (let i = 5; i * i <= number; i += 6) {
      if (number % i === 0 || number % (i + 2) === 0) {
        return false; // Numbers divisible by i or i + 2 are not prime
      }
    }
    
    return true; // If no divisors found, the number is prime
  }
ready
isprime
function isPrime()
{
    for (let i = 2 ; i <= number; i++)
    {
        if (i == number)
        {
            return number + " is a prime number";
        }
        else if (number % i == 0)
        {
            return number + " is not a prime number";
        }
    }
}
ready

Revisions

You can edit these tests or add more tests to this page by appending /edit to the URL.