A Superpowered Euclidean Prime Generator

DOI10.4169/AMER.MATH.MONTHLY.124.4.351MaRDI QIDQ4575252zbMATH OpenOpenAlexFDO

Authors Trevor D. Wooley

Publication date 13 July 2018

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1607.05267, https://research-information.bris.ac.uk/ws/files/82012199/peuclid_monthly_rev.pdf

Mathematics Subject Classification ID

Primes (11A41)

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.

Cites work

• A variant of the Euclid-Mullin sequence containing every prime
• scientific article; zbMATH DE number 3460351 (Why is no real title available?)
• scientific article; zbMATH DE number 2206373 (Why is no real title available?)

Cited in

(2)

• Squarefree smooth numbers and Euclidean prime generators
• Fermat's last theorem implies Euclid's infinitude of primes

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)