A superpowered Euclidean prime generator
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 nnn-1. This variant of Euclid's prime generator is discussed with some of its cousins.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.