Rearranging those small numbers, you only have a product of small primorials, n# multiplied by m# etc, and subtract 1.
For small n, m, etc, this has higher chance to generate a prime, because n#1 does not have prime factors under n.
As n grows, your chances to find a prime by this method are as much as picking a random odd number and test it if it is prime or not.
Therefore is a fallacy.
As suggested above, if you have and algorithm, post it in Italian and I can handle the translation (I am Romanian).
Last fiddled with by LaurV on 20151125 at 05:14
