A Superpowered Euclidean Prime Generator

From MaRDI portal
Publication:4575252




Abstract: When k>1 and n is the product of the smallest k primes, the (k+1)-st smallest prime is the least divisor exceeding 1 of nnn1. This variant of Euclid's prime generator is discussed with some of its cousins.









This page was built for publication: A Superpowered Euclidean Prime Generator

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575252)