Pages that link to "Item:Q4907263"
From MaRDI portal
The following pages link to Numerical analysis meets number theory: Using rootfinding methods to calculate inverses mod pn (Q4907263):
Displaying 5 items.
- Application of Euclid's algorithm to the computation of the inverse in modulo arithmetics (Q1128755) (← links)
- Recursive elucidation of polynomial congruences using root-finding numerical techniques (Q1724425) (← links)
- An algorithm for numerically inverting the modular \(j\)-function (Q2316170) (← links)
- On the Solution of the Equation $n = ak + bp_k$ by Means of an Iterative Method (Q5026929) (← links)
- On Newton–Raphson Iteration for Multiplicative Inverses Modulo Prime Powers (Q5268120) (← links)
