home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.math
- Path: sparky!uunet!charon.amdahl.com!pacbell.com!sgiblab!zaphod.mps.ohio-state.edu!sol.ctr.columbia.edu!news.unomaha.edu!news.mtholyoke.edu!nic.umass.edu!news.amherst.edu!mkrogers
- From: mkrogers@unix.amherst.edu (MICHAEL K ROGERS)
- Subject: Re: Square root of a number
- Message-ID: <BxxCKs.G2u@unix.amherst.edu>
- Sender: news@unix.amherst.edu (No News is Good News)
- Nntp-Posting-Host: amhux3.amherst.edu
- Organization: Amherst College
- X-Newsreader: TIN [version 1.1 PL7]
- References: <1992Nov18.142932.25808@schaefer.math.wisc.edu>
- Distribution: na
- Date: Wed, 18 Nov 1992 18:26:52 GMT
- Lines: 16
-
- Carl Douglas Mueller (mueller@schaefer.math.wisc.edu) wrote:
- : >In article <1992Nov15.194049.1@woods.ulowell.edu> buxamusaa@woods.ulowell.edu writes:
- : >>Please could someone help me with an assignment that I have to do.
- : >>It is a very general question, though the answer could be quite lengthy.
- : >>"Discuss methods for finding the square root of a number."
- : >>What I am looking for are all possible methods/alogrithms for this.
- : ^^^^^^^^^^^^^^^^^^^^
- :
- : There are MANY methods. For example to find the square root of x.
- : 1) Pick a random number r.
- : 2) Compute r*r.
- : 3) if r*r <> x goto 1.
- :
- : (OK, so this isn't an efficient method. It is a method. :-) )
-
- It is not a method that works. I would call it an impossible method.
-