Infinitely-many Primes in \mathbb{N}: A Graph Theoretic Approach

MaRDI QIDQ6309130zbMATH OpenFDO

Authors Xandru Mifsud

Publication date 2 November 2018

Abstract: 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 $hatmathbfA(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 $mathbbN$.

This page was built for publication: Infinitely-many Primes in $\mathbb{N}$: A Graph Theoretic Approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6309130)