Sequence of primorial primes: Difference between revisions
Specifically allow probabilistic primality tests. (All solutions use them and the task would become something very different otherwise.). Also remove draft status as there are a number of consistent solutions.
(Go solution) |
(Specifically allow probabilistic primality tests. (All solutions use them and the task would become something very different otherwise.). Also remove draft status as there are a number of consistent solutions.) |
||
Line 1:
{{
The sequence of primorial primes is given as the increasing values of n where [[Primorial numbers|primorial]](n) ± 1 is prime.
Line 17:
* This task asks for the primorial ''indices'' that create the final primorial prime numbers, so there should be no ten-or-more digit numbers in the program output (although extended precision integers ''will'' be needed for intermediate results).
* There is some confusion in the references, but for the purposes of this task the '''[[wp:Primorial prime|sequence]] begins with n = 1'''.
* Probabilistic primality tests are allowed, as long as they are good enough that output shown is correct.
| |||