arXiv · 2110.14716
An Abelian Loop for Non-Composites
Abstract
We define an abelian loop on a set $S$ consisting of 1 and all odd prime numbers with an operation $\bullet$, where for $a,b$ $\in$ $S$, $a$ $ \bullet$ $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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Raghavendra N. Bhat. 2021-10-27. An Abelian Loop for Non-Composites. https://doi.org/10.35834/2022%2F3402191
Cite the original work for its findings. Save a collection to share your selection of sources.