The Euclid-Mullin graph
arXiv:1508.03039 · doi:10.1016/j.jnt.2016.01.013
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.
24 pages, 2 figures, to appear in Journal of Number Theory