Add to ORKGIn this work we are concerned with the calculation of the Hensel codes of square roots of p-adic numbers, using the fixed point method and this through the calculation of the approached solution of f(x) = x2 − a = 0 in Qp. We also determine the speed of convergence and the number of iterations. 1
We consider the root-finding problem f (x) = 0, f Zp[x], and seek a root in Zp of this equation t...
Newton polygons are constructions over the p-adic numbers used to find information about the roots o...
This thesis is concerned with algorithmic investigations in p-adically closed fields, of which Hens...
The problem of finding square roots of p-adic integers in Zp, p 2, has been a classic application o...
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...
AbstractThe standard way to compute a p-adic zero α of a univariate polynomial f is to use Newton’s ...
The field of p-adic numbers p and the ring of p-adic integers p are essential constructions of moder...
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...
Three different algorithms are described for the conversion of Hensel codes to Farey rationals. The ...
AbstractIn a finite segment p-adic number system one of the difficult problems is concerned with con...
This paper will provide an introduction to p-adic numbers and the Hasse Principle. The main topics i...
Three different algorithms are described for the conversion of Hensel codes to Farey rationals. The ...
U ovom smo se radu bavili proučavanjem p-adskih brojeva koje je prvi puta opisao njemački matematiča...
We consider the root-finding problem f (x) = 0, f Zp[x], and seek a root in Zp of this equation t...
Newton polygons are constructions over the p-adic numbers used to find information about the roots o...
This thesis is concerned with algorithmic investigations in p-adically closed fields, of which Hens...
The problem of finding square roots of p-adic integers in Zp, p 2, has been a classic application o...
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...
AbstractThe standard way to compute a p-adic zero α of a univariate polynomial f is to use Newton’s ...
The field of p-adic numbers p and the ring of p-adic integers p are essential constructions of moder...
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...
Three different algorithms are described for the conversion of Hensel codes to Farey rationals. The ...
AbstractIn a finite segment p-adic number system one of the difficult problems is concerned with con...
This paper will provide an introduction to p-adic numbers and the Hasse Principle. The main topics i...
Three different algorithms are described for the conversion of Hensel codes to Farey rationals. The ...
U ovom smo se radu bavili proučavanjem p-adskih brojeva koje je prvi puta opisao njemački matematiča...
We consider the root-finding problem f (x) = 0, f Zp[x], and seek a root in Zp of this equation t...
Newton polygons are constructions over the p-adic numbers used to find information about the roots o...
This thesis is concerned with algorithmic investigations in p-adically closed fields, of which Hens...