Mapping integers and Hensel codes onto Farey fractions

DOI10.1007/BF01937322zbMath0521.10007OpenAlexW2632084216MaRDI QIDQ1055466

Peter Kornerup, R. T. Gregory

Publication date: 1983

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01937322

zbMATH Keywords

Euclidean algorithmFarey fractionsmodular arithmeticrational numberserror-free computationHensel codes23, 9-20 (1983)finite number systems

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Radix representation; digital problems (11A63) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (12)

Solving via Modular Methods ⋮ Feedback shift registers, 2-adic span, and combiners with memory ⋮ Parallel p-adic computation ⋮ A p-adic approach to the computation of Gröbner bases ⋮ Modular algorithms for computing Gröbner bases. ⋮ Parallelization of modular algorithms ⋮ On lucky ideals for Gröbner basis computations ⋮ Implementing Data Parallel Rational Multiple-Residue Arithmetic in Eden ⋮ Parallel modular computation of Gröbner and involutive bases ⋮ Bad Primes in Computational Algebraic Geometry ⋮ The use of bad primes in rational reconstruction ⋮ Parallelized Solution of Banded Linear Systems with an Introduction to p-adic Computation

Cites Work

• Error-free computation with rational numbers
• The use of finite-segmentp-adic arithmetic for exact computation
• Unnamed Item
• Unnamed Item

This page was built for publication: Mapping integers and Hensel codes onto Farey fractions