A Superpowered Euclidean Prime Generator

DOI10.4169/AMER.MATH.MONTHLY.124.4.351zbMATH Open1391.11014arXiv1607.05267OpenAlexW2963360937MaRDI QIDQ4575252FDOQ4575252

Authors: Trevor D. Wooley 

Publication date: 13 July 2018

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

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.

Full work available at URL: https://arxiv.org/abs/1607.05267

Mathematics Subject Classification ID

Primes (11A41)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A variant of the Euclid-Mullin sequence containing every prime

Cited In (2)

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

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)