NevinBR

…just dropping that implementation in, however, gives: ``` error: inlining 'transparent' functions forms circular loop ``` The last call, `pow(x, n - Int(p))`, is indeed recursive, so it would either...

Some ideas for `root`: 1\. Use a higher-precision type for the calculation, then convert back to `Float` at the end. 2\. Take the significand bits of `r = 1/Float(n)` as...