arXiv · 1508.03039
The Euclid-Mullin graph
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Andrew R. Booker, Sean A. Irvine. 2016-03-06. The Euclid-Mullin graph. https://doi.org/10.1016/j.jnt.2016.01.013
Cite the original work for its findings. Save a collection to share your selection of sources.