Numerical analysis meets number theory: Using rootfinding methods to calculate inverses mod pn

DOI10.2298/AADM100201012KzbMATH Open1265.11001OpenAlexW2076136239MaRDI QIDQ4907263FDOQ4907263

Michael P. Knapp, Christos Xenophontos

Publication date: 31 January 2013

Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/aadm100201012k

zbMATH Keywords

secant methodNewton's method

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Numerical computation of solutions to single equations (65H05)

Cited In (5)

• Recursive elucidation of polynomial congruences using root-finding numerical techniques
• Application of Euclid's algorithm to the computation of the inverse in modulo arithmetics
• On the Solution of the Equation $n = ak + bp_k$ by Means of an Iterative Method
• An algorithm for numerically inverting the modular \(j\)-function
• On Newton–Raphson Iteration for Multiplicative Inverses Modulo Prime Powers

This page was built for publication: Numerical analysis meets number theory: Using rootfinding methods to calculate inverses mod pn

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4907263)