Mapping Integers and Hensel Codes Onto Farey Fractions
DOI:
https://doi.org/10.7146/dpb.v11i149.7423Abstract
The order-N Farey fractions, where N is the largest integer satisfying N<= ˆ(p-1)/2, can be mapped onto a proper subset of the integers {0,1,...,p-1} in a one-to-one and onto fashion. However, no completely satisfactory algorithm for affecting the inverse mapping (the mapping of the integers back onto the order-N Farey fractions) appears in the literature.
A new algorithm for the inverse mapping problem is described which is based on the Euclidian Algorithm. This algorithm solves the inverse mapping problem for both integers and the Hensel codes.
Downloads
Published
How to Cite
Issue
Section
License
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.