Not sure if this idea for calculating the square roots of a value has any merit Okay, so I was thinking about square roots the other day and I spent some time thinking of how to visualize them:
Say we have 10,000.
The square root would be 100. So 100 of 100 equals 10,000.
Now what if you had a 100 sided polygon with each side segment being equal to 100? Wouldn't there be a strong correlation between the squared value of the side length and the approximated circumference of the circle that best fits this polygon?
I don't know too much about trig identities but it seems to me you should be able to make a good guess for the square root of a number (it would be more accurate the higher the number) by relating it to the approximated circumference?
This is mostly for making the initial guess when finding a square root with software by the way
I can't figure out how to evaluate for S in the following equation (where X is already solved by the program, which I have figured out so far)
X = s/sin(180/s)

Not sure I understand your method, or the point of it. Speed? Accuracy?
Several methods for approximating square roots are described here.
Curious to know why you don’t just call the sqrt function provided by whatever programming language you’re using. The guys who implemented it know far more about square root approximations than you or I do.
