Average Error: 32.1 → 0.4
Time: 6.0s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double re, double im, double base) {
	return ((double) (((double) (((double) (((double) atan2(im, re)) * ((double) log(base)))) - ((double) (((double) log(((double) sqrt(((double) (((double) (re * re)) + ((double) (im * im)))))))) * 0.0)))) / ((double) (((double) (((double) log(base)) * ((double) log(base)))) + ((double) (0.0 * 0.0))))));
}

↓
double code(double re, double im, double base) {
	return ((double) (((double) atan2(im, re)) * ((double) (1.0 / ((double) log(base))))));
}

Error
Bits error versus re
Bits error versus im
Bits error versus base
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Derivation
  1. Initial program 32.1
    \[\]
  2. Taylor expanded around 0 0.3
    \[\leadsto \]
  3. Simplified0.3
    \[\leadsto \]
  4. Using strategy rm
  5. Applied div-inv0.4
    \[\leadsto \]
  6. Final simplification0.4
    \[\leadsto \]
Reproduce
herbie shell --seed 2020191 
(FPCore (re im base)
  :name "math.log/2 on complex, imaginary part"
  :precision binary64
  (/ (- (* (atan2 im re) (log base)) (* (log (sqrt (+ (* re re) (* im im)))) 0.0)) (+ (* (log base) (log base)) (* 0.0 0.0))))