Tool to compute a primorial. Primorial n# is the product of all prime numbers inferior or equal to n, or the product of all n first prime numbers (it depend on the selected definition)
Primorial - dCode
Tag(s) : Arithmetics
dCode is free and its tools are a valuable help in games, maths, geocaching, puzzles and problems to solve every day!
A suggestion ? a feedback ? a bug ? an idea ? Write to dCode!
The term primorial refers to two separate definitions/formulae according to some uses:
(1) Primorial defined as the product of all prime numbers inferior or equal to $ n $ is a multiplication conditioned par a primality test of the numbers inferior or equal to $ n $, see OEIS here (link)
Example: $ 6\# = 2 \times 3 \times 5 = 30 $
Example: $ 4\# = 2 \times 3 \times 5 \times 7 = 210 $
The primorial of p is written with the character sharp: p# or $ p\# $
By convention $ 1\# = 1 $
The primorial function is the function that at a natural integer $ n $ associates the value $ n\# $
The primorial calculation is a succession of multiplication of prime numbers. According to definitions (1) and (2):
Lists (1) and (2) contain the same numbers but (1) have repeated elements.
Reminder : dCode is free to use.
The copy-paste of the page "Primorial" or any of its results, is allowed (even for commercial purposes) as long as you cite dCode!
Exporting results as a .csv or .txt file is free by clicking on the export icon
Cite as source (bibliography):
Primorial on dCode.fr [online website], retrieved on 2023-10-01,