Re: A85: Square roots

To: assembly-85@lists.ticalc.org
Subject: Re: A85: Square roots
From: mikep@anet-dfw.com (Michael Pearce)
Date: Fri, 10 Oct 1997 19:46:44 GMT
In-Reply-To: <19971010.152247.8950.1.egillespie@juno.com>
References: <343E80CE.567D@hem2.passagen.se> <19971010.152247.8950.1.egillespie@juno.com>
Reply-To: assembly-85@lists.ticalc.org

On Fri, 10 Oct 1997 15:22:45 -0400, you wrote:

>I believe if you use Newton's method of finding roots you can do this
>easily
>
>If you don't know Newton's method here it is:
>     	Let X equal the number you want to find the square root of.
>	Let TOLERANCE be the accuracy of the root (1.0 * 10 ^ -7)
>	When programming, multiply by the inverse, don't divide (it's
>slow)

How do you find the inverse of a number without dividing?

And if the original poster of this needs 8-bit signed multiply and
divide routines, i have some.

-mike

Follow-Ups:

Re: A85: Square roots

From: egillespie@juno.com (Erik L Gillespie)

References:

A85: Square roots

From: Max Thoursie <erdol@hem2.passagen.se>

Re: A85: Square roots

From: egillespie@juno.com (Erik L Gillespie)