An Abelian Loop for Non-Composites

From MaRDI portal



Abstract: We define an abelian loop on a set S consisting of 1 and all odd prime numbers with an operation , where for a,b in S, a b is the smallest element of S strictly larger than |a−b|. We use theorems and conjectures from number theory to prove properties of the loop and state analogous conjectures about the loop.














This page was built for publication: An Abelian Loop for Non-Composites

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