An algorithm to compute integer th roots using subtractions

DOI10.1080/00207160.2010.528755MaRDI QIDQ3008371zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jose Torres-Jimenez, Nelson Rangel-Valdez, Pedro Quiz-Ramos

Publication date 15 June 2011

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160.2010.528755

zbMATH Keywords

addition chainalgorithminteger \(\eta \)th root

Mathematics Subject Classification ID

Newton-type methods (49M15) Discrete approximations in optimal control (49M25) Algorithms for approximation of functions (65D15) Finite difference and finite volume methods for ordinary differential equations (65L12) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Integer roots for integer-power-content calculations
• scientific article; zbMATH DE number 3864371
• An integer based square root algorithm
• Fast computation of the Nth root
• Newton-like algorithms for kth root calculation

Cites work

• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• Sieve algorithms for perfect power testing

Cited in

(1)

• Integer roots for integer-power-content calculations

This page was built for publication: An algorithm to compute integer \(\eta \)th roots using subtractions

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