in reply to Re: Re: Re: Square Root algorithm
in thread Square Root algorithm

(<var>n</var>+1)2-<var>n</var>2 = 2<var>n</var>+1. </blockquote

So your algorithm works for any square integer. But it's not very fast, as it takes time proportional to O(sqrt(<var>n</var>)), where <var>n</var> is the number you're rooting, not its size!

For comparison, Newton-Raphson / the Babylonian algorithm double the number of correct digits at each iteration.

In Section Seekers of Perl Wisdom