On the Conversion of Hensel Codes to Farey Rationals
DOI10.1109/TC.1983.1676233zbMath0517.65027OpenAlexW2057461817MaRDI QIDQ3666145
Publication date: 1983
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1983.1676233
greatest common divisorindexfactorizationprimitive rootconversionreduced residue systemmultiplicative inverseextended Euclidean algorithmEuler's totient functionp-adic arithmeticHensel codeEuclidean filtering algorithmFarey rationalsisobaric set
Analysis of algorithms and problem complexity (68Q25) Interval and finite arithmetic (65G30) Continued fractions (11A55) Radix representation; digital problems (11A63)
This page was built for publication: On the Conversion of Hensel Codes to Farey Rationals