A perfect power, and then?

[Torbjorn Granlund]

nisse at lysator.liu.se (Niels Möller) writes:

  Do you think we should have an advertised binv_sqrt function returning
  a^{-1/2}? (And if so, should we have something analogous also for
  euclidean square root? And for nth roots?)

Perhaps.  A start would be to "advertise" it internally.
  
  My bsqrt first computes a^{-1/2}, but then it multiplies it by a before
  returning a^{1/2}.
  
Something we should try also for Euclidean sqrt.

  How do we make some progress here? I'm tempted to first commit my broot
  and corresponding test code (since that has less interface subtleties
  than bsqrt).
  
With all respect for your functions, I don't think we should replace the
tested ones in perfpow.  I think those should in he first place be
improved (and put in their own file).

-- 
Torbjörn