Average Error: 0.0 → 0.0
Time: 3.7s
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 r57992 = re;
        double r57993 = exp(r57992);
        double r57994 = im;
        double r57995 = sin(r57994);
        double r57996 = r57993 * r57995;
        return r57996;
}
↓
double f(double re, double im) {
        double r57997 = re;
        double r57998 = exp(r57997);
        double r57999 = im;
        double r58000 = sin(r57999);
        double r58001 = r57998 * r58000;
        return r58001;
}

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