The Euclid-Mullin graph
Number Theory
2016-10-25 v2
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.
Cite
@article{arxiv.1508.03039,
title = {The Euclid-Mullin graph},
author = {Andrew R. Booker and Sean A. Irvine},
journal= {arXiv preprint arXiv:1508.03039},
year = {2016}
}
Comments
24 pages, 2 figures, to appear in Journal of Number Theory