Binary square rooting algorithms which yield a root in a redundant representation using digits 1, -1, and 0 are analyzed, particularly those yielding a root in a representation in which the number of nonzero digits is minimal. An algorithm which may lead to any possible minimal representation of the square root is developed.
No takes yet. Share an insight, caveat, or question.
Gernot Metze (1965) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: