We examine the extensions of the basic arithmetical operations of addition and multiplication on the natural numbers into higher-rank hyper-operations also on the natural numbers. We go on to define the concepts of prime and composite numbers under these hyper-operations and derive some results about factorisation, resulting in fundamental theorems analogous to the Fundamental Theorem of Arithmetic.
Keywords:
Subject: Computer Science and Mathematics - Algebra and Number Theory
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.