Average Error: 0.0 → 0.0
Time: 17.3s
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 r39364 = re;
        double r39365 = exp(r39364);
        double r39366 = im;
        double r39367 = sin(r39366);
        double r39368 = r39365 * r39367;
        return r39368;
}
↓
double f(double re, double im) {
        double r39369 = re;
        double r39370 = exp(r39369);
        double r39371 = im;
        double r39372 = sin(r39371);
        double r39373 = r39370 * r39372;
        return r39373;
}

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 2019209 
(FPCore (re im)
  :name "math.exp on complex, imaginary part"
  :precision binary64
  (* (exp re) (sin im)))