DOIAbstract
AbstractIn a finite segment p-adic number system one of the difficult problems is concerned with converting Hensel Codes Back into rational numbers. A method for this conversion has been proposed which is based on a table lookup procedure
AbstractIn a finite segment p-adic number system one of the difficult problems is concerned with converting Hensel Codes Back into rational numbers. A method for this conversion has been proposed which is based on a table lookup procedure
Every numbering system has its own alphabet, which is used for symbolic representation of a number. ...
In this work we describe the use of truncated p-adic expansion for handling rational numbers by para...
The field of p-adic numbers p and the ring of p-adic integers p are essential constructions of moder...
AbstractIn a finite segment p-adic number system one of the difficult problems is concerned with con...
Three different algorithms are described for the conversion of Hensel codes to Farey rationals. The ...
Three different algorithms are described for the conversion of Hensel codes to Farey rationals. The ...
A fractional weighted number system, based on Hensel's p-adic number system, is proposed for constru...
A fast iterative scheme based on the Newton method is described for finding the reciprocal of a fini...
A unique code (called Hensel's code) is derived for a rational number by truncating its infinite p-a...
This paper deals with rational base number systems for p-adic numbers. We mainly focus on the system...
In this seminal work, Hensel introduces p-adic numbers, using function theoretic methods to study nu...
In this seminal work, Hensel introduces p-adic numbers, using function theoretic methods to study nu...
An error-free carry-free (parallel) rational arithmetic system based on residue and p-adic represent...
In this work we are concerned with the calculation of the Hensel codes of square roots of p-adic num...
The order-N Farey fractions, where N is the largest integer satisfying N<= ˆ(p-1)/2, can be mapp...
Every numbering system has its own alphabet, which is used for symbolic representation of a number. ...
In this work we describe the use of truncated p-adic expansion for handling rational numbers by para...
The field of p-adic numbers p and the ring of p-adic integers p are essential constructions of moder...
AbstractIn a finite segment p-adic number system one of the difficult problems is concerned with con...
Three different algorithms are described for the conversion of Hensel codes to Farey rationals. The ...
Three different algorithms are described for the conversion of Hensel codes to Farey rationals. The ...
A fractional weighted number system, based on Hensel's p-adic number system, is proposed for constru...
A fast iterative scheme based on the Newton method is described for finding the reciprocal of a fini...
A unique code (called Hensel's code) is derived for a rational number by truncating its infinite p-a...
This paper deals with rational base number systems for p-adic numbers. We mainly focus on the system...
In this seminal work, Hensel introduces p-adic numbers, using function theoretic methods to study nu...
In this seminal work, Hensel introduces p-adic numbers, using function theoretic methods to study nu...
An error-free carry-free (parallel) rational arithmetic system based on residue and p-adic represent...
In this work we are concerned with the calculation of the Hensel codes of square roots of p-adic num...
The order-N Farey fractions, where N is the largest integer satisfying N<= ˆ(p-1)/2, can be mapp...
Every numbering system has its own alphabet, which is used for symbolic representation of a number. ...
In this work we describe the use of truncated p-adic expansion for handling rational numbers by para...
The field of p-adic numbers p and the ring of p-adic integers p are essential constructions of moder...
Add to ORKG