Given a number n, the task is to calculate its primorial. Primorial (denoted as Pn#) is product of first n prime numbers. Primorial of a number is similar to factorial of a number. In primorial, not all the natural numbers get multiplied only prime numbers are multiplied to calculate the primorial of a number. It is denoted with P#.
Input: n = 3 Output: 30 Priomorial = 2 * 3 * 5 = 30 As a side note, factorial is 2 * 3 * 4 * 5 Input: n = 5 Output: 2310 Primorial = 2 * 3 * 5 * 7 * 11
A naive approach is to check all numbers from 1 to n one by one is prime or not, if yes then store the multiplication in result, similarly store the result of multiplication of primes till n.
An efficient method is to find all the prime up-to n using Sieve of Sundaram and then just calculate the primorial by multiplying them all.
Primorial(P#) of 1 is 2 Primorial(P#) of 2 is 6 Primorial(P#) of 3 is 30 Primorial(P#) of 4 is 210 Primorial(P#) of 5 is 2310
This article is contributed by Sahil Chhabra (KILLER). If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Find n-th Fortunate Number
- Prime Numbers
- N expressed as sum of 4 prime numbers
- Find the first natural number whose factorial is divisible by x
- Sphenic Number
- Check if possible to move from given coordinate to desired coordinate
- Find (a^b)%m where 'a' is very large
- Find smallest values of x and y such that ax - by = 0
- Sieve of Atkin
- Sieve of Sundaram to print all primes smaller than n
- Primality Test | Set 1 (Introduction and School Method)
- Euler's Totient Function
- Factorial of a large number
- Efficient program to print all prime factors of a given number
- Sieve of Eratosthenes