Projects per year
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.
Original language | English |
---|---|
Pages (from-to) | 30-57 |
Number of pages | 28 |
Journal | Journal of Number Theory |
Volume | 165 |
Early online date | 4 Mar 2016 |
DOIs | |
Publication status | Published - Aug 2016 |
Keywords
- Prime numbers
- Euclid–Mullin sequence
Fingerprint
Dive into the research topics of 'The Euclid-Mullin graph'. Together they form a unique fingerprint.Projects
- 3 Finished
-
Detecting squarefree numbers
Booker, A. R. (Principal Investigator)
1/07/13 → 1/07/15
Project: Research
-
L-functions and modular forms
Keating, J. P. (Co-Principal Investigator) & Booker, A. R. (Principal Investigator)
1/06/13 → 30/09/19
Project: Research
-
Explicit number theory, automorphic forms and L-functions
Booker, A. R. (Principal Investigator)
1/10/09 → 1/04/15
Project: Research