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 $n^{n^n}-1$. This variant of Euclid's prime generator is discussed with some of its cousins.

arXiv comment2pp

References in corpus (1)

• A variant of the Euclid-Mullin sequence containing every prime