Average Error: 0.0 → 0.0
Time: 2.9s
Precision: 64
\[e^{re} \cdot \sin im\]
↓
\[e^{re} \cdot \sin im\]
e^{re} \cdot \sin im
↓
e^{re} \cdot \sin im
double f(double re, double im) {
        double r33559 = re;
        double r33560 = exp(r33559);
        double r33561 = im;
        double r33562 = sin(r33561);
        double r33563 = r33560 * r33562;
        return r33563;
}
↓
double f(double re, double im) {
        double r33564 = re;
        double r33565 = exp(r33564);
        double r33566 = im;
        double r33567 = sin(r33566);
        double r33568 = r33565 * r33567;
        return r33568;
}

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

    \[e^{re} \cdot \sin im\]

  2. Final simplification0.0

    \[\leadsto e^{re} \cdot \sin im\]

Reproduce

herbie shell --seed 2020056 
(FPCore (re im)
  :name "math.exp on complex, imaginary part"
  :precision binary64
  (* (exp re) (sin im)))