Average Error: 0.0 → 0.0
Time: 7.4s
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 r40731 = re;
        double r40732 = exp(r40731);
        double r40733 = im;
        double r40734 = sin(r40733);
        double r40735 = r40732 * r40734;
        return r40735;
}
↓
double f(double re, double im) {
        double r40736 = re;
        double r40737 = exp(r40736);
        double r40738 = im;
        double r40739 = sin(r40738);
        double r40740 = r40737 * r40739;
        return r40740;
}

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