please dont rip this site

Square Root math Methods

One small (but slow) method of calculating SQRT(N):

Number = N ; Number to take square root of
SQRT = 0

Do While Number > 0
    Number = Number - K
    SQRT = SQRT + 1
    K = K + 2
End Do

Another fairly simple (but much faster) method of calculating sqrt(n): is the Newton method:

        s(i+1) = { s(i)*s(i) + p }/{ 2*s(i) }
or in more detail
Number = N ; input value
        ;-- we want to finish with s^2 approximately equal to N.
Do While (...?...)
        s = ( s*s + N ) / ( 2 * s ) ; the average of "s" and "N/s".
End Do

The Newton method requires a 8-bit into 16-bit division algorithm.

For more theory see

If you want tested implementations for a particular processor, see:


See also:

file: /Techref/method/math/sqrt.htm, 2KB, , updated: 2024/5/22 18:08, local time: 2024/7/15 11:31,

 ©2024 These pages are served without commercial sponsorship. (No popup ads, etc...).Bandwidth abuse increases hosting cost forcing sponsorship or shutdown. This server aggressively defends against automated copying for any reason including offline viewing, duplication, etc... Please respect this requirement and DO NOT RIP THIS SITE. Questions?
Please DO link to this page! Digg it! / MAKE!

<A HREF=""> Square Roots</A>

After you find an appropriate page, you are invited to your to this massmind site! (posts will be visible only to you before review) Just type a nice message (short messages are blocked as spam) in the box and press the Post button. (HTML welcomed, but not the <A tag: Instead, use the link box to link to another page. A tutorial is available Members can login to post directly, become page editors, and be credited for their posts.

Link? Put it here: 
if you want a response, please enter your email address: 
Attn spammers: All posts are reviewed before being made visible to anyone other than the poster.
Did you find what you needed?


Welcome to!


Welcome to!