One small (but slow) method of calculating SQRT(N):
Number = N ; Number to take square root of SQRT = 0 K=1 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 8bit into 16bit 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: 2011/3/15 15:47, local time: 2019/2/23 11:58,

©2019 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? <A HREF="http://techref.massmind.org/techref/method/math/sqrt.htm"> Square Roots</A> 
Did you find what you needed? 
Welcome to massmind.org! 
Welcome to techref.massmind.org! 
.