Résumé:
In this work we determined some algorthms to calculate the square roots of p-adic numbers (Hensel codes) via the classical numerical methods Newton, Secant, fixed point and this through the calculation of the approached solution of the zero of a function defined on Qp. We also determined the speed of convergence, the number of iteration and the Hensel's codes. We made the same work determination of the inverse of p-adic number.
