Przejdź do treści

Primorial

🔗 Opis problemu

Implementacja

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
def is_prime(n: int) -> bool:
  if n < 2:
    return False

  return all(n % i != 0 for i in range(2, int(n**0.5) + 1))

def primorial(n: int) -> int:
  primes = []
  num = 2
  while len(primes) < n:
    if is_prime(num):
      primes.append(num)

    num += 1

  result = 1
  for prime in primes:
    result *= prime

  return result

n = 3

result = primorial(n)

print(f"{n}# = {result}")