Path: utzoo!utgpu!watserv1!watmath!att!att!emory!swrinde!ucsd!sdd.hp.com!uakari.primate.wisc.edu!aplcen!haven!udel!princeton!phoenix.Princeton.EDU!pfalstad
From: pfalstad@phoenix.Princeton.EDU (Paul John Falstad)
Newsgroups: comp.lang.c
Subject: Re: # to the nth power
Message-ID: <3809@idunno.Princeton.EDU>
Date: 3 Nov 90 05:48:49 GMT
References: <9750@helios.TAMU.EDU> <1990Nov1.232830.17131@NCoast.ORG> <2730D2C2.13524@maccs.dcss.mcmaster.ca>
Sender: news@idunno.Princeton.EDU
Organization: Princeton University, Princeton, New Jersey
Lines: 16

In lots of articles people write:
>[
>  Lots of methods for computing a raised to the power n deleted
>]

Just out of curiosity, is there an efficient algorithm for finding
square root of an integer (or the integral part of the square root, if
the number is not a perfect square) using only integer arithmetic?
How about the cube root?

"No" is a valid answer.

--
Paul Falstad, pfalstad@phoenix.princeton.edu PLink:HYPNOS GEnie:P.FALSTAD
I would bring back hanging, and go into rope.  I would cut off the more
disreputable parts of the body and use the space for playing fields.