Implementation of pow(3m) function

[Andrew Koenig]

In article <10803 at crdgw1.crd.ge.com>, volpe at underdog.crd.ge.com (Christopher R Volpe) writes:

> In article <11143 at alice.UUCP>, ark at alice.UUCP (Andrew Koenig) writes:


> |>If such an
> |>implementation uses exp and log for the ordinary cases, it will
> |>almost surely not be monotonic.  That is, it will be possible to
> |>find positive x, y, and z such that y > z and pow(x,y) < pow(x,z).


> I sure hope so, since there are trivial real-life cases where this is
> true. E.g.: x=0.5, y=3, z=2. pow(x,y)=.125  <  pow(x,z)=.25


Sorry about that.  I meant x>1, y>z, z>0.
-- 
				--Andrew Koenig
				  ark at europa.att.com