Rosetta Code

Sequence of primorial primes

Check primorial minus one and plus one values for primality over a short prime prefix.

Edit the source, then Run. Checks start after your first Run. Ctrl/⌘ + Enter runs; Tab indents. Preview services use sample data and never contact a real service.

Sourcerosettacode/popular/sequence_of_primorial_primes.vibe
type RunResult = array<{
  minus_one_prime: bool,
  plus_one_prime: bool,
  prime: int,
  primorial_minus_one: int,
  primorial_plus_one: int
}>

def prime?(number: int) -> bool
  if number < 2
    return false
  end

  factor = 2
  while factor * factor <= number
    if number % factor == 0
      return false
    end
    factor = factor + 1
  end

  true
end

def run -> RunResult
  primes = [2, 3, 5, 7, 11]
  primorial = 1
  rows: RunResult = []
  index = 0

  while index < primes.length
    primorial = primorial * primes.fetch(index)
    rows.push({
      prime: primes.fetch(index),
      primorial_minus_one: primorial - 1,
      minus_one_prime: prime?(primorial - 1),
      primorial_plus_one: primorial + 1,
      plus_one_prime: prime?(primorial + 1)
    })
    index = index + 1
  end

  rows
end

Output

Click Run example to see the result.

Code checks

Run once to load the checker. Your code stays in this browser.