P-Adic Qth Roots Via Newton-Raphson Method

Paul Samuel Ignacio, Joel Addawe, Job Nable

Abstract


Hensel’s lemma has been the basis for the computation of the square
roots of p-adic numbers in Zp. We generalize this problem to the computation
of qth roots of p-adic numbers in Qp, where q is a prime and p is greater than
q. We provide necessary and sufficient conditions for the existence of qth roots of p-adic numbers in Qp. Then, given a root of order r, we use the Newton-Raphson method to approximate the qth root of a p-adic number a. We also determine the rate of convergence of this method and the number of iterations needed for a specified number of correct digits in the approximate.

Full Text: PDF

Refbacks

  • There are currently no refbacks.


The Thai Journal of Mathematics organized and supported by The Mathematical Association of Thailand and Thailand Research Council and the Center for Promotion of Mathematical Research of Thailand (CEPMART).

Copyright 2020 by the Mathematical Association of Thailand.

All rights reserve. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, without the prior permission of the Mathematical Association of Thailand.

|ISSN 1686-0209|