If you google carefully, it appears there are some resources to help with a common problem.But just for good measure, here's my own implementation, which utilises the fact sq(n) = (n-1)(n+1)+1, and the difference between two terms "t" apart in the resultant series is 2t + 3. Theoretically this should give you the square root in a single iteration, once ......