The Euclid-Mullin graph

DOI10.1016/J.JNT.2016.01.013MaRDI QIDQ271751zbMATH OpenOpenAlexFDO

Authors Andrew R. Booker, Sean A. Irvine

Publication date 20 April 2016

Published in Journal of Number Theory (Search for Journal in Brave)

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

zbMATH Keywords

Euclid-Mullin sequenceprime numbers

Mathematics Subject Classification ID

Primes (11A41) Other combinatorial number theory (11B75)

Abstract: We introduce the Euclid-Mullin graph, which encodes all instances of Euclid's proof of the infinitude of primes. We investigate structural properties of the graph both theoretically and numerically; in particular, we prove that it is not a tree.

Recommendations

• On Mullin's second sequence of primes
• Euclid's theorem redux
• scientific article; zbMATH DE number 812033
• New Proofs of Euclid's and Euler's Theorems
• The primes that Euclid forgot

Cites work

• Binary quadratic forms. An algorithmic approach
• Euclid Prime Sequences over Unique Factorization Domains
• scientific article; zbMATH DE number 653244 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• scientific article; zbMATH DE number 812033 (Why is no real title available?)
• On Mullin's second sequence of primes
• On the Distribution of Additive Number-Theoretic Functions (II)
• Square-free values of reducible polynomials
• The irreducible factorization of Fibonacci polynomials over Q
• The primes that Euclid forgot

Cited in

(3)

• Square-free values of reducible polynomials
• On Mullin's second sequence of primes
• Lower bounds for the modified Szpiro ratio

Describes a project that uses

Uses Software

• Msieve
• OEIS
• yafu

This page was built for publication: The Euclid-Mullin graph

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