2018/11/02 by Mifsud, Xandru
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1811.00807
A graph G is defined encapsulating the number theoretic notion of the Fundamental Theorem of Arithmetic. We then provide a graph theoretic approach to the fundamental results on the coprimality of two natural numbers, through the use of an adjacency operator A(G). Lastly, these results are used to give an alternate proof to the known result that there are infinitely many primes in the natural numbers ℕ.