Average Error: 0.0 → 0.0
Time: 2.7s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double re, double im) {
	return ((double) (((double) exp(re)) * ((double) cos(im))));
}

↓
double code(double re, double im) {
	return ((double) (((double) sqrt(((double) exp(re)))) * ((double) (((double) sqrt(((double) exp(re)))) * ((double) cos(im))))));
}

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.0
    \[\]
  2. Using strategy rm
  3. Applied add-sqr-sqrt0.0
    \[\leadsto \]
  4. Applied associate-*l*0.0
    \[\leadsto \]
  5. Simplified0.0
    \[\leadsto \]
  6. Final simplification0.0
    \[\leadsto \]
Reproduce
herbie shell --seed 2020191 
(FPCore (re im)
  :name "math.exp on complex, real part"
  :precision binary64
  (* (exp re) (cos im)))