Average Error: 0.9 → 0.1
Time: 3.1s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double re, double im) {
	return ((double) (((double) atan2(im, re)) / ((double) log(10.0))));
}

↓
double code(double re, double im) {
	return ((double) (((double) (((double) atan2(im, re)) * ((double) sqrt(((double) (1.0 / ((double) sqrt(((double) log(10.0)))))))))) * ((double) pow(((double) (1.0 / ((double) sqrt(((double) log(10.0)))))), 1.5))));
}

Error
Bits error versus re
Bits error versus im
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Derivation
  1. Initial program 0.9
    \[\]
  2. Using strategy rm
  3. Applied add-sqr-sqrt0.9
    \[\leadsto \]
  4. Applied *-un-lft-identity0.9
    \[\leadsto \]
  5. Applied times-frac0.8
    \[\leadsto \]
  6. Using strategy rm
  7. Applied div-inv0.8
    \[\leadsto \]
  8. Using strategy rm
  9. Applied add-sqr-sqrt0.8
    \[\leadsto \]
  10. Applied associate-*l*0.8
    \[\leadsto \]
  11. Simplified0.1
    \[\leadsto \]
  12. Using strategy rm
  13. Applied associate-*r*0.1
    \[\leadsto \]
  14. Simplified0.1
    \[\leadsto \]
  15. Final simplification0.1
    \[\leadsto \]
Reproduce
herbie shell --seed 2020191 
(FPCore (re im)
  :name "math.log10 on complex, imaginary part"
  :precision binary64
  (/ (atan2 im re) (log 10.0)))